Fetching the paper…
Reading the bibliography…
We consider the problem of selecting non-zero entries of a matrix $A$ in order to produce a sparse sketch of it, $B$, that minimizes $\|A-B\|_2$.
On the distribution of the roots of certain symmetric matrices
Eugene P. Wigner · 1958
Earlier work this paper cites.
The eigenvalues of random symmetric matrices
Z. Füredi and J. Komlós · 1981
Earlier work this paper cites.
On the spectrum of a random graph
F. Juhász · 1981
Earlier work this paper cites.
Fast computation of low rank matrix approximations
Dimitris Achlioptas and Frank McSherry · 2001
Earlier work this paper cites.
On the concentration of eigenvalues of random symmetric matrices
Noga Alon, Michael Krivelevich, and VanH. Vu · 2002
Earlier work this paper cites.
Strong converse for identification via quantum channels
Rudolf Ahlswede and Andreas Winter · 2002
Earlier work this paper cites.
Fast algorithms for approximate semidefinite programming using the multiplicative weights update method
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2005
Earlier work this paper cites.
A fast random sampling algorithm for sparsifying matrices
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2006
Earlier work this paper cites.
Fast monte carlo algorithms for matrices; approximating matrix multiplication
Petros Drineas, Ravi Kannan, and Michael W. Mahoney · 2006
Cited alongside, same era.
Fast computation of low-rank matrix approximations
Dimitris Achlioptas and Frank Mcsherry · 2007
Cited alongside, same era.
Hyperquick algorithm for discrete hypergeometric distribution
Aleš Berkopec · 2007
Cited alongside, same era.
Object retrieval with large vocabularies and fast spatial matching
J. Philbin, O. Chum, M. Isard, J. Sivic, and A. Zisserman · 2007
Cited alongside, same era.
Sampling from large matrices: An approach through geometric functional analysis
Mark Rudelson and Roman Vershynin · 2007
Cited alongside, same era.
Matrix sparsification via the khintchine inequality, 2009
NH Nguyen, Petros Drineas, and TD Tran · 2009
Later among the works it cites.
The power of convex relaxation: Near-optimal matrix completion
Emmanuel J Candès and Terence Tao · 2010
Later among the works it cites.
Tensor sparsification via a bound on the spectral norm of random tensors
Nam H Nguyen, Petros Drineas, and Trac D Tran · 2010
Later among the works it cites.
A note on element-wise matrix sparsification via a matrix-valued bernstein inequality
Petros Drineas and Anastasios Zouzias · 2011
Later among the works it cites.
A simpler approach to matrix completion
Benjamin Recht · 2011
Later among the works it cites.
The enronsent corpus
Will Styler · 2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Alexandre d’Aspremont · 2008
Cited alongside, same era.
Exact matrix completion via convex optimization
Emmanuel J Candès and Benjamin Recht · 2009
Cited alongside, same era.
Error bounds for random matrix approximation schemes
Alex Gittens and Joel A Tropp · 2009
Cited alongside, same era.
User-friendly tail bounds for sums of random matrices
Joel A. Tropp · 2012
Later among the works it cites.
User-friendly tail bounds for sums of random matrices
Joel A Tropp · 2012
Later among the works it cites.