Fast, deterministic and sparse dimensionality reduction

MaRDI QIDQ4607975zbMATH OpenFDO

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

Mathematics Subject Classification ID

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)

Recommendations

• Sparser Johnson-Lindenstrauss transforms
• A sparse Johnson-Lindenstrauss transform
• Sparser Johnson-Lindenstrauss transforms
• An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform
• An almost optimal unrestricted fast Johnson-Lindenstrauss transform

Cited in

(19)

• Fast dimension reduction using Rademacher series on dual BCH codes
• Sparser Johnson-Lindenstrauss transforms
• 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
• Bilinear Lanczos components for fast dimensionality reduction and feature extraction
• An almost optimal unrestricted fast Johnson-Lindenstrauss transform
• 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
• Dense fast random projections and Lean Walsh transforms
• Sparser Johnson-Lindenstrauss transforms
• Deterministic parallel algorithms for bilinear objective functions
• scientific article; zbMATH DE number 6765491 (Why is no real title available?)
• On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms
• 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)