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

2975938901,186 · Jun 202019922001200920172026
48 results for Momentum methods

Two major momentum-based techniques that have achieved tremendous success in optimization are Polyak's heavy ball method and Nesterov's accelerated gradient. A crucial step in all momentum-based methods is the choice of the momentum parameter mm which is always suggested to be set to less than 11. Although the choice…

2017-12-20abs ↗pdf ↗

Efficient momentum-based methods for reinforcement learning with improved sample complexity.

problem Efficient reinforcement learning algorithms for non-concave performance functions.
method Adaptive momentum-based policy gradient methods using variance reduction and importance sampling techniques.
result Both IS-MBPG and HA-MBPG reach the best known sample complexity of O(ε3)O(ε^{-3}) for finding an εε-stationary point.

The use of momentum in stochastic gradient methods has become a widespread practice in machine learning. Different variants of momentum, including heavy-ball momentum, Nesterov's accelerated gradient (NAG), and quasi-hyperbolic momentum (QHM), have demonstrated success on various tasks. Despite these empirical successe…

2019-10-30abs ↗pdf ↗

Adaptive momentum method solves non-convex min-max problems.

problem Non-convex min-max optimization problems in training generative adversarial networks.
method Proposes an adaptive momentum algorithm for non-convex min-max optimization.
result Establishes non-asymptotic convergence rates for the proposed algorithm.

New method uses momentum to converge in DC optimization with small batches.

problem Lack of convergence properties for stochastic difference-of-convex optimization with small batch sizes.
method Introduces momentum to enable convergence under standard assumptions for any batch size.
result Proves convergence of the algorithm under smoothness and bounded variance assumptions.

Stochastic proximal point algorithm with momentum converges faster and is more stable than standard methods.

problem Improving convergence and stability of stochastic optimization methods.
method Developed and analyzed the convergence and stability of the stochastic proximal point algorithm with momentum (SPPAM).
result SPPAM converges faster and is more stable than standard stochastic proximal point algorithm (SPPA) and stochastic gradient descent with momentum (SGDM).

Momentum speeds up evolutionary processes in machine learning.

problem Accelerating convergence in evolutionary dynamics.
method Combining momentum from machine learning with evolutionary dynamics using information divergences as Lyapunov functions.
result Momentum accelerates convergence of evolutionary dynamics, including the replicator equation and Euclidean gradient descent.

New methods solve optimization problems with heavy-tailed noise, improving upon existing complexity bounds.

problem Optimization problems with heavy-tailed noise and weakly average smoothness.
method Normalized stochastic first-order methods with Polyak, multi-extrapolated, and recursive momentum.
result First-order oracle complexity results for finding approximate stochastic stationary points under heavy-tailed noise.

The article examines in some detail the convergence rate and mean-square-error performance of momentum stochastic gradient methods in the constant step-size and slow adaptation regime. The results establish that momentum methods are equivalent to the standard stochastic gradient method with a re-scaled (larger) step-si…

2016-03-14abs ↗pdf ↗

Analysis of momentum methods on quadratic models, showing SGD's superiority.

problem Analysis of stochastic gradient algorithms with momentum on quadratic models.
method Inspired by random matrix theory, exact characterization of loss values.
result Stochastic heavy-ball momentum does not improve over SGD in the strongly convex setting.

Enhanced trend-following strategy using network momentum for commodity futures.

problem Improving systematic trend-following in commodity futures markets.
method Combines univariate and cross-sectional trend indicators, including network momentum.
result Statistically significant improvements in portfolio performance metrics.

Gradient descent-based optimization methods underpin the parameter training of neural networks, and hence comprise a significant component in the impressive test results found in a number of applications. Introducing stochasticity is key to their success in practical problems, and there is some understanding of the rol…

2019-06-10abs ↗pdf ↗

New insights into training machine learning models with momentum.

problem Lack of theoretical understanding on the generalization error of momentum-based methods.
method Analyzed modified momentum-based update rule (SGDEM) for smooth Lipschitz loss functions.
result SGDEM admits an upper-bound on the generalization error for smooth Lipschitz loss functions.

New method constructs axial vector fields and defines quasi-local spin-angular momentum.

problem Constructing axial vector fields on Riemannian two-spheres.
method Using centre-of-mass unit sphere reference systems and Lie-propagated unit sphere reference systems.
result Constructive definition of quasi-local spin-angular momentum and balance relations.

New insights into using momentum for non-convex optimization.

problem Improving training of non-convex models like deep neural networks.
method Developed a Lyapunov analysis of SGD with momentum using stochastic primal averaging.
result Precise conditions under which SGD+M outperforms SGD and optimal hyper-parameter schedules.

Negative momentum accelerates convergence in minimax games but at a suboptimal rate.

problem The convergence rate of negative momentum in minimax games is suboptimal.
method Extending variational inequality formulation, connecting momentum method with Chebyshev polynomials.
result Negative momentum accelerates convergence locally but at a suboptimal rate.

