Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

114227341454 · Jun 202019922001200920172026
48 results for past information

RNNs are suboptimal at compressing past sensory inputs for future prediction.

problem RNNs do not optimally compress past sensory inputs for future prediction.
method Investigated RNNs trained with maximum likelihood and found they extract unnecessary information. Injected noise into hidden states to improve performance.
result Injecting noise into RNN hidden states improves predictive information, sample quality, likelihood, and classification performance.

The study examines how investor protection and past information affect stock returns and interest rates.

problem Empirical regularities related to investor protection and past information in asset pricing models.
method Developed a dynamic asset pricing model with a controlling shareholder and good/bad memory in budget dynamics.
result Good/bad memory of investors on historical market information affects stock returns and interest rates, strengthening investor protection in high ownership concentration.

EvoRate metric assesses learnability of sequential data by measuring predictive information.

problem Model misspecification due to misinterpreting patterns in sequential data.
method Predictive information framework based on mutual information between past and future.
result Temporal patterns fundamentally constrain learnability; optimal predictors cannot outperform intrinsic information limit.

Past lightcones of certain points in globally hyperbolic spacetimes determine the entire spacetime.

problem Determining the entire spacetime from the past lightcone of a point.
method Analyzing properties of globally hyperbolic spacetimes and using null lines and observer horizons.
result Past lightcones of certain points in globally hyperbolic spacetimes determine the entire spacetime (up to isometry).

PI-SAC agents learn predictive information to improve RL efficiency.

problem Improving sample efficiency in reinforcement learning.
method PI-SAC agents use a contrastive version of Conditional Entropy Bottleneck to learn predictive information from past and future states.
result PI-SAC agents significantly improve sample efficiency on challenging continuous control tasks.

Paper analyzes iterative learning for concept classes and learns half-spaces.

problem Learning concept classes efficiently with iterative learners.
method Analyzes various settings of iterative learning and provides a constructive algorithm for half-spaces.
result Constructive iterative algorithm for learning half-spaces from informant.

Neural model uses deductive database to predict events from past patterns.

problem Difficulty in predicting future events from past patterns when event types are large.
method Temporal deductive database with rules to prove facts from other facts and past events. Neural nets model fact states and probabilities.
result Neural models derived from concise Datalog programs improve prediction by encoding domain knowledge.

We propose a new method to study the internal memory used by reinforcement learning policies. We estimate the amount of relevant past information by estimating mutual information between behavior histories and the current action of an agent. We perform this estimation in the passive setting, that is, we do not interven…

2016-11-21abs ↗pdf ↗

We study the flow of information and the evolution of internal representations during deep neural network (DNN) training, aiming to demystify the compression aspect of the information bottleneck theory. The theory suggests that DNN training comprises a rapid fitting phase followed by a slower compression phase, in whic…

2018-10-12abs ↗pdf ↗

Study on RNNs' ability to approximate past-dependent Hölder functions and their application to regression.

problem Understanding and optimizing the approximation capacity of RNNs for regression tasks.
method Derivation of upper bounds on RNN approximation error for Hölder smooth functions and application to regression.
result Achievement of minimax optimal prediction error bounds for RNNs under various data assumptions.

Bayesian mixture models are widely applied for unsupervised learning and exploratory data analysis. Markov chain Monte Carlo based on Gibbs sampling and split-merge moves are widely used for inference in these models. However, both methods are restricted to limited types of transitions and suffer from torpid mixing and…

2014-05-31abs ↗pdf ↗

We present two sampled quasi-Newton methods (sampled LBFGS and sampled LSR1) for solving empirical risk minimization problems that arise in machine learning. Contrary to the classical variants of these methods that sequentially build Hessian or inverse Hessian approximations as the optimization progresses, our proposed…

2019-01-28abs ↗pdf ↗

AdaX improves Adam by exponentially accumulating past gradients, leading to better performance in machine learning tasks.

problem Adam's fast convergence can lead to local minimums in non-convex problems.
method AdaX exponentially accumulates past gradients to adaptively tune the learning rate.
result AdaX outperforms Adam in various machine learning tasks, including computer vision and natural language processing.

Transformers learn to integrate information from past positions incrementally, specializing heads in distinct patterns.

problem How transformers learn to integrate information from multiple past positions with varying statistical significance.
method High-order Markov chain task, incremental learning, sparse attention patterns, simplified differential equations, stage-wise convergence, early stopping as regularizer.
result Transformers learn to specialize heads in distinct patterns, shifting from competitive to cooperative learning dynamics.

