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

2457 · Jan 202019922001200920172026
48 results for moving-average

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 ↗

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.

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 ↗

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 ↗

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.

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 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.

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.

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 ↗

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.

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.

On-line portfolio selection has attracted increasing interests in machine learning and AI communities recently. Empirical evidences show that stock's high and low prices are temporary and stock price relatives are likely to follow the mean reversion phenomenon. While the existing mean reversion strategies are shown to …

2012-06-18abs ↗pdf ↗

We introduce a stochastic price model where, together with a random component, a moving average of logarithmic prices contributes to the price formation. Our model is tested against financial datasets, showing an extremely good agreement with them. It suggests how to construct trading strategies which imply a capital g…

2000-11-20abs ↗pdf ↗

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.

We derive an explicit formula for likelihood function for Gaussian VARMA model conditioned on initial observables where the moving-average (MA) coefficients are scalar. For fixed MA coefficients the likelihood function is optimized in the autoregressive variables ΦΦ's by a closed form formula generalizing regression c…

2016-04-29abs ↗pdf ↗

The detrending moving average (DMA) algorithm is a widely used technique to quantify the long-term correlations of non-stationary time series and the long-range correlations of fractal surfaces, which contains a parameter θθ determining the position of the detrending window. We develop multifractal detrending moving a…

2010-05-06abs ↗pdf ↗

Long short-term memory network outperforms seasonal model in JSE Top 40 forecasting.

problem Comparing neural network performance to traditional models in financial forecasting.
method Used long short-term memory network for JSE Top 40 return data forecasting.
result Long short-term memory network outperforms seasonal model in forecasting.

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.

How effective are the most common trading models? The answer may help investors realize upsides to using each model, act as a segue for investors into more complex financial analysis and machine learning, and to increase financial literacy amongst students. Creating original versions of popular models, like linear regr…

2019-07-21abs ↗pdf ↗

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.

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.

The task of predicting future stock values has always been one that is heavily desired albeit very difficult. This difficulty arises from stocks with non-stationary behavior, and without any explicit form. Hence, predictions are best made through analysis of financial stock data. To handle big data sets, current conven…

2019-04-17abs ↗pdf ↗

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 ↗

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.