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,657 papers · 148 categories

Trend · papers per month

56111167222 · May 202619922001200920172026
48 results for Exponential Moving Average

In this note we discuss the mathematical tools to define trend indicators which are used to describe market trends. We explain the relation between averages and moving averages on the one hand and the so called exponential moving average (EMA) on the other hand. We present a lot of examples and give the definition of t…

2020-01-10abs ↗pdf ↗

Improved averaging method for noisy observations converges strongly.

problem Noisy observations from random dynamical systems require stable estimates.
method Introduced pp-EMA, a modified exponential moving average with subharmonic weight decay.
result Stochastic convergence guarantees for pp-EMA under mild assumptions.

PACE optimizes training for averaged language models, improving performance.

problem How to optimize training for averaged language model iterates.
method Formulated as an optimal-control problem, solved for minimizing error of the average with a penalty on intervention size.
result PACE improves the limiting squared error of the iterate-average estimator by an arbitrarily large factor on some instances.

Machine learning models outperform traditional technical analysis in Bitcoin trading.

problem Maximizing profits in the Bitcoin market using trading signals.
method Comparison of machine learning models (LightGBM, LSTM) and technical analysis strategies (EMA, MACD+ADX).
result LSTM model achieved a 65.23% cumulative return over a year, significantly outperforming other strategies.

Adaptive t-distribution estimates nonstationary time series using moving moments.

problem Nonstationary time series with varying dependence structure.
method Moving estimator optimizing a weighted log-likelihood, using exponential moving averages for moments.
result Evolution of ν parameter in Student's t-distribution, capturing tail behavior and extreme events.

We examine two different techniques for parameter averaging in GAN training. Moving Average (MA) computes the time-average of parameters, whereas Exponential Moving Average (EMA) computes an exponentially discounted sum. Whilst MA is known to lead to convergence in bilinear settings, we provide the -- to our knowledge …

2018-06-12abs ↗pdf ↗

GPA improves LLM training speed by 8.71% for Llama-160M models.

problem Training Large Language Models (LLMs) with high memory overhead and slow convergence.
method Generalized Primal Averaging (GPA) extends Nesterov's method to eliminate memory-intensive two-loop structure.
result GPA achieves up to 10.13% speedup over AdamW in training Llama-1B model.

A new method normalizes flow mixtures for better inference across different data types.

problem Inference failure across diverse posterior geometries in normalizing flows.
method Introduces a two-stage framework with a stable global weighting mechanism based on sEMA.
result Achieves consistent NLL improvements and stable weight trajectories over baselines.

The paper optimizes portfolios using MACD signals derived from price history.

problem Optimizing risky asset portfolios with latent mean-reverting and momentum factors.
method Derives optimal strategies based on MACD signals from EMA processes.
result Establishes admissibility and verification of optimal strategies.

New adaptive methods solve weakly convex stochastic optimization problems.

problem Solving weakly convex stochastic optimization problems.
method Adaptive first and zeroth-order methods using exponential moving averages.
result Established non-asymptotic convergence rates for nonsmooth and nonconvex problems.

Several recently proposed stochastic optimization methods that have been successfully used in training deep networks such as RMSProp, Adam, Adadelta, Nadam are based on using gradient updates scaled by square roots of exponential moving averages of squared past gradients. In many applications, e.g. learning with large …

2019-04-19abs ↗pdf ↗

We show Vector Autoregressive Moving Average models with scalar Moving Average components could be estimated by generalized least square (GLS) for each fixed moving average polynomial. The conditional variance of the GLS model is the concentrated covariant matrix of the moving average process. Under GLS the likelihood …

2019-09-01abs ↗pdf ↗

A new method Expectigrad improves on Adam and RMSProp by reducing divergence and improving performance.

problem Improving the convergence properties of adaptive gradient methods like Adam and RMSProp.
method Adjusts stepsizes using a per-component unweighted mean of all historical gradients and a bias-corrected momentum term.
result Cannot diverge on convex optimization problems that cause Adam to diverge.

Behavior cloning training instabilities amplified by SGD noise over long horizons.

problem Training instabilities in behavior cloning with deep neural networks.
method Empirical dissection of minibatch SGD updates and their effects on long-horizon rewards.
result Exponential moving average (EMA) of iterates effectively mitigates gradient variance amplification (GVA).

This study uses moving average cluster entropy to analyze financial market dynamics.

