Stochastic heavy ball
From MaRDI portal
Publication:1697485
DOI10.1214/18-EJS1395zbMath1392.62244arXiv1609.04228OpenAlexW2520472982MaRDI QIDQ1697485
Sébastien Gadat, Sofiane Saadane, Fabien Panloup
Publication date: 20 February 2018
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.04228
Central limit and other weak theorems (60F05) Estimates of eigenvalues in context of PDEs (35P15) Stochastic approximation (62L20) Hypoelliptic equations (35H10) Applications of Brownian motions and diffusion theory (population genetics, absorption problems, etc.) (60J70)
Related Items (16)
Unnamed Item ⋮ Differentially Private Accelerated Optimization Algorithms ⋮ Subgradient Sampling for Nonsmooth Nonconvex Minimization ⋮ Optimal non-asymptotic analysis of the Ruppert-Polyak averaging stochastic algorithm ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the rates of convergence of parallelized averaged stochastic gradient algorithms ⋮ Convergence of gradient algorithms for nonconvex \(C^{1+ \alpha}\) cost functions ⋮ Convergence and Dynamical Behavior of the ADAM Algorithm for Nonconvex Stochastic Optimization ⋮ Stochastic optimization with momentum: convergence, fluctuations, and traps avoidance ⋮ Non asymptotic controls on a recursive superquantile approximation ⋮ Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods ⋮ Stochastic approximation algorithms for superquantiles estimation ⋮ Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces ⋮ SRKCD: a stabilized Runge-Kutta method for stochastic optimization ⋮ An adaptive Polyak heavy-ball method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- An optimal method for stochastic composite optimization
- Nonconvergence to unstable points in urn models and stochastic approximations
- Stochastic approximation. A dynamical systems viewpoint.
- Stochastic approximation with two time scales
- Introductory lectures on convex optimization. A basic course.
- Self-interacting diffusions.
- Asymptotic pseudotrajectories and chain recurrent flows, with applications
- Do stochastic algorithms avoid traps?
- An adaptive scheme for the approximation of dissipative systems
- Long time behaviour and stationary regime of memory gradient diffusions
- Local minima and convergence in low-rank semidefinite programming
- Ergodicity for SDEs and approximations: locally Lipschitz vector fields and degenerate noise.
- Multidimensional diffusion processes.
- Optimal non-asymptotic analysis of the Ruppert-Polyak averaging stochastic algorithm
- Concentration Inequalities
- A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
- Adaptivity of averaged stochastic gradient descent to local strong convexity for logistic regression
- Stability of Markovian processes III: Foster–Lyapunov criteria for continuous-time processes
- Large-Scale Machine Learning with Stochastic Gradient Descent
- On the Long Time Behavior of Second Order Differential Equations with Asymptotically Small Dissipation
- On the long time behavior of second order differential equations with asymptotically small dissipation
- Hypocoercivity
- Acceleration of Stochastic Approximation by Averaging
- On the Convergence of Gradient-Like Flows with Noisy Gradient Input
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Some methods of speeding up the convergence of iteration methods
- Stochastic Estimation of the Maximum of a Regression Function
- A Stochastic Approximation Method
This page was built for publication: Stochastic heavy ball
