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

87174260347 · Jun 202019922001200920172026
48 results for mixed moving average fields

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.

Paper proposes a mean-field gradient descent for zero-sum games, proving convergence to Nash equilibrium.

problem Finding mixed Nash equilibria in zero-sum games with multiple players.
method Mean-field gradient descent dynamics with time-averaging, incorporating exponentially discounted gradients.
result Exponential convergence rate to mixed Nash equilibrium with respect to total variation metric.

The study explores mixed Killing vector fields on almost coKähler manifolds.

problem Characterizing mixed Killing vector fields on almost coKähler manifolds.
method Generalized Bochner's theorem for mixed Killing vector fields and studied in the context of almost coKähler structures.
result The Reeb vector field on an almost coKähler manifold is mixed Killing if and only if the operator h=0h=0.

New methods for delta-moves on algebraically split links identified.

problem Understanding delta-moves on algebraically split links.
method Introducing self and mixed delta-moves, proving equivalence, and calculating delta-splitting numbers.
result Two links are mixed delta-equivalent if they have the same pairwise linking number and components.

We consider the mixed ray transform of tensor fields on a three-dimensional compact simple Riemannian manifold with boundary. We prove the injectivity of the transform, up to natural obstructions, and establish stability estimates for the normal operator on generic three dimensional simple manifold in the case of 1+1 a…

2019-09-24abs ↗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 ↗

Mixed data comprises both numeric and categorical features, and mixed datasets occur frequently in many domains, such as health, finance, and marketing. Clustering is often applied to mixed datasets to find structures and to group similar objects for further analysis. However, clustering mixed data is challenging becau…

2018-11-11abs ↗pdf ↗

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.

New algorithm for solving minimax problems over distributions converges to Nash equilibrium.

problem Solving minimax problems over probability distributions.
method Symmetric Mean-field Langevin Dynamics (MFL-AG and MFL-ABR) with weighted averaging and best response dynamics.
result Converges to mixed Nash equilibrium with average-iterate and last-iterate convergence.

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.

ARMA nets expand receptive fields for dense prediction tasks.

problem Global information in dense prediction problems is challenging for traditional convolutional layers.
method ARMA layers with adjustable autoregressive coefficients replace traditional convolutions.
result ARMA networks improve dense prediction tasks including video prediction and semantic segmentation.

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 ↗

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 assesses financial and cyber risks under uncertainty.

problem Uncertainty in risk assessment for financial and cyber systems.
method Combines stochastic approximation and distorted mix method to compute worst case average value at risk.
result Efficient algorithm for tail uncertainty in multivariate distributions.

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.

New algorithm learns optimal policy for average reward MDPs with sample complexity matching lower bound.

problem Learning optimal policy for average reward in uniformly ergodic MDPs.
method Developed an estimator with sample complexity of O(|S||A|t_{mix}ε^{-2}).
result First algorithm to match lower bound of existing literature.

Bayesian framework mixes imperfect models for improved predictions.

problem Improving predictions of complex computational models in unknown domains.
method Local Bayesian Dirichlet mixing of imperfect models using the Dirichlet distribution.
result Global and local mixtures of models achieve excellent performance in prediction accuracy and uncertainty quantification.

Study on mixed Killing vector fields on Cigar Ricci-Bourguignon solitons.

problem Characterizing mixed Killing vector fields on Cigar Ricci-Bourguignon solitons.
method Analyzing the condition LVLVg=fLVgL_V L_V g = f\,L_V g and using rigidity phenomena.
result Dimension of complete mixed Killing fields is 5 and a basis is explicitly determined.

A new MFG framework for evolving clusters from Gaussian mixtures.

problem Evolutionary clustering of time-dependent Gaussian mixtures.
method Control-theoretic framework based on Mean Field Games (MFG) with coupled HJB and Fokker-Planck systems.
result MFG dynamics recover classical EM algorithm trajectories with mass conservation.

In this paper we describe braid equivalence for knots and links in a 3-manifold MM obtained by rational surgery along a framed link in S3S^3. We first prove a sharpened version of the Reidemeister theorem for links in MM. We then give geometric formulations of the braid equivalence via mixed braids in S3S^3 using the…

2013-11-08abs ↗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.

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.

Let ViV_i be a finite dimensional Hermitian vector space of holomorphic sections of a line bundle LiL_i on a complex nn-dimensional manifold XX. We associate to ViV_i the non-negative Hermitian quadratic form gig_i on X,X, define a Hermitian mixed volume of XX for a "mixing tuple" of nn non-negative Hermitian forms…

2018-11-14abs ↗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.

One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogues of classical filters, but intended for signals defined on graphs. This work brings forth new insights on the distributed graph filtering problem. We design a family of autoregressive moving average (ARMA) recursions,…

2016-02-14abs ↗pdf ↗

Defines observer-invariant time derivatives on moving surfaces.

problem Deriving appropriate definitions for time derivatives on surfaces that move.
method Systematically derived from spacetime settings, considering observer-invariance and covariance principles.
result Formulations applicable for computations of tangential n-tensor fields on moving surfaces.
Agents Play Mix-gamephysics.soc-ph

In mix-game which is an extension of minority game, there are two groups of agents; group1 plays the majority game, but the group2 plays the minority game. This paper studies the change of the average winnings of agents and volatilities vs. the change of mixture of agents in mix-game model. It finds that the correlatio…

2005-05-17abs ↗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.

The Cayley--Salmon theorem implies the existence of a 27-sheeted covering space specifying lines contained in smooth cubic surfaces over C\mathbb{C}. In this paper we compute the rational cohomology of the total space of this cover, using the spectral sequence in the method of simplicial resolution developed by Vassil…

2018-03-12abs ↗pdf ↗

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.

Particle MCMC involves using a particle filter within an MCMC algorithm. For inference of a model which involves an unobserved stochastic process, the standard implementation uses the particle filter to propose new values for the stochastic process, and MCMC moves to propose new values for the parameters. We show how p…

2014-08-29abs ↗pdf ↗

Enhances MMSB for complex graph structures with HL-MRF priors.

problem Limited modeling of correlated graph structures in MMSB.
method HL-MRF as structured prior for mixed membership distributions.
result Improves log-likelihood by 15% on average across datasets.