Fast, deterministic and sparse dimensionality reduction
From MaRDI portal
Publication:4607975
zbMATH Open1403.68079MaRDI QIDQ4607975FDOQ4607975
Authors: Daniel Dadush, Cristóbal Guzmán, Neil Olver 
Publication date: 15 March 2018
Full work available at URL: http://dl.acm.org/citation.cfm?id=3175357
Recommendations
Computational methods for sparse matrices (65F50) Random matrices (algebraic aspects) (15B52) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (19)
- Sparser Johnson-Lindenstrauss transforms
- Fast dimension reduction using Rademacher series on dual BCH codes
- Fast binary embeddings with Gaussian circulant matrices: improved bounds
- A variant of the Johnson-Lindenstrauss lemma for circulant matrices
- The Mailman algorithm: a note on matrix-vector multiplication
- A sparse grid based method for generative dimensionality reduction of high-dimensional data
- Explicit dimension reduction and its applications
- An almost optimal unrestricted fast Johnson-Lindenstrauss transform
- Bilinear Lanczos components for fast dimensionality reduction and feature extraction
- Improved analysis of the subsampled randomized Hadamard transform
- Optimal fast Johnson-Lindenstrauss embeddings for large data sets
- Simple analyses of the sparse Johnson-Lindenstrauss transform
- Dense Fast Random Projections and Lean Walsh Transforms
- Sparser Johnson-Lindenstrauss transforms
- Dense fast random projections and Lean Walsh transforms
- Title not available (Why is that?)
- On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms
- Deterministic parallel algorithms for bilinear objective functions
- Fast and memory-optimal dimension reduction using Kac's walk
This page was built for publication: Fast, deterministic and sparse dimensionality reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607975)
