On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms
DOI10.4230/LIPIcs.ISAAC.2017.32zbMath1457.68288arXiv1706.10110MaRDI QIDQ5136251
Kasper Green Larsen, Casper Benjamin Freksen
Publication date: 25 November 2020
Full work available at URL: https://arxiv.org/abs/1706.10110
Inequalities; stochastic orderings (60E15) Analysis of algorithms and problem complexity (68Q25) Random matrices (probabilistic aspects) (60B20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Toeplitz, Cauchy, and related matrices (15B05) Embeddings of discrete metric spaces into Banach spaces; applications in topology and computer science (46B85) Metric embeddings as related to computational problems and algorithms (68R12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A variant of the Johnson-Lindenstrauss lemma for circulant matrices
- Fast dimension reduction using Rademacher series on dual BCH codes
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- A sparse Johnson
- An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform
- Dimensionality Reduction for k-Means Clustering and Low Rank Approximation
- Randomized Dimensionality Reduction for <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Means Clustering
- Johnson-Lindenstrauss lemma for circulant matrices**
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- Sparser Johnson-Lindenstrauss Transforms
- Extensions of Lipschitz mappings into a Hilbert space
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction
- An elementary proof of a theorem of Johnson and Lindenstrauss
- The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
- Compressed sensing
- Graph Sparsification by Effective Resistances
This page was built for publication: On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms
