Variance-Reduced Accelerated First-order Methods: Central Limit Theorems and Confidence Statements
Jinlong Lei, Uday V. Shanbhag

TL;DR
This paper develops a theoretical framework for variance-reduced stochastic first-order methods in convex optimization, establishing central limit theorems and confidence regions for the estimates, with practical implications for stochastic parameter estimation.
Contribution
It introduces a unified approach to analyze the asymptotic distribution of stochastic gradient methods with increasing sample sizes, including new CLTs and confidence region construction.
Findings
Estimates converge in mean at a geometric rate with geometric sample-size increase.
Rescaled errors converge in distribution to a normal distribution with covariance depending on problem parameters.
Polynomial sample-size increase yields polynomial decay of estimation errors and corresponding CLTs.
Abstract
In this paper, we study a stochastic strongly convex optimization problem and propose three classes of variable sample-size stochastic first-order methods including the standard stochastic gradient descent method, its accelerated variant, and the stochastic heavy ball method. In the iterates of each scheme, the unavailable exact gradients are approximated by averaging across an increasing batch size of sampled gradients. We prove that when the sample-size increases geometrically, the generated estimates converge in mean to the optimal solution at a geometric rate. Based on this result, we provide a unified framework to show that the rescaled estimation errors converge in distribution to a normal distribution, in which the covariance matrix depends on the Hessian matrix, covariance of the gradient noise, and the steplength. If the sample-size increases at a polynomial rate, we show that…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Sparse and Compressive Sensing Techniques · Statistical Methods and Inference
