Johnson-Lindenstrauss Embeddings with Kronecker Structure
Not on the map. Why?
Abstract (arXiv)
We prove the Johnson-Lindenstrauss property for matrices Phi D_xi where Phi has the restricted isometry property and D_xi is a diagonal matrix containing the entries of a Kronecker product xi = xi(1) otimes dots otimes xi(d) of d independent Rademacher vectors. Such embeddings have been proposed in recent works for a number of applications concerning compression of tensor structured data, including the oblivious sketching procedure by Ahle et al. for approximate tensor computations. For preserving the norms of p points simultaneously, our result requires Phi to have the restricted isometry property for sparsity C(d) (log p)d. In the case of subsampled Hadamard matrices, this can improve the dependence of the embedding dimension on p to (log p)d while the best previously known result required (log p)d + 1. That is, for the case of d=2 at the core of the oblivious sketching procedure by Ahle et al., the scaling improves from cubic to quadratic. We provide a counterexample to prove that the scaling established in our result is optimal under mild assumptions.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 24 Jun 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 0; 2024: 0; 2025: 0; 2026: 3.
5 papers.
- 2021More Efficient Sampling for Tensor Decomposition With Worst-Case Guaranteescited by 7
- 2021On Fast Johnson-Lindenstrauss Embeddings of Compact Submanifolds of ℝN with Boundarycited by 3
- 2026MMD Guidance: Training-Free Distribution Adaptation for Diffusion Models via Maximum Mean Discrepancy Guidancecited by 3
- 2026DAK-UCB: Diversity-Aware Prompt Routing for LLMs and Generative Modelscited by 2
- 2026Guaranteed Low-Rank Tensor Recovery from Modewise Measurements via Normalized Block-Weighted Riemannian Gradient Descentcited by 0
- 2026Guaranteed Low-Rank Tensor Recovery from Modewise Measurements via Normalized Block-Weighted Riemannian Gradient Descent21 Sep 2026
- 2026DAK-UCB: Diversity-Aware Prompt Routing for LLMs and Generative Models24 Mar 2026
- 2026MMD Guidance: Training-Free Distribution Adaptation for Diffusion Models via Maximum Mean Discrepancy Guidance13 Jan 2026
- 2021More Efficient Sampling for Tensor Decomposition With Worst-Case Guarantees14 Oct 2021
- 2021On Fast Johnson-Lindenstrauss Embeddings of Compact Submanifolds of ℝN with Boundary8 Oct 2021