Financial markets, with their vast range of different investment opportunities, can be seen as a system of many different simultaneous games with diverse and often unknown levels of risk and reward. We introduce generalizations to the classic Kelly investment game [Kelly (1956)] that incorporates these features, and us…

2008-03-10abs ↗pdf ↗

Develops new Markov processes with switching rates and past dependence.

problem Modeling processes with dynamic switching rates and path dependence.
method Introduces a new class of Markov jump processes with regime switching and path dependence. Derives distributional properties and maximum likelihood estimates.
result Maximum likelihood estimates of the process parameters are derived in closed form and have asymptotic normality.

The paper introduces neural INGARCH models for time series of counts.

problem Analyzing time series of counts using traditional INGARCH models.
method Combining artificial neural networks with INGARCH models.
result Neural INGARCH models outperform traditional models in information loss.

DBULL learns new clusters without forgetting past knowledge in streaming unlabelled data.

problem Challenges in Unsupervised Lifelong Learning with evolving data distributions and class labels.
method Bayesian framework for incremental learning, Deep Bayesian Unsupervised Lifelong Learning (DBULL) algorithm, knowledge preservation mechanism, automatic cluster discovery.
result DBULL can progressively discover new clusters without forgetting past knowledge in unlabelled data.

IAM improves deep RL by selectively storing influential past observations.

problem Training and performance issues with recurrent neural networks in high-dimensional environments.
method Influence-aware memory architecture that restricts input to variables influencing hidden state.
result IAM outperforms standard RNNs in training speed and policy performance.

The proliferation of automated inference algorithms in Bayesian statistics has provided practitioners newfound access to fast, reproducible data analysis and powerful statistical models. Designing automated methods that are also both computationally scalable and theoretically sound, however, remains a significant chall…

2019-06-07abs ↗pdf ↗

We consider the problem of predicting the next observation given a sequence of past observations, and consider the extent to which accurate prediction requires complex algorithms that explicitly leverage long-range dependencies. Perhaps surprisingly, our positive results show that for a broad class of sequences, there …

2016-12-08abs ↗pdf ↗

We note a simple mechanism that may at least partially resolve several outstanding economic puzzles, including why the cyclically adjusted price to earnings ratio of the S&P 500 index has been oddly high for the past two decades, why gains to capital have outpaced gains to wages, and the persistence of the equity premi…

2016-10-25abs ↗pdf ↗

Improved ARMA-GARCH model for illiquid assets like cryptocurrencies.

problem Inadequate modeling of illiquid assets, especially cryptocurrencies, with traditional ARMA-GARCH models.
method Introducing liquidity-adjusted liquidity jump and diffusion metrics into ARMA-GARCH framework.
result The liquidity-adjusted model improves model fit and volatility sensitivity for cryptocurrencies.

A technique identifies memoryless algorithms approximating memory-dependent optimization methods.

problem Understanding how memory in optimization algorithms affects loss and generalization.
method Introducing a general technique to replace past iterates with the current one and adding a correction term.
result Lion does not have the same implicit anti-regularization as AdamW, explaining its better generalization performance.

How technology affects growth or employment has long been debated. With a hiatus, the debate revived once again in the form of how Information and Communications Technology, as a form of new technology, exerts on productivity and employment. Information and Communications Technology perceived as General Purpose Technol…

2017-04-05abs ↗pdf ↗

New method achieves superlinear convergence rate with limited memory.

problem Achieving superlinear convergence rate in quasi-Newton methods with limited memory.
method Limited-memory Greedy BFGS (LG-BFGS) method with displacement aggregation and basis vector selection.
result Explicit non-asymptotic superlinear convergence rate demonstrated.

This paper studies a composite problem involving the decision making of the optimal entry time and dynamic consumption afterwards. In stage-1, the investor has access to full market information subjecting to some information costs and needs to choose an optimal stopping time to initiate stage-2; in stage-2, the investo…

2019-03-11abs ↗pdf ↗

Approach collects missing outcomes to improve fairness in classification.

problem Lack of true outcomes for incorrectly classified samples leads to biased classifiers.
method Exploration-based data collection to ensure all subpopulations are represented and fairness properties are encoded.
result Trained classifier converges to a fair classifier with bounded false positives.