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

3467101134 · Jun 202019922001200920172026
48 results for memory decay

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.

The study analyzes prediction errors in systems with memory kernels, providing bounds and stability results.

problem Prediction errors in stochastic dynamical systems with memory kernels.
method Analysis of generalized Langevin equations (GLEs) with Volterra equations, integrating synchronized noise coupling and weighted norms.
result Prediction discrepancies decay at a rate determined by the memory kernel's decay, quantitatively bounded by kernel estimation errors.

Simplicial persistence measures financial market dynamics, revealing long-term structure evolution.

problem Understanding the long-term structure evolution of financial markets.
method Simplicial persistence, null models, TMFG filtering, thresholding, generative process analysis.
result More liquid markets exhibit slower persistence decay, suggesting higher fragility to systemic shocks.

We propose a stochastic process driven by memory effect with novel distributions including both exponential and leptokurtic heavy-tailed distributions. A class of distribution is analytically derived from the continuum limit of the discrete binary process with the renormalized auto-correlation and the closed form momen…

2012-01-27abs ↗pdf ↗

Quantum systems with scrambling improve temporal information processing, but scaling requires exponential overhead.

problem Scalability and memory retention of quantum reservoirs in temporal information processing.
method Examined a quantum reservoir processing framework with scrambling reservoirs modeled by high-order unitary designs, analyzed in noiseless and noisy settings.
result Memory retention improves exponentially with reservoir size but worsens with reservoir iterations, requiring exponential shot overhead for scaling.

Financial market dynamics is rigorously studied via the exact generalized Langevin equation. Assuming market Brownian self-similarity, the market return rate memory and autocorrelation functions are derived, which exhibit an oscillatory-decaying behavior with a long-time tail, similar to empirical observations. Individ…

2010-10-11abs ↗pdf ↗

Parameterized state space models in the form of recurrent networks are often used in machine learning to learn from data streams exhibiting temporal dependencies. To break the black box nature of such models it is important to understand the dynamical features of the input driving time series that are formed in the sta…

2019-07-15abs ↗pdf ↗

It is generally accepted that many time series of practical interest exhibit strong dependence, i.e., long memory. For such series, the sample autocorrelations decay slowly and log-log periodogram plots indicate a straight-line relationship. This necessitates a class of models for describing such behavior. A popular cl…

2007-06-13abs ↗pdf ↗

For the London Stock Exchange we demonstrate that the signs of orders obey a long-memory process. The autocorrelation function decays roughly as τατ^{-α} with α0.6α\approx 0.6, corresponding to a Hurst exponent H0.7H \approx 0.7. This implies that the signs of future orders are quite predictable from the signs of past orde…

2003-11-04abs ↗pdf ↗

We describe a Markov latent state space (MLSS) model, where the latent state distribution is a decaying mixture over multiple past states. We present a simple sampling algorithm that allows to approximate such high-order MLSS with fixed time and memory costs.

2017-11-08abs ↗pdf ↗

Bayesian inference and superstatistics model financial volatility dynamics across different timescales.

problem Modeling correlated volatility in financial time series with heavy tails and long memory.
method Superstatistical dynamics, Bayesian Inference, Metropolis-Hasting sampling.
result The log-Normal model is reliable for short timescales, while inverse-Gamma is preferred for long timescales.

We propose a stochastic process driven by the memory effect with novel distributions which include both exponential and leptokurtic heavy-tailed distributions. A class of the distributions is analytically derived from the continuum limit of the discrete binary process with the renormalized auto-correlation. The moment …

2012-03-26abs ↗pdf ↗

In several recently proposed stochastic optimization methods (e.g. RMSProp, Adam, Adadelta), parameter updates are scaled by the inverse square roots of exponential moving averages of squared past gradients. Maintaining these per-parameter second-moment estimators requires memory equal to the number of parameters. For …

2018-04-11abs ↗pdf ↗

