Fetching the paper…
Reading the bibliography…
Given an order-$d$ tensor $\tensor A \in \R^{n \times n \times...\times n}$, we present a simple, element-wise sparsification algorithm that zeroes out all sufficiently small elements of $\tensor A$, keeps all sufficiently large elements of $\tensor A$, and retains some of the remaining elements with probabilities proportional to the square of their magnitudes.
The eigenvalues of random symmetric matrices
Z. Füredi and J. Komlós · 1981
Earlier work this paper cites.
Probability in Banach Space: Isoperimetry and Processes
M. Ledoux and M. Talagrand · 1991
Earlier work this paper cites.
Fast Monte-Carlo algorithms for finding low-rank approximations
A. Frieze, R. Kannan, and S. Vempala · 1998
Earlier work this paper cites.
An introduction to independent component analysis
L. De Lathauwer, B. De Moor, and J. Vandewalle · 2000
Earlier work this paper cites.
A multilinear singular value decomposition
L. De Lathauwer, B. De Moor, and J. Vandewalle · 2000
Earlier work this paper cites.
Fast computation of low rank matrix approximations
D. Achlioptas and F. McSherry · 2001
Earlier work this paper cites.
Spectral analysis of data
Y. Azar, A. Fiat, A.R. Karlin, F. McSherry, and J. Saia · 2001
Earlier work this paper cites.
Orthogonal tensor decompositions
T. G. Kolda · 2001
Earlier work this paper cites.
The Concentration of Measure Phenomenon
M. Ledoux · 2001
Earlier work this paper cites.
Strong converse for identification via quantum channels
R. Ahlswede and A. Winter · 2002
Earlier work this paper cites.
Sums of random hermitian matrices and an inequality by rudelson
R. I. Oliveira · 2002
Earlier work this paper cites.
Random sampling and approximation of MAX-CSPs
N. Alon, W.F. de la Vega, R. Kannan, and M. Karpinski · 2003
Earlier work this paper cites.
Somes estimates of norms of random matrices
R. Latala · 2004
Earlier work this paper cites.
Fast algorithms for approximate semidefinite programming using the multiplicative weights update method
S. Arora, E. Hazan, and S. Kale · 2005
Earlier work this paper cites.
Tensor decomposition and approximation schemes for constraint satisfaction problems
W.F. de la Vega, R. Kannan, M. Karpinski, and S. Vempala · 2005
Cited alongside, same era.
A Fast Random Sampling Algorithm for Sparsifying Matrices
S. Arora, E. Hazan, and S. Kale · 2006
Cited alongside, same era.
Tensor-CUR decompositions for tensor-based data
M. W. Mahoney, M. Maggioni, and P. Drineas · 2006
Cited alongside, same era.
Improved approximation algorithms for large matrices via random projections
T. Sarlos · 2006
Cited alongside, same era.
Fast computation of low rank matrix approximations
D. Achlioptas and F. McSherry · 2007
Cited alongside, same era.
A randomized algorithm for a tensor-based generalization of the Singular Value Decomposition
P. Drineas and M.W. Mahoney · 2007
Cited alongside, same era.
Error bounds for random matrix approximation schemes
A. Gittens and J. Tropp · 2009
Later among the works it cites.
Tensor Decompositions and Applications
T. G. Kolda and B. W. Bader · 2009
Later among the works it cites.
CUR matrix decompositions for improved data analysis
M. W. Mahoney and P. Drineas · 2009
Later among the works it cites.
A fast and efficient algorithm for low-rank approximation of a matrix
N.H. Nguyen, T.T. Do, and T.D. Tran · 2009
Later among the works it cites.
The smallest singular value of a random rectangular matrix
M. Rudelson and R. Vershynin · 2009
Later among the works it cites.
The power of convex relaxation: Near-optimal matrix completion
E. J. Candès and T. Tao · 2010
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Tutorial: Mining Large Time-evolving Data Using Matrix and Tensor Tools
C. Faloutsos, T. G. Kolda, and J. Sun · 2007
Cited alongside, same era.
Sampling subproblems of heterogeneous max-cut problems and approximation algorithms
P. Drineas, R. Kannan, and M. W. Mahoney · 2008
Cited alongside, same era.
Relative-error CUR matrix decompositions
P. Drineas, M. W. Mahoney, and S. Muthukrishnan · 2008
Cited alongside, same era.
Tensor-CUR decompositions and data applications
M. W. Mahoney, M. Maggioni, and P. Drineas · 2008
Cited alongside, same era.
Graph sparsification by effective resistances
D. A. Spielman and N. Srivastava · 2008
Cited alongside, same era.
Twice-ramanujan sparsifiers
J. Batson, D. A. Spielman, and N. Srivastava · 2009
Cited alongside, same era.
Mach: Fast randomized tensor decompositions
C. E. Tsourakakis · 2010
Closest in time.
A note on element-wise matrix sparsification via matrix-valued chernoff bounds
P. Drineas and A. Zouzias · 2011
Closest in time.
Spectral norm of products of random and deterministic matrices
R. Vershynin · 2011
Closest in time.
User-friendly tail bounds for sums of random matrices
J. A. Tropp · 2012
Closest in time.
Introduction to the non-asymptotic analysis of random matrices
R. Vershynin · 2012
Closest in time.
Near-optimal entrywise sampling for data matrices
Dimitris Achlioptas, Zohar Shay Karnin, and Edo Liberty · 2013
Closest in time.
An introduction to matrix concentration inequalities
J. A. Tropp · 2015
Closest in time.