Fetching the paper…
Reading the bibliography…
In this paper new general modewise Johnson-Lindenstrauss (JL) subspace embeddings are proposed that are both considerably faster to generate and easier to store than traditional JL embeddings when working with extremely large vectors and/or tensors.
Some mathematical notes on three-mode factor analysis
L. R. Tucker · 1966
Earlier work this paper cites.
Analysis of individual differences in multidimensional scaling via an N-way generalization of “Eckart-Young” decomposition
J. D. Carroll and J.-J. Chang · 1970
Earlier work this paper cites.
Foundations of the PARAFAC procedure: Models and conditions for an “explanatory” multimodal factor analysis
R. A. Harshman et al · 1970
Earlier work this paper cites.
Extensions of Lipschitz mappings into a Hilbert space
W. B. Johnson and J. Lindenstrauss · 1984
Earlier work this paper cites.
The multiconfiguration time-dependent Hartree (MCTDH) method: a highly efficient algorithm for propagating wavepackets
M. H. Beck, A. Jäckle, G. A. Worth, and H.-D. Meyer · 2000
Earlier work this paper cites.
Orthogonal tensor decompositions
T. G. Kolda · 2001
Earlier work this paper cites.
Finding frequent items in data streams
M. Charikar, K. Chen, and M. Farach-Colton · 2002
Earlier work this paper cites.
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
D. Achlioptas · 2003
Earlier work this paper cites.
Lambertian reflectance and linear subspaces
R. Basri and D. W. Jacobs · 2003
Earlier work this paper cites.
A new efficient method for determining the number of components in parafac models
R. Bro and H. A. Kiers · 2003
Earlier work this paper cites.
Finding frequent items in data streams
M. Charikar, K. Chen, and M. Farach-Colton · 2004
Earlier work this paper cites.
Decoding by linear programming
E. J. Candès and T. Tao · 2005
Earlier work this paper cites.
What’s hot and what’s not: tracking most frequent items dynamically
G. Cormode and S. Muthukrishnan · 2005
Earlier work this paper cites.
Multilinear independent components analysis
M. A. O. Vasilescu and D. Terzopoulos · 2005
Earlier work this paper cites.
A simple proof of the restricted isometry property for random matrices
R. Baraniuk, M. Davenport, R. DeVore, and M. Wakin · 2008
Earlier work this paper cites.
Tensor rank and the ill-posedness of the best low-rank approximation problem
V. De Silva and L.-H. Lim · 2008
Earlier work this paper cites.
Group testing and sparse signal recovery
A. C. Gilbert, M. A. Iwen, and M. J. Strauss · 2008
Earlier work this paper cites.
From quantum to classical molecular dynamics: reduced models and numerical analysis
C. Lubich · 2008
Earlier work this paper cites.
Exact matrix completion via convex optimization
E. J. Candès and B. Recht · 2009
Earlier work this paper cites.
Tensor decompositions and applications
T. G. Kolda and B. W. Bader · 2009
Earlier work this paper cites.
A sparse Johnson–Lindenstrauss transform
A. Dasgupta, R. Kumar, and T. Sarlós · 2010
Earlier work this paper cites.
Quantum state tomography via compressed sensing
D. Gross, Y.-K. Liu, S. T. Flammia, S. Becker, and J. Eisert · 2010
Cited alongside, same era.
Combinatorial sublinear-time fourier algorithms
M. A. Iwen · 2010
Cited alongside, same era.
Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
B. Recht, M. Fazel, and P. A. Parrilo · 2010
Cited alongside, same era.
Robust principal component analysis?
E. J. Candès, X. Li, Y. Ma, and J. Wright · 2011
Cited alongside, same era.
New and improved Johnson–Lindenstrauss embeddings via the restricted isometry property
F. Krahmer and R. Ward · 2011
Cited alongside, same era.
Compressed sensing: theory and applications
Y. C. Eldar and G. Kutyniok · 2012
Cited alongside, same era.
Sparser Johnson-Lindenstrauss transforms
D. M. Kane and J. Nelson · 2014
Later among the works it cites.
Fast and guaranteed tensor decomposition via sketching
Y. Wang, H.-Y. Tung, A. J. Smola, and A. Anandkumar · 2015
Later among the works it cites.
A distributed and incremental SVD algorithm for agglomerative data analysis on large networks
M. Iwen and B. Ong · 2016
Later among the works it cites.
Efficient tensor completion for color image and video recovery: Low-rank tensor train
J. A. Bengua, H. N. Phien, H. D. Tuan, and M. N. Do · 2017
Later among the works it cites.
Optimality of the Johnson-Lindenstrauss lemma
K. G. Larsen and J. Nelson · 2017
Later among the works it cites.
Near optimal sketching of low-rank tensor regression
X. Li, J. Haupt, and D. Woodruff · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Tensor completion for estimating missing values in visual data
J. Liu, P. Musialski, P. Wonka, and J. Ye · 2012
Cited alongside, same era.
A new truncation strategy for the higher-order singular value decomposition
N. Vannieuwenhoven, R. Vandebril, and K. Meerbergen · 2012
Cited alongside, same era.
A mathematical introduction to compressive sensing
S. Foucart and H. Rauhut · 2013
Cited alongside, same era.
A mathematical introduction to compressive sensing
S. Foucart and H. Rauhut · 2013
Cited alongside, same era.
Improved approximation guarantees for sublinear-time fourier algorithms
M. A. Iwen · 2013
Cited alongside, same era.
Compressed matrix multiplication
R. Pagh · 2013
Cited alongside, same era.
Low rank tensor recovery via iterative hard thresholding
H. Rauhut, R. Schneider, and Ž. Stojanac · 2017
Later among the works it cites.
A practical randomized CP tensor decomposition
C. Battaglino, G. Ballard, and T. G. Kolda · 2018
Later among the works it cites.
Low-rank Tucker decomposition of large tensors using tensorsketch
O. A. Malik and S. Becker · 2018
Later among the works it cites.
Tensor random projection for low memory dimension reduction
Y. Sun, Y. Guo, J. A. Tropp, and M. Udell · 2018
Later among the works it cites.
The core consistency of a compressed tensor
G. Tsitsikas and E. E. Papalexakis · 2018
Later among the works it cites.
High-dimensional probability: An introduction with applications in data science
R. Vershynin · 2018
Later among the works it cites.
Extension of PCA to higher order data structures: An introduction to tensors, tensor decompositions, and tensor PCA
A. Zare, A. Ozdemir, M. A. Iwen, and S. Aviyente · 2018
Later among the works it cites.
A deterministic sparse fft for functions with structured fourier sparsity
S. Bittens, R. Zhang, and M. A. Iwen · 2019
Closest in time.
Faster Johnson–Lindenstrauss transforms via kronecker products
R. Jin, T. G. Kolda, and R. Ward · 2019
Closest in time.
Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument, 2019
O. A. Malik and S. Becker · 2019
Closest in time.
A new class of fully discrete sparse fourier transforms: Faster stable implementations with guarantees
S. Merhi, R. Zhang, M. A. Iwen, and A. Christlieb · 2019
Closest in time.
Concentration inequalities for random tensors
R. Vershynin · 2019
Closest in time.
Oblivious sketching of high-degree polynomial kernels
T. D. Ahle, M. Kapralov, J. B. Knudsen, R. Pagh, A. Velingker, D. P. Woodruff, and A. Zandieh · 2020
Closest in time.
B. T. Rakhshan and G. Rabusseau · 2020
Closest in time.
Higher-order count sketch: Dimensionality reduction that retains efficient tensor operations
Y. Shi and A. Anandkumar · 2020
Closest in time.