Randomized Kaczmarz Converges Along Small Singular Vectors
From MaRDI portal
Publication:4986830
DOI10.1137/20M1350947MaRDI QIDQ4986830FDOQ4986830
Authors: Stefan Steinerberger 
Publication date: 28 April 2021
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.16978
Kaczmarz methodARTsingular vectorprojection onto convex setsrandomized Kaczmarz methodalgebraic reconstruction techniquePOCS
Cites Work
- A randomized Kaczmarz algorithm with exponential convergence
- Title not available (Why is that?)
- Randomized methods for linear constraints: convergence rates and conditioning
- Title not available (Why is that?)
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- Title not available (Why is that?)
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Randomized Iterative Methods for Linear Systems
- Randomized extended Kaczmarz for solving least squares
- Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- Randomized Kaczmarz solver for noisy linear systems
- Randomized block Kaczmarz method with projection for solving least squares
- The conjugate gradient regularization method in computed tomography problems
- On convergence rate of the randomized Kaczmarz method
- An accelerated randomized Kaczmarz algorithm
- Preasymptotic convergence of randomized Kaczmarz method
- Phase retrieval via randomized Kaczmarz: theoretical guarantees
- On the regularizing property of stochastic gradient descent
Cited In (18)
- Alternating projection method for intersection of convex sets, multi-agent consensus algorithms, and averaging inequalities
- The method of randomized Bregman projections for stochastic feasibility problems
- Surrounding the solution of a linear system of equations from all sides
- Linearly convergent adjoint free solution of least squares problems by random descent
- A weighted randomized Kaczmarz method for solving linear systems
- A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation
- An Optimal Scheduled Learning Rate for a Randomized Kaczmarz Algorithm
- A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systems
- Randomized Kaczmarz algorithm with averaging and block projection
- On the convergence of randomized and greedy relaxation schemes for solving nonsingular linear systems of equations
- Approximate Solutions of Linear Systems at a Universal Rate
- Eigenvector phase retrieval: recovering eigenvectors from the absolute value of their entries
- Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition
- On the regularization effect of stochastic gradient descent applied to least-squares
- Randomized Kaczmarz with geometrically smoothed momentum
- Side effects of learning from low-dimensional data embedded in a Euclidean space
- Developing Kaczmarz method for solving Sylvester matrix equations
- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
This page was built for publication: Randomized Kaczmarz Converges Along Small Singular Vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4986830)
