Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
DOI10.1007/s10107-015-0864-7zbMath1333.65070arXiv1310.5715OpenAlexW2162287622WikidataQ29027877 ScholiaQ29027877MaRDI QIDQ5962728
Deanna Needell, Nathan Srebro, Rachel Ward
Publication date: 23 February 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.5715
importance samplingnumerical exampleslinear convergenceexponential convergencedistribution reweightingKaczmarz methodstochastic gradient descentweighted least squares problem
Numerical optimization and variational techniques (65K10) Random operators and equations (aspects of stochastic analysis) (60H25) Existence theories for optimal control problems involving partial differential equations (49J20) Existence of optimal solutions to problems involving randomness (49J55)
Related Items
Cites Work
- Sparse Legendre expansions via \(\ell_1\)-minimization
- Two-subspace projection method for coherent overdetermined systems
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- On Kaczmarz's projection iteration as a direct solver for linear least squares problems
- Block-iterative methods for consistent and inconsistent linear equations
- On the acceleration of Kaczmarz's method for inconsistent linear systems
- Randomized Kaczmarz solver for noisy linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
- Strong underrelaxation in Kaczmarz's method for inconsistent systems
- Block-projections algorithms with blocks containing mutually orthogonal rows and columns
- Extensions of block-projections methods with relaxation parameters to inconsistent and rank-deficient least-squares problems
- Introductory lectures on convex optimization. A basic course.
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Projection method for solving a singular system of linear equations and its applications
- Fundamentals of Computerized Tomography
- Randomized Extended Kaczmarz for Solving Least Squares
- Augmented $\ell_1$ and Nuclear-Norm Models with a Globally Linearly Convergent Algorithm
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Randomized Algorithms for Matrices and Data
- Large-Scale Machine Learning with Stochastic Gradient Descent
- Robust Stochastic Approximation Approach to Stochastic Programming
- Stable and Robust Sampling Strategies for Compressive Imaging
- Two Algorithms Related to the Method of Steepest Descent
- A Stochastic Approximation Method
- Graph Sparsification by Effective Resistances
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item