Learning theory of randomized Kaczmarz algorithm

MaRDI QIDQ2788411zbMATH OpenFDO

Authors Junhong Lin, Ding-Xuan Zhou

Publication date 19 February 2016

Published in Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Full work available at URL http://jmlr.csail.mit.edu/papers/v16/lin15a.html

zbMATH Keywords

learning theoryalmost sure convergenceonline learningrelaxed randomized Kaczmarz algorithmspace of homogeneous linear functions

Mathematics Subject Classification ID

General nonlinear regression (62J02) Randomized algorithms (68W20) Iterative numerical methods for linear systems (65F10)

Recommendations

• Learning theory of randomized sparse Kaczmarz method
• Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces
• An Optimal Scheduled Learning Rate for a Randomized Kaczmarz Algorithm
• Almost sure convergence of the Kaczmarz algorithm with random measurements
• A randomized Kaczmarz algorithm with exponential convergence

Cited in

(28)

• Online pairwise learning algorithms with convex loss functions
• A new randomized Kaczmarz based kernel canonical correlation analysis algorithm with applications to information retrieval
• Learning theory of randomized sparse Kaczmarz method
• Analysis of singular value thresholding algorithm for matrix completion
• Convergence of online mirror descent
• Stochastic subspace correction in Hilbert space
• Analysis of Online Composite Mirror Descent Algorithm
• An algorithmic theory of learning: robust concepts and random projection
• Non-ergodic linear convergence property of the delayed gradient descent under the strongly convexity and the Polyak-Łojasiewicz condition
• Distributed learning with regularized least squares
• Kaczmarz algorithm with relaxation in Hilbert space
• Constrained ERM learning of canonical correlation analysis: a least squares perspective
• An algorithmic theory of learning: Robust concepts and random projection
• Distributed kernel-based gradient descent algorithms
• scientific article; zbMATH DE number 7306853 (Why is no real title available?)
• An Optimal Scheduled Learning Rate for a Randomized Kaczmarz Algorithm
• Linear discriminant analysis with the randomized Kaczmarz method
• Convergence of unregularized online learning algorithms
• The greedy randomized extended Kaczmarz algorithm for noisy linear systems
• Randomized Kaczmarz algorithm with averaging and block projection
• The Kaczmarz algorithm, row action methods, and statistical learning algorithms
• Kernel-algorithms in frame-approximations
• Randomized Kaczmarz with tail averaging
• Rademacher Chaos Complexities for Learning the Kernel Problem
• A Kaczmarz algorithm for sequences of projections, infinite products, and applications to frames in IFS \(L^2\) spaces
• The randomized circumcentered-reflection iteration method for solving consistent linear equations
• Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces
• Almost sure convergence of the Kaczmarz algorithm with random measurements

This page was built for publication: Learning theory of randomized Kaczmarz algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2788411)