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

Trend · papers per month

90180269359 · Jun 202019922001200920172026
48 results for weighted moving average

Optimal weight windows are found by projecting the origin onto a convex polytope.

problem Finding the best weight windows for a weighted moving average smoother.
method Formulated as a quadratic program and projection onto a convex polytope.
result Optimal weight windows are symmetrical and decrease in weight away from the center.

Enhances trading signals using image analysis and weighted moving averages.

problem Improving price trend trading strategies in financial markets.
method Image-induced importance weights applied to weighted moving averages of trading signals.
result Significant enhancement of price trend trading signals with improved portfolio selection.

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.

Extends double linear policy with time-varying weights and proves robust positive expectation.

problem Ensuring robustness in policy optimization with time-varying parameters.
method Employed a novel elementary symmetric polynomials characterization approach to prove robust positive expectation (RPE). Derived explicit expressions for expected cumulative gain-loss and variance.
result Proved the robust positive expectation property holds for the extended double linear policy.

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.

New method estimates robust multi-period portfolios using entropy.

problem Lack of general agreement on building robust multi-period portfolios.
method Detrended cluster entropy approach to estimate portfolio weights.
result Portfolio weights are estimated reliably from real-world data at varying time horizons.

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.

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 ↗

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.

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 ↗

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.

Dynamic trading strategies, in the spirit of trend-following or mean-reversion, represent an only partly understood but lucrative and pervasive area of modern finance. Assuming Gaussian returns and Gaussian dynamic weights or signals, (e.g., linear filters of past returns, such as simple moving averages, exponential we…

2019-05-31abs ↗pdf ↗

Conventional Monte Carlo simulations are stochastic in the sense that the acceptance of a trial move is decided by comparing a computed acceptance probability with a random number, uniformly distributed between 0 and 1. Here we consider the case that the weight determining the acceptance probability itself is fluctuati…

2016-12-19abs ↗pdf ↗

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 ↗

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 ↗

This paper develops a new theory for ensemble learning beyond variance reduction.

problem Ensemble learning's effectiveness for stable estimators is not fully explained by variance reduction.
method Develops a general weighting theory for ensemble learning, formalizing ensembles as linear operators and introducing geometric and spectral constraints.
result Structured weights can outperform uniform averaging by reshaping approximation geometry and redistributing spectral complexity.

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 ↗

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.

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 ↗

Efficient method for pricing Bermudan moving average options using GPR-GHQ.

problem High-dimensional pricing of Bermudan moving average options in energy markets.
method Gaussian Process Regression and Gauss-Hermite quadrature.
result GPR-GHQ method efficiently handles long windows and high dimensionality.

New method predicts spatio-temporal data with short and long-range dependence.

problem Uncertainty in predicting the distribution of mixed moving average fields.
method Theory-guided machine learning approach using generalized Bayesian algorithm.
result Fixed-time and any-time PAC Bayesian bounds for ensemble forecasts.

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.

In this paper we consider backward stochastic differential equations with time-delayed generators of a moving average type. The classical framework with linear generators depending on (Y(t),Z(t))(Y(t),Z(t)) is extended and we investigate linear generators depending on (1t0tY(s)ds,1t0tZ(s)ds)(\frac{1}{t}\int_0^tY(s)ds, \frac{1}{t}\int_0^tZ(s)ds). We…

2010-08-22abs ↗pdf ↗

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.

Paper explores weighted averaging schemes for SGD, achieving asymptotic normality and optimality.

problem Improving convergence of SGD in various settings.
method Develops a general weighted averaging scheme for SGD and establishes asymptotic normality.
result Establishes asymptotic normality and optimality of weighted averaged SGD solutions.

This paper analyzes SGD with increasingly weighted averaging for optimization and generalization.

problem Improving optimization and generalization for non-strongly convex objectives.
method Comprehensive analysis of increasingly weighted averaging schemes for convex, strongly convex, and non-convex objectives.
result The weight αα affects both optimization and generalization errors, revealing a trade-off.