Johnson–Lindenstrauss Embeddings with Kronecker Structure
From MaRDI portal
(Redirected from Publication:5885797)
Multilinear algebra, tensor calculus (15A69) Random matrices (algebraic aspects) (15B52) Random matrices (probabilistic aspects) (60B20) Numerical methods for low-rank matrix approximation; matrix compression (65F55) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Recommendations
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- Optimal fast Johnson-Lindenstrauss embeddings for large data sets
- New bounds for circulant Johnson-Lindenstrauss embeddings
- Faster Johnson-Lindenstrauss transforms via Kronecker products
- scientific article; zbMATH DE number 1132946
- The Johnson-Lindenstrauss Transform: An Empirical Study
- A practical algorithm for structure embedding
- Sparser Johnson-Lindenstrauss transforms
- Sparser Johnson-Lindenstrauss transforms
Cites work
- A mathematical introduction to compressive sensing
- A Practical Randomized CP Tensor Decomposition
- A variant of the Johnson-Lindenstrauss lemma for circulant matrices
- An algorithmic theory of learning: robust concepts and random projection
- An almost optimal unrestricted fast Johnson-Lindenstrauss transform
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- Concentration inequalities for non-Lipschitz functions with bounded derivatives of higher order
- Decoupling inequalities for polynomial chaos
- Estimates of moments and tails of Gaussian chaoses
- Extensions of Lipschitz mappings into a Hilbert space
- Faster Johnson-Lindenstrauss transforms via Kronecker products
- Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument
- scientific article; zbMATH DE number 2086663 (Why is no real title available?)
- Improved bounds for the RIP of subsampled circulant matrices
- Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- Oblivious Sketching of High-Degree Polynomial Kernels
- On decoupling, series expansions, and tail behavior of chaos processes
- Optimal fast Johnson-Lindenstrauss embeddings for large data sets
- Problems and results in extremal combinatorics. I.
- Sketching as a tool for numerical linear algebra
- Tensor-structured sketching for constrained least squares
- The geometry of graphs and some of its algorithmic applications
- The Hanson-Wright inequality for random tensors
- The Johnson-Lindenstrauss lemma and the sphericity of some graphs
- The restricted isometry property of subsampled Fourier matrices
Cited in
(11)- Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- scientific article; zbMATH DE number 1132946 (Why is no real title available?)
- Faster Johnson-Lindenstrauss transforms via Kronecker products
- On fast Johnson-Lindenstrauss embeddings of compact submanifolds of \(\mathbb{R}^N\) with boundary
- Applied harmonic analysis and data science. Abstracts from the workshop held April 21--26, 2024
- Small ball probabilities for simple random tensors
- Construction of hierarchically semiseparable matrix representation using adaptive Johnson-Lindenstrauss sketching
- Efficient randomized algorithms for fixed precision problem of approximate Tucker decomposition
- Fast and low-memory compressive sensing algorithms for low Tucker-rank tensor approximation from streamed measurements
- Subspace embedding with random Khatri-Rao products and its application to eigensolvers
This page was built for publication: Johnson–Lindenstrauss Embeddings with Kronecker Structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5885797)
