Stochastic Variance-Reduced Newton: Accelerating Finite-Sum Minimization with Large Batches
Micha{\l} Derezi\'nski

TL;DR
This paper introduces SVRN, a stochastic variance-reduced Newton method that significantly accelerates finite-sum minimization, especially for large datasets, by reducing the number of data passes needed compared to existing methods.
Contribution
The paper proposes SVRN, a novel stochastic variance-reduced Newton algorithm that accelerates second-order methods for convex finite-sum problems, with improved complexity bounds and scalability.
Findings
SVRN reduces data passes from O(α log(1/ε)) to O(log(1/ε)/log(n))
Acceleration effect increases with larger data size n
SVRN compares favorably to first-order variance-reduction methods
Abstract
Stochastic variance reduction has proven effective at accelerating first-order algorithms for solving convex finite-sum optimization tasks such as empirical risk minimization. Incorporating second-order information has proven helpful in further improving the performance of these first-order methods. Yet, comparatively little is known about the benefits of using variance reduction to accelerate popular stochastic second-order methods such as Subsampled Newton. To address this, we propose Stochastic Variance-Reduced Newton (SVRN), a finite-sum minimization algorithm that provably accelerates existing stochastic Newton methods from to passes over the data, i.e., by a factor of , where is the number of sum components and is the approximation factor in the Hessian estimate. Surprisingly,…
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 · Sparse and Compressive Sensing Techniques · Advanced Bandit Algorithms Research