Recent empirical studies have demonstrated long-memory in the signs of orders to buy or sell in financial markets [2, 19]. We show how this can be caused by delays in market clearing. Under the common practice of order splitting, large orders are broken up into pieces and executed incrementally. If the size of such lar…

2004-12-27abs ↗pdf ↗

The probability of default (PD) estimation is an important process for financial institutions. The difficulty of the estimation depends on the correlations between borrowers. In this paper, we introduce a hierarchical Bayesian estimation method using the beta binomial distribution and consider a multi-year case with a …

2019-02-11abs ↗pdf ↗

The paper explores how score-driven models can approximate rough volatility.

problem Modeling rough volatility with long memory structures.
method Extending score-driven models to include infinite-lag structures and heavy-tailed decay.
result Score-driven models converge to fractional Ornstein-Uhlenbeck processes under appropriate scaling.

Improved performance of factorized neural layers through spectral initialization and Frobenius decay.

problem Improving the performance of factorized neural layers in various deep learning contexts.
method Spectral initialization and Frobenius decay for initialization and regularization.
result Spectral initialization and Frobenius decay lead to improved performance across multiple deep learning settings.

We investigate the probability distribution of the volatility return intervals ττ for the Chinese stock market. We rescale both the probability distribution Pq(τ)P_{q}(τ) and the volatility return intervals ττ as Pq(τ)=1/τˉf(τ/τˉ)P_{q}(τ)=1/\barτ f(τ/\barτ) to obtain a uniform scaling curve for different threshold value qq. The scali…

2008-05-15abs ↗pdf ↗

New method combines long-memory reservoirs for accurate dengue forecasting from short data.

problem Accurate dengue forecasting from short, noisy, non-stationary, and nonlinear data.
method Fractional ESN and Wavelet ESN frameworks integrating long-term memory.
result fESN and wESN outperform baselines in multiple dengue datasets and forecasting horizons.

In the online multiple testing problem, p-values corresponding to different null hypotheses are observed one by one, and the decision of whether or not to reject the current hypothesis must be made immediately, after which the next p-value is observed. Alpha-investing algorithms to control the false discovery rate (FDR…

2017-10-02abs ↗pdf ↗

Enhanced financial trading system using multi-agent LLMs with layered memory.

problem Inefficient prioritization of tasks in LLMs due to their memory processing.
method Introducing a multi-agent framework with layered memories and inter-agent debate.
result Superior automated trading accuracy and decision robustness.

Using a relationship between the moments of the probability distribution of times between the two consecutive trades (intertrade time distribution) and the moments of the distribution of a daily number of trades we show, that the underlying point process is essentially non-markovian. A detailed analysis of all trades i…

2003-03-12abs ↗pdf ↗

Logarithmic-time schedules boost large-scale language model training efficiency.

problem Improving performance and efficiency in large-scale language model training.
method Designing time-varying hyperparameters (β1,β2,λ)(β_1, β_2, λ) for AdamW, specifically logarithmic-time scheduling with damping mechanisms.
result ADANA optimizer achieves up to 40% compute efficiency compared to tuned AdamW, with gains persisting as model scale increases.

HOPE improves SSMs for long-memory tasks with robust initialization and training.

problem Improving state-space models for long-memory tasks with robust initialization and training.
method Developed a new parameterization scheme called HOPE using Hankel operators and Markov parameters.
result HOPE improves SSMs' performance on Long-Range Arena tasks and demonstrates non-decaying memory.

New quantization methods improve accuracy of Random Fourier Features.

problem Improving accuracy of Random Fourier Features for machine learning.
method Sigma-Delta and distributed noise-shaping quantization methods for 1-bit and low bit-depth quantization.
result Quantized RFFs allow high accuracy approximation of underlying kernels with polynomial error decay.

We review statistical properties of models generated by the application of a (positive and negative order) fractional derivative operator to a standard random walk and show that the resulting stochastic walks display slowly-decaying autocorrelation functions. The relation between these correlated walks and the well-kno…

2008-06-19abs ↗pdf ↗