Paved with good intentions: analysis of a randomized block Kaczmarz method
From MaRDI portal
Abstract: The block Kaczmarz method is an iterative scheme for solving overdetermined least-squares problems. At each step, the algorithm projects the current iterate onto the solution space of a subset of the constraints. This paper describes a block Kaczmarz algorithm that uses a randomized control scheme to choose the subset at each step. This algorithm is the first block Kaczmarz method with an (expected) linear rate of convergence that can be expressed in terms of the geometric properties of the matrix and its submatrices. The analysis reveals that the algorithm is most effective when it is given a good row paving of the matrix, a partition of the rows into well-conditioned blocks. The operator theory literature provides detailed information about the existence and construction of good row pavings. Together, these results yield an efficient block Kaczmarz scheme that applies to many overdetermined least-squares problem.
Recommendations
Cites work
- A Bound on Tail Probabilities for Quadratic Forms in Independent Random Variables
- A fast Kaczmarz-Kovarik algorithm for consistent least-squares problems
- A fast randomized algorithm for the approximation of matrices
- A Kaczmarz-Kovarik algorithm for symmetric ill-conditioned matrices
- A mathematical introduction to compressive sensing
- A note on column subset selection
- A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin
- A randomized Kaczmarz algorithm with exponential convergence
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- An elementary proof of the restricted invertibility theorem
- Applied iterative methods.
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- Block-iterative methods for consistent and inconsistent linear equations
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Block-projections algorithms with blocks containing mutually orthogonal rows and columns
- Comments on the randomized Kaczmarz method
- Dual coordinate ascent methods for non-strictly convex minimization
- Extensions of block-projections methods with relaxation parameters to inconsistent and rank-deficient least-squares problems
- Extensions of Pure States
- Extensions, Restrictions, and Representations of States on C ∗ - Algebras
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- scientific article; zbMATH DE number 4205183 (Why is no real title available?)
- scientific article; zbMATH DE number 4001918 (Why is no real title available?)
- scientific article; zbMATH DE number 4056349 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 3027894 (Why is no real title available?)
- Improved analysis of the subsampled randomized Hadamard transform
- Improved matrix algorithms via the subsampled randomized Hadamard transform
- Incorporation of a priori moment information into signal recovery and synthesis problems
- Invertibility of ``large submatrices with applications to the geometry of Banach spaces and harmonic analysis
- Invertibility of random submatrices via tail-decoupling and a matrix Chernoff inequality
- Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
- John's decompositions: Selecting a large part
- Limit of the smallest eigenvalue of a large dimensional sample covariance matrix
- Norms of random submatrices and sparse approximation
- Random sets of isomorphism of linear operators on Hilbert space
- Randomized extended Kaczmarz for solving least squares
- Randomized Kaczmarz solver for noisy linear systems
- Randomized methods for linear constraints: convergence rates and conditioning
- RESTRICTED INVERTIBILITY AND THE BANACH–MAZUR DISTANCE TO THE CUBE
- The angles between the null spaces of X rays
- The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
- The method of alternating projections and the method of subspace corrections in Hilbert space
- The random paving property for uniformly bounded matrices
- Two-subspace projection method for coherent overdetermined systems
- Uncertainty principles and ideal atomic decomposition
- User-friendly tail bounds for sums of random matrices
Cited in
(only showing first 100 items - show all)- Linear convergence of the randomized sparse Kaczmarz method
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods
- Convergence rates of the Kaczmarz-Tanabe method for linear systems
- On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems
- On the regularization effect of stochastic gradient descent applied to least-squares
- On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems
- Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems
- Developing Kaczmarz method for solving Sylvester matrix equations
- Randomized Kaczmarz for tensor linear systems
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems
- Greedy randomized and maximal weighted residual Kaczmarz methods with oblique projection
- On greedy randomized average block Kaczmarz method for solving large linear systems
- Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration
- On the relaxed greedy deterministic row and column iterative methods
- Randomized approximate class-specific kernel spectral regression analysis for large-scale face verification
- On randomized partial block Kaczmarz method for solving huge linear algebraic systems
- Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems
- A greedy block Kaczmarz algorithm for solving large-scale linear systems
- Randomness and permutations in coordinate descent methods
- The extensions of convergence rates of Kaczmarz-type methods
- On block Gaussian sketching for the Kaczmarz method
- Accelerating the distributed Kaczmarz algorithm by strong over-relaxation
- Block sampling Kaczmarz-Motzkin methods for consistent linear systems
- A doubly stochastic block Gauss-Seidel algorithm for solving linear equations
- A refinement of an iterative orthogonal projection method
- On the error estimate of the randomized double block Kaczmarz method
- On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
- Convergence analysis for Kaczmarz-type methods in a Hilbert space framework
- Convergence rates for Kaczmarz-type algorithms
- A linearly convergent doubly stochastic Gauss-Seidel algorithm for solving linear equations and a certain class of over-parameterized optimization problems
- On greedy randomized block Kaczmarz method for consistent linear systems
- Randomized Kaczmarz with averaging
- Randomized block Kaczmarz methods with k-means clustering for solving large linear systems
- On fast greedy block Kaczmarz methods for solving large consistent linear systems
- Splitting-based randomized iterative methods for solving indefinite least squares problem
- Randomized block subsampling Kaczmarz-Motzkin method
- Inexact coordinate descent: complexity and preconditioning
- Single projection Kaczmarz extended algorithms
- Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
- Randomized iterative methods for linear systems
- Solving systems of phaseless equations via Kaczmarz methods: a proof of concept study
- The Kaczmarz algorithm, row action methods, and statistical learning algorithms
- Two-subspace projection method for coherent overdetermined systems
- Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes
- Randomized block Kaczmarz method with projection for solving least squares
- A weighted randomized Kaczmarz method for solving linear systems
- Convergence analyses based on frequency decomposition for the randomized row iterative method
- The row-oriented form of the regularized Kaczmarz's method
- Sampled Tikhonov regularization for large linear inverse problems
- Randomized Kaczmarz Converges Along Small Singular Vectors
- Surrounding the solution of a linear system of equations from all sides
- On Adaptive Sketch-and-Project for Solving Linear Systems
- Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
- Sampled limited memory methods for massive linear inverse problems
- On greedy randomized augmented Kaczmarz method for solving large sparse inconsistent linear systems
- A Kaczmarz Algorithm for Solving Tree Based Distributed Systems of Equations
- Stochastic block projection algorithms with extrapolation for convex feasibility problems
- On block accelerations of quantile randomized Kaczmarz for corrupted systems of linear equations
- On relaxed greedy randomized augmented Kaczmarz methods for solving large sparse inconsistent linear systems
- On convergence of the partially randomized extended Kaczmarz method
- Quantile-based iterative methods for corrupted systems of linear equations
- Adaptively sketched Bregman projection methods for linear systems
- Stochastic reformulations of linear systems: algorithms and convergence theory
- Convergence analysis for column-action methods in image reconstruction
- Accelerating Sparse Recovery by Reducing Chatter
- Randomized extended average block Kaczmarz for solving least squares
- Faster randomized block Kaczmarz algorithms
- Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity
- Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions
- A sampling Kaczmarz-Motzkin algorithm for linear feasibility
- Rows versus Columns: Randomized Kaczmarz or Gauss--Seidel for Ridge Regression
- The block Kaczmarz algorithm based on solving linear systems with arrowhead matrices
- Convergence analysis of inexact randomized iterative methods
- Regularized Kaczmarz Algorithms for Tensor Recovery
- Convergence and semi-convergence of a class of constrained block iterative methods
- Greedy Kaczmarz algorithm using optimal intermediate projection technique for coherent linear systems
- Generalized Gearhart-Koshy acceleration for the Kaczmarz method
- A Deterministic Kaczmarz Algorithm for Solving Linear Systems
- An Optimal Scheduled Learning Rate for a Randomized Kaczmarz Algorithm
- Randomized numerical linear algebra: Foundations and algorithms
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- Randomized subspace actions and fusion frames
- A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systems
- An almost-maximal residual tensor block Kaczmarz method for large tensor linear systems
- Approximate Solutions of Linear Systems at a Universal Rate
- On adaptive block coordinate descent methods for ridge regression
- Convergence of the multiplicative algebraic reconstruction technique for the inconsistent system of equations
- Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems
- On multi-step randomized extended Kaczmarz method for solving large sparse inconsistent linear systems
- Randomized Block Adaptive Linear System Solvers
- On maximum residual nonlinear Kaczmarz-type algorithms for large nonlinear systems of equations
- On convergence rates of Kaczmarz-type methods with different selection rules of working rows
- Faster randomized block sparse Kaczmarz by averaging
- A surrogate hyperplane Kaczmarz method for solving consistent linear equations
- The standard forms and convergence theory of the Kaczmarz-Tanabe type methods for solving linear systems
- Faster Deterministic Pseudoinverse-Free Block Extension of Motzkin Method for Large Consistent Linear Systems
- Sparse sampling Kaczmarz–Motzkin method with linear convergence
- On greedy randomized block Gauss-Seidel method with averaging for sparse linear least-squares problems
- On pseudoinverse-free block maximum residual nonlinear Kaczmarz method for solving large-scale nonlinear system of equations
- Randomized Kaczmarz algorithm with averaging and block projection
This page was built for publication: Paved with good intentions: analysis of a randomized block Kaczmarz method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437339)