problem Understanding long-range dependence in financial markets.
method Moving average cluster entropy approach applied to ARFIMA and FBM processes.
result Long-range positive correlation in financial markets is linked to the cluster entropy behavior.

Improved diffusion models for image synthesis with better training dynamics.

problem Uneven and ineffective training in diffusion models.
method Redesigned network layers to preserve activation, weight, and update magnitudes.
result Significantly better networks at equal computational complexity, improving FID to 1.81.

Study compares local and global models for hierarchical forecasting accuracy.

problem Challenges in hierarchical time series forecasting, especially in accuracy and information utilisation.
method Developed and evaluated local and global forecasting models (GFMs) to exploit cross-series and cross-hierarchies information.
result Global Forecasting Models (GFMs) outperform local models in hierarchical forecasting accuracy and computational efficiency.

Adaptive estimation of alpha-Stable distribution and Hurst exponent for nonstationary time series.

problem Nonstationary time series require adaptive models to avoid bias.
method Moving estimator with exponentially weakening weights of old values, optimized using EMA of absolute central moments.
result Continuous adaptive estimation of alpha-Stable distribution and Hurst exponent for market stability evaluation.

This work provides a scaling rule for model EMA optimization across batch sizes.

problem Training dynamics and performance differences across batch sizes when using model EMA.
method Developed a scaling rule for model EMA optimization, demonstrating its validity across various architectures and data modalities.
result Enabled SSL methods like BYOL to train at larger batch sizes without performance degradation.

Logarithmic regret for continuous-time reinforcement learning.

problem Continuous-time Markov decision processes with unknown transition probabilities and holding times.
method Upper confidence reinforcement learning, mean holding time estimation, stochastic comparison of point processes.
result Logarithmic regret bound achieved in finite time.

Optimal algorithms for Riemannian optimization with reduced complexity.

problem Stochastic optimization on Riemannian manifolds with limited data.
method Zeroth-order Riemannian Averaging Stochastic Approximation algorithms using Riemannian moving-average estimators and novel geometric conditions.
result Achieves optimal sample complexities for generating approximate first-order stationary solutions.

The Hurst exponent HH of long range correlated series can be estimated by means of the Detrending Moving Average (DMA) method. A computational tool defined within the algorithm is the generalized variance σDMA2=1/(Nn)i[y(i)y~n(i)]2 σ_{DMA}^2={1}/{(N-n)}\sum_i [y(i)-\widetilde{y}_n(i)]^2\:, with y~n(i)=1/nky(ik)\widetilde{y}_n(i)= {1}/{n}\sum_{k}y(i-k) the…

2006-08-31abs ↗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 ↗

The possibility that price dynamics is affected by its distance from a moving average has been recently introduced as new statistical tool. The purpose is to identify the tendency of the price dynamics to be attractive or repulsive with respect to its own moving average. We consider a number of tests for various models…

2006-01-12abs ↗pdf ↗

InQMAD detects anomalies in streaming data using quantum measurements and density matrices.

problem Detecting anomalies in streaming data with challenges like conceptual drift and continuous learning.
method Incremental anomaly detection based on random Fourier features and quantum measurements.
result InQMAD outperforms 12 state-of-the-art methods in a systematic evaluation.

In this paper, we investigate trading strategies based on exponential moving averages (ExpMAs) of an underlying risky asset. We study both logarithmic utility maximization and long-term growth rate maximization problems and find closed-form solutions when the drift of the underlying is modeled by either an Ornstein-Uhl…

2017-10-25abs ↗pdf ↗

We propose a method for pricing American options whose pay-off depends on the moving average of the underlying asset price. The method uses a finite dimensional approximation of the infinite-dimensional dynamics of the moving average process based on a truncated Laguerre series expansion. The resulting problem is a fin…

2010-11-16abs ↗pdf ↗

The paper analyzes MACD using operator theory.

problem Understanding the mathematical foundation of MACD.
method Developed a functional-analytic framework interpreting MACD as a phase-corrected, smoothed derivative operator.
result MACD is structurally equivalent to a band-pass filter and can be expressed as a finite difference of delayed and doubly averaged signals.

Paper predicts cryptocurrency bull and bear phases using Bitcoin's moving averages.

problem Determining cryptocurrency bull and bear phases based on Bitcoin performance.
method Employing predictive algorithms to forecast Bitcoin's 50 Day and 200 Day Moving Averages.
result Predicted data from Bitcoin's moving averages helps identify potential bull and bear phases.