Tracking the gradients using the Hessian: A new look at variance reducing stochastic methods
Robert M. Gower, Nicolas Le Roux, Francis Bach

TL;DR
This paper introduces a Hessian-based approach to enhance variance reduction in stochastic optimization, improving convergence speed through better control variates and efficient Hessian approximations.
Contribution
It proposes a novel Hessian-tracking modification of SVRG, with efficient Hessian approximations, leading to faster convergence in stochastic methods.
Findings
Faster theoretical convergence close to the optimum.
Effective Hessian approximations using diagonal and low-rank matrices.
Demonstrated improvements across diverse problems.
Abstract
Our goal is to improve variance reducing stochastic methods through better control variates. We first propose a modification of SVRG which uses the Hessian to track gradients over time, rather than to recondition, increasing the correlation of the control variates and leading to faster theoretical convergence close to the optimum. We then propose accurate and computationally efficient approximations to the Hessian, both using a diagonal and a low-rank matrix. Finally, we demonstrate the effectiveness of our method on a wide range of problems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Gaussian Processes and Bayesian Inference · Markov Chains and Monte Carlo Methods
