Papers › Better SGD using Second-order Momentum

Better SGD using Second-order Momentum

4 Mar 2021arXiv:2103.03265archive 2025-07-28

Hoang Tran, Ashok Cutkosky

We develop a new algorithm for non-convex stochastic optimization that finds an ϵ-critical point in the optimal O(ϵ⁻³) stochastic gradient and Hessian-vector product computations. Our algorithm uses Hessian-vector products to "correct" a bias term in the momentum of SGD with momentum. This leads to better gradient estimates in a manner analogous to variance reduction methods. In contrast to prior work, we do not require excessively large batch sizes, and are able to provide an adaptive algorithm whose convergence rate automatically improves with decreasing variance in the gradient estimates. We validate our results on a variety of large-scale deep learning architectures and benchmarks tasks.

PaperPDFCode

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

Code

tranhp98/Hessian mentioned in paperpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Stochastic Optimization

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

AdamSGD

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections