Fetching the paper…
Reading the bibliography…
We propose new variants of the sketch-and-project method for solving large scale ridge regression problems.
“Angenäherte Auflösung von Systemen linearer Gleichungen”
M Kaczmarz · 1937
Earlier work this paper cites.
“Methods of Conjugate Gradients for Solving Linear Systems”
M.. Hestenes and E. Stiefel · 1952
Earlier work this paper cites.
“Some Methods of Speeding up the Convergence of Iteration Methods”
B.. Polyak · 1964
Earlier work this paper cites.
“Unified matrix treatment of the fast Walsh-Hadamard transform”
Bernard. Fino and V. Algazi · 1976
Earlier work this paper cites.
“Extensions of Lipschitz mappings into a Hilbert space”
William Johnson and Joram Lindenstrauss · 1984
Earlier work this paper cites.
“Numerical weather prediction”
T.. Krishnamurti · 1995
Earlier work this paper cites.
“Ridge regression learning algorithm in dual variables”
G. Saunders, A. Gammerman and V. Vovk · 1998
Earlier work this paper cites.
“LAPACK Users’ Guide”
E. Anderson et al · 1999
Earlier work this paper cites.
“Tikhonov Regularization and Total Least Squares”
Gene. Golub, Per Hansen and Dianne. O’Leary · 1999
Earlier work this paper cites.
“Finding frequent items in data streams”
Moses Charikar, Kevin Chen and Martin Farach-Colton · 2002
Earlier work this paper cites.
“Count-Min Sketch”
Graham Cormode · 2003
Earlier work this paper cites.
“An improved data stream summary: the count-min sketch and its applications”
Graham Cormode and S. Muthukrishnan · 2005
Earlier work this paper cites.
“A fast randomized algorithm for the approximation of matrices”
Franco Woolfe, Edo Liberty, Vladimir Rokhlin and Mark Tygert · 2008
Earlier work this paper cites.
“The Fast Johnson-Lindenstrauss Transform and Approximate Nearest Neighbors”
Nir Ailon and Bernard Chazelle · 2009
Earlier work this paper cites.
“Fast dimension reduction using Rademacher series on dual BCH codes”
Nir Ailon and Edo Liberty · 2009
Earlier work this paper cites.
“A Randomized Kaczmarz Algorithm with Exponential Convergence”
Thomas Strohmer and Roman Vershynin · 2009
Earlier work this paper cites.
“Randomized Methods for Linear Constraints: Convergence Rates and Conditioning”
D. Leventhal and A.. Lewis · 2010
Earlier work this paper cites.
“Randomized Algorithms for Matrices and Data”
Michael. Mahoney · 2011
Earlier work this paper cites.
“Scikit-learn: Machine Learning in Python”
F. Pedregosa et al · 2011
Cited alongside, same era.
“Improved analysis of the subsampled randomized Hadamard transform”
Joel Tropp · 2011
Cited alongside, same era.
“The NumPy array: a structure for efficient numerical computation”
Stefan Van Der, S Colbert and Gael Varoquaux · 2011
Cited alongside, same era.
“Improved matrix algorithms via the subsampled randomized Hadamard transform”
Christos Boutsidis and Alex Gittens · 2013
Cited alongside, same era.
“Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error”
T.. Jayram and David. Woodruff · 2013
Cited alongside, same era.
“Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for Solving Linear Systems”
Yin Lee and Aaron Sidford · 2013
“Low-rank approximation and regression in input sparsity time”
Kenneth Clarkson and David Woodruff · 2017
Later among the works it cites.
“A sampling Kaczmarz–Motzkin algorithm for linear feasibility”
Jesus De, Jamie Haddock and Deanna Needell · 2017
Later among the works it cites.
“Breaking Locality Accelerates Block Gauss-Seidel”
Stephen Tu et al · 2017
Later among the works it cites.
“Sketched Ridge Regression: Optimization Perspective, Statistical Perspective, and Model Averaging.”
Shusen Wang, Alex Gittens and Michael. Mahoney · 2017
Later among the works it cites.
“On greedy randomized Kaczmarz method for solving large sparse linear systems”
Zhong-Zhi Bai and Wen-Ting Wu · 2018
Later among the works it cites.
“Accelerated Stochastic Matrix Inversion: General Theory and Speeding up BFGS Rules for Faster Second-Order Optimization”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
“Blendenpik : Supercharging LAPACK’s Least-Squares Solver”, 2013
Petar Maymounkov and Sivan Toledo · 2013
Cited alongside, same era.
“Kernel ridge regression”
Vladimir Vovk · 2013
Cited alongside, same era.
“Understanding Machine Learning: From Theory to Algorithms”
Shai Shalev-Shwartz and Shai Ben-David · 2014
Cited alongside, same era.
“Stochastic Dual Ascent for Solving Linear Systems”
Robert. Gower and Peter Richt“’arik · 2015
Cited alongside, same era.
“Randomized Iterative Methods for Linear Systems”
Robert Gower and Peter Richt“’arik · 2015
Cited alongside, same era.
“Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods”
Anna Ma, Deanna Needell and Aaditya Ramdas · 2015
Cited alongside, same era.
Robert Gower, Filip Hanzely, Peter Richtarik and Sebastian Stich · 2018
Later among the works it cites.
“A new theoretical estimate for the convergence rate of the maximal weighted residual Kaczmarz algorithm”
Kui Du and Han Gao · 2019
Later among the works it cites.
“Faster randomized block Kaczmarz algorithms”
Ion Necoara · 2019
Later among the works it cites.
“Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods”
Nicolas Loizou and Peter Richtarik · 2020
Later among the works it cites.
“Stochastic Steepest Descent Methods for Linear Systems: Greedy Sampling & Momentum”
Md Morshed, Sabbir Ahmad and Md. Noor-E-Alam · 2020
Later among the works it cites.
“Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem”
Md Morshed, Md. Islam and Muhammad Noor-E-Alam · 2020
Later among the works it cites.
“Sketch & Project Methods for Linear Feasibility Problems: Greedy Sampling & Momentum”
Md Morshed and Md. Noor-E-Alam · 2020
Later among the works it cites.
“Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory”
Peter Richt“’arik and Martin Tak“’ac · 2020
Later among the works it cites.
“On the convergence of the Stochastic Heavy Ball Method”
Othmane Sebbouh, Robert. Gower and Aaron Defazio · 2020
Later among the works it cites.
“SciPy 1.0: fundamental algorithms for scientific computing in Python”
Pauli Virtanen et al · 2020
Later among the works it cites.
Rui Yuan, Alessandro Lazaric and Robert Gower · 2020
Later among the works it cites.
“Greed Works: An Improved Analysis of Sampling Kaczmarz–Motzkin”
Jamie Haddock and Anna Ma · 2021
Closest in time.