Fetching the paper…
Reading the bibliography…
Leverage score sampling is a powerful technique that originates from theoretical computer science, which can be used to speed up a large number of fundamental questions, e.g.
On a modification of chebyshev’s inequality and of the error formula of laplace
Sergei Bernstein · 1924
Earlier work this paper cites.
A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
Herman Chernoff · 1952
Earlier work this paper cites.
Probability inequalities for sums of bounded random variables
Wassily Hoeffding · 1963
Earlier work this paper cites.
Finite dimensional subspaces of L p {L}_{p}
D. Lewis · 1978
Earlier work this paper cites.
Approximation of zonoids by zonotopes
Jean Bourgain, Joram Lindenstrauss, and V Milman · 1989
Earlier work this paper cites.
A new algorithm for minimizing convex functions over convex sets
Pravin M Vaidya · 1989
Earlier work this paper cites.
Adaptive estimation of a quadratic functional by model selection
Beatrice Laurent and Pascal Massart · 2000
Earlier work this paper cites.
Faster approximate lossy generalized flow via interior point algorithms
Samuel I Daitch and Daniel A Spielman · 2008
Earlier work this paper cites.
Random features for large-scale kernel machines
Ali Rahimi and Benjamin Recht · 2008
Earlier work this paper cites.
Graph sparsification by effective resistances
Daniel A Spielman and Nikhil Srivastava · 2011
Earlier work this paper cites.
Fast approximation of matrix coherence and statistical leverage
Petros Drineas, Malik Magdon-Ismail, Michael W Mahoney, and David P Woodruff · 2012
Earlier work this paper cites.
Sharp analysis of low-rank kernel matrix approximations
Francis Bach · 2013
Earlier work this paper cites.
Low rank approximation and regression in input sparsity time
Kenneth L. Clarkson and David P. Woodruff · 2013
Earlier work this paper cites.
Navigating central path with electrical flows: From flows to matchings, and back
Aleksander Madry · 2013
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.
Optimal cur matrix decompositions
Christos Boutsidis and David P Woodruff · 2014
Earlier work this paper cites.
Path finding methods for linear programming: Solving linear programs in O ( r a n k ) {O}(\sqrt{rank}) iterations and faster algorithms for maximum flow
Yin Tat Lee and Aaron Sidford · 2014
Earlier work this paper cites.
Fast randomized kernel ridge regression with statistical guarantees
Ahmed Alaoui and Michael W Mahoney · 2015
Earlier work this paper cites.
ℓ p \ell_{p} row sampling by lewis weights
Michael B. Cohen and Richard Peng · 2015
Earlier work this paper cites.
A faster cutting plane method and its implications for combinatorial and convex optimization
Yin Tat Lee, Aaron Sidford, and Sam Chiu-wai Wong · 2015
Earlier work this paper cites.
The threshold for super-resolution via extremal functions
Ankur Moitra · 2015
Earlier work this paper cites.
A robust sparse Fourier transform in the continuous setting
Eric Price and Zhao Song · 2015
Earlier work this paper cites.
An introduction to matrix concentration inequalities
Joel A Tropp · 2015
Earlier work this paper cites.
Divide and conquer kernel ridge regression: A distributed algorithm with minimax optimal rates
Yuchen Zhang, John Duchi, and Martin Wainwright · 2015
Earlier work this paper cites.
Fourier-sparse interpolation without a frequency gap
Xue Chen, Daniel M Kane, Eric Price, and Zhao Song · 2016
Earlier work this paper cites.
Toward deeper understanding of neural networks: The power of initialization and a dual view on expressivity
Amit Daniely, Roy Frostig, and Yoram Singer · 2016
Cited alongside, same era.
Computing maximum flow with augmenting electrical flows
Aleksander Madry · 2016
Cited alongside, same era.
Faster kernel ridge regression using sketching and preconditioning
Haim Avron, Kenneth L Clarkson, and David P Woodruff · 2017
Cited alongside, same era.
Random fourier features for kernel ridge regression: Approximation bounds and statistical guarantees
Haim Avron, Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker, and Amir Zandieh · 2017
Cited alongside, same era.
Globally optimal gradient descent for a convnet with gaussian inputs
Alon Brutzkus and Amir Globerson · 2017
Cited alongside, same era.
Input sparsity time low-rank approximation via ridge leverage score sampling
On exact computation with an infinitely wide neural net
Sanjeev Arora, Simon S Du, Wei Hu, Zhiyuan Li, Ruslan Salakhutdinov, and Ruosong Wang · 2019
Later among the works it cites.
Sanjeev Arora, Simon S Du, Wei Hu, Zhiyuan Li, and Ruosong Wang · 2019
Later among the works it cites.
A universal sampling method for reconstructing signals with simple fourier transforms
Haim Avron, Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker, and Amir Zandieh · 2019
Later among the works it cites.
A convergence theory for deep learning via over-parameterization
Zeyuan Allen-Zhu, Yuanzhi Li, and Zhao Song · 2019
Later among the works it cites.
On the convergence rate of training recurrent neural networks
Zeyuan Allen-Zhu, Yuanzhi Li, and Zhao Song · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Michael B Cohen, Cameron Musco, and Christopher Musco · 2017
Cited alongside, same era.
Low-rank psd approximation in input-sparsity time
Kenneth L Clarkson and David P Woodruff · 2017
Cited alongside, same era.
Sgd learns the conjugate kernel class of the network
Amit Daniely · 2017
Cited alongside, same era.
Convergence analysis of two-layer neural networks with ReLU activation
Yuanzhi Li and Yang Yuan · 2017
Cited alongside, same era.
Recursive sampling for the nystrom method
Cameron Musco and Christopher Musco · 2017
Cited alongside, same era.
Is input sparsity time possible for kernel low-rank approximation?
Cameron Musco and David Woodruff · 2017
Cited alongside, same era.
Sublinear time low-rank approximation of positive semidefinite matrices
Cameron Musco and David P Woodruff · 2017
Cited alongside, same era.
Later among the works it cites.
Learning two layer rectified neural networks in polynomial time
Ainesh Bakshi, Rajesh Jayaram, and David P Woodruff · 2019
Later among the works it cites.
A near-optimal algorithm for approximating the john ellipsoid
Michael B Cohen, Ben Cousins, Yin Tat Lee, and Xin Yang · 2019
Later among the works it cites.
Gradient descent finds global minima of deep neural networks
Simon S Du, Jason D Lee, Haochuan Li, Liwei Wang, and Xiyu Zhai · 2019
Later among the works it cites.
Gradient descent provably optimizes over-parameterized neural networks
Simon S Du, Xiyu Zhai, Barnabas Poczos, and Aarti Singh · 2019
Later among the works it cites.
Relative error tensor low rank approximation
Zhao Song, David P Woodruff, and Peilin Zhong · 2019
Later among the works it cites.
Quadratic suffices for over-parametrization via matrix chernoff bound
Zhao Song and Xin Yang · 2019
Later among the works it cites.
Algorithms and hardness for linear algebra on geometric graphs
Josh Alman, Timothy Chu, Aaron Schild, and Zhao Song · 2020
Closest in time.
Bipartite matching in nearly-linear time on moderately dense graphs
Jan van den Brand, Yin-Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, and Di Wang · 2020
Closest in time.
Solving tall dense linear programs in nearly linear time
Jan van den Brand, Yin Tat Lee, Aaron Sidford, and Zhao Song · 2020
Closest in time.
Training (overparametrized) neural networks in near-linear time
Jan van den Brand, Binghui Peng, Zhao Song, and Omri Weinstein · 2020
Closest in time.
Algorithmic foundations for the diffraction limit
Sitan Chen and Ankur Moitra · 2020
Closest in time.
A faster interior point method for semidefinite programming
Haotian Jiang, Tarun Kathuria, Yin Tat Lee, Swati Padmanabhan, and Zhao Song · 2020
Closest in time.
A robust multi-dimensional sparse fourier transform in the continuous setting
Yaonan Jin, Daogao Liu, and Zhao Song · 2020
Closest in time.
An improved cutting plane method for convex optimization, convex-concave games and its applications
Haotian Jiang, Yin Tat Lee, Zhao Song, and Sam Chiu-wai Wong · 2020
Closest in time.
Faster dynamic matrix inverse for faster lps
Shunhua Jiang, Zhao Song, Omri Weinstein, and Hengjie Zhang · 2020
Closest in time.
Faster divergence maximization for faster maximum flow
Yang P Liu and Aaron Sidford · 2020
Closest in time.
Faster energy maximization for faster maximum flow
Yang P Liu and Aaron Sidford · 2020
Closest in time.
Breaking the n n -pass barrier: A streaming algorithm for maximum weight bipartite matching
S. Cliff Liu, Zhao Song, and Hengjie Zhang · 2020
Closest in time.
Scaling up kernel ridge regression via locality sensitive hashing
Amir Zandieh, Navid Nouri, Ameya Velingker, Michael Kapralov, and Ilya Razenshteyn · 2020
Closest in time.