Fetching the paper…
Reading the bibliography…
It is often desirable to reduce the dimensionality of a large dataset by projecting it onto a low-dimensional subspace.
Distribution function inequalities for martingales
Donald L Burkholder · 1973
Earlier work this paper cites.
Generalized inversion of modified matrices
Carl D. Meyer · 1973
Earlier work this paper cites.
Gaussian regression and optimal finite dimensional linear models
Huaiyu Zhu Santa, Huaiyu Zhu, Christopher K. I. Williams, Richard Rohwer, and Michal Morciniec · 1997
Earlier work this paper cites.
Using the Nyström method to speed up kernel machines
Christopher K. I. Williams and Matthias Seeger · 2001
Earlier work this paper cites.
Database-friendly random projections: Johnson-lindenstrauss with binary coins
Dimitris Achlioptas · 2003
Earlier work this paper cites.
Kernel independent component analysis
Francis R. Bach and Michael I. Jordan · 2003
Earlier work this paper cites.
Gaussian Processes for Machine Learning
C. E. Rasmussen and C. K. I. Williams · 2006
Earlier work this paper cites.
Improved approximation algorithms for large matrices via random projections
Tamas Sarlos · 2006
Earlier work this paper cites.
Deterministic equivalents for certain functionals of large random matrices
Walid Hachem, Philippe Loubaton, Jamal Najim, et al · 2007
Earlier work this paper cites.
An improved approximation algorithm for the column subset selection problem
Christos Boutsidis, Michael Mahoney, and Petros Drineas · 2008
Earlier work this paper cites.
Blendenpik: Supercharging lapack’s least-squares solver
Haim Avron, Petar Maymounkov, and Sivan Toledo · 2010
Earlier work this paper cites.
Spectral analysis of large dimensional random matrices
Zhidong Bai and Jack W Silverstein · 2010
Earlier work this paper cites.
Matrices: Theory and Applications
D. Serre · 2010
Earlier work this paper cites.
LIBSVM: A library for support vector machines
Chih-Chung Chang and Chih-Jen Lin · 2011
Earlier work this paper cites.
Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
Nathan Halko, Per-Gunnar Martinsson, and Joel A Tropp · 2011
Earlier work this paper cites.
Randomized algorithms for matrices and data
Michael W. Mahoney · 2011
Earlier work this paper cites.
Approximate computation and implicit regularization for very large-scale data analysis
M. W. Mahoney · 2012
Earlier work this paper cites.
Osnap: Faster numerical linear algebra algorithms via sparser subspace embeddings
Jelani Nelson and Huy L. Nguyên · 2013
Earlier work this paper cites.
Hanson-Wright inequality and sub-gaussian concentration
Mark Rudelson and Roman Vershynin · 2013
Earlier work this paper cites.
LSRN: A parallel iterative solver for strongly over- or under-determined systems
X. Meng, M. A. Saunders, and M. W. Mahoney · 2014
Earlier work this paper cites.
Sketching as a tool for numerical linear algebra
David P. Woodruff · 2014
Cited alongside, same era.
Fast randomized kernel ridge regression with statistical guarantees
Ahmed El Alaoui and Michael W. Mahoney · 2015
Cited alongside, same era.
Dimensionality reduction for k-means clustering and low rank approximation
Michael B. Cohen, Sam Elder, Cameron Musco, Christopher Musco, and Madalina Persu · 2015
Cited alongside, same era.
Randomized iterative methods for linear systems
Robert M. Gower and Peter Richtárik · 2015
Cited alongside, same era.
Optimal approximate matrix product in terms of stable rank
Michael B. Cohen, Jelani Nelson, and David P. Woodruff · 2016
Cited alongside, same era.
RandNLA: Randomized numerical linear algebra
Petros Drineas and Michael W. Mahoney · 2016
Cited alongside, same era.
Benign overfitting in linear regression
P. L. Bartlett, P. M. Long, G. Lugosi, and A. Tsigler · 2019
Later among the works it cites.
Rates of convergence for sparse variational Gaussian process regression
David Burt, Carl Edward Rasmussen, and Mark Van Der Wilk · 2019
Later among the works it cites.
Asymptotics for sketching in least squares regression
Edgar Dobriban and Sifan Liu · 2019
Later among the works it cites.
Distributed estimation of the inverse Hessian by determinantal averaging
Michał Dereziński and Michael W Mahoney · 2019
Later among the works it cites.
RSN: Randomized subspace Newton
Robert Gower, Dmitry Koralev, Felix Lieder, and Peter Richtarik · 2019
Later among the works it cites.
Surprises in high-dimensional ridgeless least squares interpolation
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Revisiting the Nyström method for improved large-scale machine learning
Alex Gittens and Michael W. Mahoney · 2016
Cited alongside, same era.
Iterative Hessian sketch: Fast and accurate solution approximation for constrained least-squares
Mert Pilanci and Martin J Wainwright · 2016
Cited alongside, same era.
Coordinate descent with arbitrary sampling II: Expected separable overapproximation
Zheng Qu and Peter Richtárik · 2016
Cited alongside, same era.
SDNA: Stochastic Dual Newton Ascent for Empirical Risk Minimization
Zheng Qu, Peter Richtárik, Martin Takác, and Olivier Fercoq · 2016
Cited alongside, same era.
A statistical perspective on randomized sketching for ordinary least-squares
G. Raskutti and M. W. Mahoney · 2016
Cited alongside, same era.
Low-rank approximation and regression in input sparsity time
Kenneth L. Clarkson and David P. Woodruff · 2017
Cited alongside, same era.
T. Hastie, A. Montanari, S. Rosset, and R. J. Tibshirani · 2019
Later among the works it cites.
Faster least squares optimization
Jonathan Lacotte and Mert Pilanci · 2019
Later among the works it cites.
High-dimensional optimization in adaptive random subspaces
Jonathan Lacotte, Mert Pilanci, and Marco Pavone · 2019
Later among the works it cites.
Sub-sampled Newton methods
Farbod Roosta-Khorasani and Michael W Mahoney · 2019
Later among the works it cites.
Debiasing distributed second order optimization with surrogate sketching and scaled regularization
Michał Dereziński, Burak Bartan, Mert Pilanci, and Michael W Mahoney · 2020
Closest in time.
Improved guarantees and a multiple-descent curve for Column Subset Selection and the Nyström method
Michał Dereziński, Rajiv Khanna, and Michael W Mahoney · 2020
Closest in time.
Precise expressions for random projections: Low-rank approximation and randomized newton
Michał Dereziński, Feynman Liang, Zhenyu Liao, and Michael W Mahoney · 2020
Closest in time.
Exact expressions for double descent and implicit regularization via surrogate random design
Michał Dereziński, Feynman Liang, and Michael W Mahoney · 2020
Closest in time.
Diversity sampling is an implicit regularization for kernel methods
Michaël Fanuel, Joachim Schreurs, and Johan AK Suykens · 2020
Closest in time.
Stochastic quasi-gradient methods: variance reduction via Jacobian sketching
Robert Gower, Peter Richtárik, and Francis Bach · 2020
Closest in time.
Convergence analysis of block coordinate algorithms with determinantal sampling
Mojmir Mutny, Michał Dereziński, and Andreas Krause · 2020
Closest in time.
How to reduce dimension with pca and random projections?
Fan Yang, Sifan Liu, Edgar Dobriban, and David P Woodruff · 2020
Closest in time.
Bounds on tail probabilities for quadratic forms in dependent sub-gaussian random variables
Krzysztof Zajkowski · 2020
Closest in time.
Determinantal point processes in randomized numerical linear algebra
Michał Dereziński and Michael W Mahoney · 2021
Closest in time.