Faster Johnson–Lindenstrauss transforms via Kronecker products
From MaRDI portal
Publication:5033281
DOI10.1093/imaiai/iaaa028zbMath1483.94017arXiv1909.04801OpenAlexW3094211687MaRDI QIDQ5033281
Rachel Ward, Ruhui Jin, Tamara G. Kolda
Publication date: 22 February 2022
Published in: Information and Inference: A Journal of the IMA (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.04801
concentration inequalityrestricted isometry propertyJohnson-Lindenstrauss embeddingKronecker structurefast Johnson-Lindenstrauss transform (FJLT)
Random matrices (probabilistic aspects) (60B20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical linear algebra (65F99)
Related Items (8)
Johnson–Lindenstrauss Embeddings with Kronecker Structure ⋮ Randomized numerical linear algebra: Foundations and algorithms ⋮ Filament plots for data visualization ⋮ The Hanson-Wright inequality for random tensors ⋮ Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument ⋮ Practical Leverage-Based Sampling for Low-Rank Tensor Decomposition ⋮ Modewise operators, the tensor restricted isometry property, and low-rank tensor recovery ⋮ Norm and Trace Estimation with Random Rank-one Vectors
This page was built for publication: Faster Johnson–Lindenstrauss transforms via Kronecker products