Adaptive Accelerated (Extra-)Gradient Methods with Variance Reduction
Zijian Liu, Ta Duy Nguyen, Alina Ene, Huy L. Nguyen

TL;DR
This paper introduces two adaptive variance-reduced gradient methods for convex optimization that do not require prior knowledge of smoothness parameters, achieving optimal convergence rates and outperforming existing adaptive algorithms.
Contribution
The paper proposes novel adaptive VR algorithms, AdaVRAE and AdaVRAG, with improved convergence rates that do not depend on smoothness parameter tuning, matching best-known results.
Findings
Algorithms achieve optimal convergence rates for convex optimization.
Experimental results show superior performance over previous methods.
Methods do not require knowledge of the smoothness parameter.
Abstract
In this paper, we study the finite-sum convex optimization problem focusing on the general convex case. Recently, the study of variance reduced (VR) methods and their accelerated variants has made exciting progress. However, the step size used in the existing VR algorithms typically depends on the smoothness parameter, which is often unknown and requires tuning in practice. To address this problem, we propose two novel adaptive VR algorithms: Adaptive Variance Reduced Accelerated Extra-Gradient (AdaVRAE) and Adaptive Variance Reduced Accelerated Gradient (AdaVRAG). Our algorithms do not require knowledge of the smoothness parameter. AdaVRAE uses gradient evaluations and AdaVRAG uses gradient evaluations to attain an…
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
TopicsSparse and Compressive Sensing Techniques · Stochastic Gradient Optimization Techniques · Advanced Optimization Algorithms Research
