Tensorized Random Projections
Not on the map. Why?
Abstract (arXiv)
We introduce a novel random projection technique for efficiently reducing the dimension of very high-dimensional tensors. Building upon classical results on Gaussian random projections and Johnson-Lindenstrauss transforms~(JLT), we propose two tensorized random projection maps relying on the tensor train~(TT) and CP decomposition format, respectively. The two maps offer very low memory requirements and can be applied efficiently when the inputs are low rank tensors given in the CP or TT format. Our theoretical analysis shows that the dense Gaussian matrix in JLT can be replaced by a low-rank tensor implicitly represented in compressed form with random factors, while still approximately preserving the Euclidean distance of the projected inputs. In addition, our results reveal that the TT format is substantially superior to CP in terms of the size of the random projection needed to achieve the same distortion ratio. Experiments on synthetic data validate our theoretical analysis and demonstrate the superiority of the TT decomposition.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Mar 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 2; 2023: 1; 2024: 3; 2025: 1; 2026: 1.
11 papers.
- 2025Prismatic Synthesis: Gradient-based Data Diversification Boosts Generalization in LLM Reasoningcited by 38
- 2023Random Fourier Signature Featurescited by 9
- 2021More Efficient Sampling for Tensor Decomposition With Worst-Case Guaranteescited by 7
- 2022Cost-efficient Gaussian Tensor Network Embeddings for Tensor-structured Inputscited by 5
- 2022Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositionscited by 4
- 2021Rademacher Random Projections with Tensor Networkscited by 1
- 2024Long Sequence Modeling with Attention Tensorization: From Sequence to Tensor Learningcited by 1
- 2021Efficient Tensor Contraction via Fast Count Sketchcited by 0
- 2024Improving LSH via Tensorized Random Projectioncited by 0
- 2024Oblivious subspace embeddings for compressed Tucker decompositionscited by 0
- 2026Stochastic trace estimation with tensor train random vectorscited by 0
- 2026Stochastic trace estimation with tensor train random vectors14 Jun 2026
- 2025Prismatic Synthesis: Gradient-based Data Diversification Boosts Generalization in LLM Reasoning26 May 2025
- 2024Long Sequence Modeling with Attention Tensorization: From Sequence to Tensor Learning28 Oct 2024
- 2024Oblivious subspace embeddings for compressed Tucker decompositions13 Jun 2024
- 2024Improving LSH via Tensorized Random Projection11 Feb 2024
- 2023Random Fourier Signature Features20 Nov 2023
- 2022Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions15 Jul 2022
- 2022Cost-efficient Gaussian Tensor Network Embeddings for Tensor-structured Inputs26 May 2022
- 2021Rademacher Random Projections with Tensor Networks26 Oct 2021
- 2021More Efficient Sampling for Tensor Decomposition With Worst-Case Guarantees14 Oct 2021
- 2021Efficient Tensor Contraction via Fast Count Sketch24 Jun 2021