Learning theory of randomized sparse Kaczmarz method
From MaRDI portal
Recommendations
- Learning theory of randomized Kaczmarz algorithm
- Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces
- Linear convergence of the randomized sparse Kaczmarz method
- Almost sure convergence of the Kaczmarz algorithm with random measurements
- Randomized sparse block Kaczmarz as randomized dual block-coordinate descent
Cites work
- A randomized Kaczmarz algorithm with exponential convergence
- A unified primal-dual algorithm framework based on Bregman iteration
- AIR tools -- a MATLAB package of algebraic iterative reconstruction methods
- Analysis and generalizations of the linearized Bregman method
- Analysis of Online Composite Mirror Descent Algorithm
- Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
- Bregman Monotone Optimization Algorithms
- Concentration estimates for learning with \(\ell ^{1}\)-regularizer and data dependent hypothesis spaces
- Consistency analysis of an empirical minimum error entropy algorithm
- Convergence of the linearized Bregman iteration for \(\ell _1\)-norm minimization
- Efficient online and batch learning using forward backward splitting
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 515978 (Why is no real title available?)
- scientific article; zbMATH DE number 1569102 (Why is no real title available?)
- Learning Theory
- Learning theory of randomized Kaczmarz algorithm
- Linearized Bregman iterations for compressed sensing
- On Projection Algorithms for Solving Convex Feasibility Problems
- Online Learning as Stochastic Approximation of Regularization Paths: Optimality and Almost-Sure Convergence
- ONLINE LEARNING WITH MARKOV SAMPLING
- Online Regularized Classification Algorithms
- Randomized extended Kaczmarz for solving least squares
- Regularization schemes for minimum error entropy principle
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- The linearized Bregman method via split feasibility problems: analysis and generalizations
- The Split Bregman Method for L1-Regularized Problems
- Thresholded spectral algorithms for sparse approximations
Cited in
(10)- Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces
- Analysis of singular value thresholding algorithm for matrix completion
- Learning theory of randomized Kaczmarz algorithm
- The Kaczmarz algorithm, row action methods, and statistical learning algorithms
- An Optimal Scheduled Learning Rate for a Randomized Kaczmarz Algorithm
- A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systems
- On convergence rates of Kaczmarz-type methods with different selection rules of working rows
- The sparse Kaczmarz method with surrogate hyperplane for the regularized basis pursuit problem
- The greedy randomized extended Kaczmarz algorithm for noisy linear systems
- The equivalence of the randomized extended Gauss-Seidel and randomized extended Kaczmarz methods
This page was built for publication: Learning theory of randomized sparse Kaczmarz method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4686926)