Study accelerates optimization methods in non-convex problems, but doesn't improve the algorithm's performance.

problem Understanding the behavior of momentum-based acceleration methods in non-convex, high-dimensional landscapes.
method Used dynamical mean field theory to describe the average dynamics of heavy-ball momentum and Nesterov acceleration in a non-convex model.
result Accelerated dynamics but did not improve the algorithm's performance with respect to gradient descent.

The study finds that factor momentum is significant only at short lags compared to stock momentum.

problem Investigating the relationship between factor momentum and stock momentum.
method Replicated earlier findings and conducted a spanning test controlling for stock momentum and factor exposure.
result Factor momentum is significant only at short lags after controlling for stock momentum and factor exposure.

We identity a by-far-unrecognized problem of Adam-style optimizers which results from unnecessary coupling between momentum and adaptivity. The coupling leads to instability and divergence when the momentum and adaptivity parameters are mismatched. In this work, we propose a method, Laprop, which decouples momentum and…

2020-02-12abs ↗pdf ↗

Improved loss scaling for stochastic momentum algorithms in high dimensions.

problem Improving loss scaling for stochastic momentum algorithms in high dimensions.
method Dimension-adapted Nesterov acceleration (DANA) scales momentum hyperparameters based on model size and data complexity.
result DANA improves loss scaling exponents across various data and target complexities.

Asynchronous methods are widely used in deep learning, but have limited theoretical justification when applied to non-convex problems. We show that running stochastic gradient descent (SGD) in an asynchronous manner can be viewed as adding a momentum-like term to the SGD iteration. Our result does not assume convexity …

2016-05-31abs ↗pdf ↗

New method for studying tt-dependent Hamilton equations on cosymplectic manifolds.

problem Existence and stability of solutions of tt-dependent Hamilton equations.
method Develops a cosymplectic energy-momentum method for Hamilton equations with more types of symmetries.
result Provides a more general framework for studying tt-dependent Hamilton equations.

We test the price momentum effect in the Korean stock markets under the momentum universe shrinkage to subuniverses of the KOSPI 200. Performance of the momentum strategy is not homogeneous with respect to change of the momentum universe. It is found that some submarkets generate the higher momentum returns than other …

2012-11-28abs ↗pdf ↗

Hyperparameter tuning is one of the most time-consuming workloads in deep learning. State-of-the-art optimizers, such as AdaGrad, RMSProp and Adam, reduce this labor by adaptively tuning an individual learning rate for each variable. Recently researchers have shown renewed interest in simpler methods like momentum SGD …

2017-06-12abs ↗pdf ↗

Introduces homotopy momentum sections on multisymplectic manifolds.

problem No specific problem stated; focuses on introducing a new concept.
method Introduces a new concept of homotopy momentum sections on multisymplectic manifolds.
result Shows that a gauged nonlinear sigma model with Wess-Zumino term has homotopy momentum section structure.

Generalizes energy-momentum method for non-autonomous Hamiltonian systems.

problem Stability analysis of non-autonomous Hamiltonian systems with symmetries.
method Develops a new approach to relative equilibrium points and stability conditions for non-autonomous systems.
result Conditions ensuring stability of relative equilibrium points in non-autonomous Hamiltonian systems.

We provide an improved analysis of normalized SGD showing that adding momentum provably removes the need for large batch sizes on non-convex objectives. Then, we consider the case of objectives with bounded second derivative and show that in this case a small tweak to the momentum formula allows normalized SGD with mom…

2020-02-09abs ↗pdf ↗

Customer momentum is a positive relationship between a firm's returns and past returns of its customers.

problem Understanding the relationship between a firm's returns and its customers' past returns.
method Examined customer momentum using a long-short equally-weighted decile portfolio and Fama-French factor models.
result Customer momentum generates significant monthly returns and is statistically significant.

Nesterov's momentum trick is famously known for accelerating gradient descent, and has been proven useful in building fast iterative algorithms. However, in the stochastic setting, counterexamples exist and prevent Nesterov's momentum from providing similar acceleration, even if the underlying problem is convex and fin…

2016-03-18abs ↗pdf ↗

The study analyzes momentum-based optimization algorithms from dynamical systems perspective.

problem Understanding convergence rates of momentum-based optimization algorithms.
method Exploits dynamical systems, control theory, and symplectic perspectives to analyze convergence rates.
result Provides closed-form expressions relating algorithm parameters to convergence rates.

This paper examines momentum spillover across multiple asset classes using only pricing data.

problem Challenges in studying momentum spillover across diverse asset classes due to lack of common characteristics.
method Utilised a linear and interpretable graph learning model to reveal momentum spillover network.
result Network momentum strategy yields a Sharpe ratio of 1.5 and an annual return of 22%.

While momentum-based accelerated variants of stochastic gradient descent (SGD) are widely used when training machine learning models, there is little theoretical understanding on the generalization error of such methods. In this work, we first show that there exists a convex loss function for which the stability gap fo…

2018-09-12abs ↗pdf ↗