Fetching the paper…
Reading the bibliography…
This work discusses tensor network embeddings, which are random matrices ($S$) with tensor network structure.
The expression of a tensor or a polyadic as a sum of products
F. L. Hitchcock · 1927
Earlier work this paper cites.
Foundations of the PARAFAC procedure: models and conditions for an explanatory multimodal factor analysis
R. A. Harshman · 1970
Earlier work this paper cites.
The complexity of computing the permanent
L. G. Valiant · 1979
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.
The complexity of tensor calculus
C. Damm, M. Holzer, and P. McKenzie · 2002
Earlier work this paper cites.
Efficient classical simulation of slightly entangled quantum computations
G. Vidal · 2003
Earlier work this paper cites.
The density-matrix renormalization group
U. Schollwöck · 2005
Earlier work this paper cites.
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
N. Ailon and B. Chazelle · 2006
Earlier work this paper cites.
A guide to NumPy
T. E. Oliphant · 2006
Earlier work this paper cites.
Improved approximation algorithms for large matrices via random projections
T. Sarlos · 2006
Earlier work this paper cites.
Multivariate regression and machine learning with sums of separable functions
G. Beylkin, J. Garcke, and M. J. Mohlenkamp · 2009
Earlier work this paper cites.
Tensor decompositions and applications
T. G. Kolda and B. W. Bader · 2009
Earlier work this paper cites.
Almost optimal explicit Johnson-Lindenstrauss families
D. Kane, R. Meka, and J. Nelson · 2011
Earlier work this paper cites.
Tensor-train decomposition
I. V. Oseledets · 2011
Earlier work this paper cites.
The density-matrix renormalization group in the age of matrix product states
U. Schollwöck · 2011
Earlier work this paper cites.
Fast solution of parabolic problems in the tensor train/quantized tensor train format with initial application to the Fokker–Planck equation
S. V. Dolgov, B. N. Khoromskij, and I. V. Oseledets · 2012
Earlier work this paper cites.
Tensor hypercontraction density fitting. I. quartic scaling second-and third-order Møller-Plesset perturbation theory
E. G. Hohenstein, R. M. Parrish, and T. J. Martínez · 2012
Cited alongside, same era.
Compressed matrix multiplication
R. Pagh · 2013
Cited alongside, same era.
Fast and scalable polynomial kernels via explicit feature maps
N. Pham and R. Pagh · 2013
Cited alongside, same era.
Fast alternating LS algorithms for high order CANDECOMP/PARAFAC tensor factorizations
A.-H. Phan, P. Tichavskỳ, and A. Cichocki · 2013
Cited alongside, same era.
Tensor decompositions for learning latent variable models
A. Anandkumar, R. Ge, D. Hsu, S. M. Kakade, and M. Telgarsky · 2014
Cited alongside, same era.
Sparser Johnson-Lindenstrauss transforms
D. M. Kane and J. Nelson · 2014
Cited alongside, same era.
Tensor-based dynamic mode decomposition
S. Klus, P. Gelß, S. Peitz, and C. Schütte · 2018
Later among the works it cites.
Faster Johnson-Lindenstrauss transforms via Kronecker products
R. Jin, T. G. Kolda, and R. Ward · 2019
Later among the works it cites.
Tight dimensionality reduction for sketching low degree polynomial kernels
M. Meister, T. Sarlos, and D. P. Woodruff · 2019
Later among the works it cites.
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
Later among the works it cites.
Practical leverage-based sampling for low-rank tensor decomposition
B. W. Larsen and T. G. Kolda · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A practical introduction to tensor networks: Matrix product states and projected entangled pair states
R. Orús · 2014
Cited alongside, same era.
Sketching as a tool for numerical linear algebra
D. P. Woodruff · 2014
Cited alongside, same era.
On the numerical approximation of the Perron-Frobenius and Koopman operator
S. Klus, P. Koltai, and C. Schütte · 2015
Cited alongside, same era.
Randomized sketches of convex programs with sharp guarantees
M. Pilanci and M. J. Wainwright · 2015
Cited alongside, same era.
Supervised learning with tensor networks
E. Stoudenmire and D. J. Schwab · 2016
Cited alongside, same era.
Hand-waving and interpretive dance: an introductory course on tensor networks
J. C. Bridgeman and C. T. Chubb · 2017
Cited alongside, same era.
L. Ma, J. Ye, and E. Solomonik · 2020
Later among the works it cites.
Tensorized random projections
B. Rakhshan and G. Rabusseau · 2020
Later among the works it cites.
Tensor-structured sketching for constrained least squares
K. Chen and R. Jin · 2021
Later among the works it cites.
Randomized algorithms for rounding in the tensor-train format
H. A. Daas, G. Ballard, P. Cazeaux, E. Hallman, A. Miedlar, M. Pasha, T. W. Reid, and A. K. Saibaba · 2021
Later among the works it cites.
Efficient parallel CP decomposition with pairwise perturbation and multi-sweep dimension tree
L. Ma and E. Solomonik · 2021
Later among the works it cites.
Fast and accurate randomized algorithms for low-rank tensor decompositions
L. Ma and E. Solomonik · 2021
Later among the works it cites.
More efficient sampling for tensor decomposition
O. A. Malik · 2021
Later among the works it cites.
Spectral tensor train parameterization of deep learning layers
A. Obukhov, M. Rakhuba, A. Liniger, Z. Huang, S. Georgoulis, D. Dai, and L. Van Gool · 2021
Later among the works it cites.
Solving high-dimensional parabolic PDEs using the tensor train format
L. Richter, L. Sallandt, and N. Nüsken · 2021
Later among the works it cites.
Low rank approximation in simulations of quantum algorithms
L. Ma and C. Yang · 2022
Closest in time.
Leverage score sampling for tensor product matrices in input sparsity time
D. P. Woodruff and A. Zandieh · 2022
Closest in time.