Sketching High-Dimensional Data
Talkat Probability, Geometry, and Computation in High Dimensions Boot Camp (Simons Institute, Fall 2020) · 2020-08-19..08-28·
summary
Johnson–Lindenstrauss embedding requires m = O(ε^{-2} log n) and is information-theoretically tight; practical work replaces dense Gaussian maps with faster or sparser constructions. Fast-JL uses a randomized Fourier preconditioner plus sampling to get embedding time ≈ O(d log d) (with a small slow JL wrap-up), while sparse approaches prove the CountSketch with s ≈ εm nonzeros is nearly optimal up to logs. Applications: 1+ε-preserves k‑means cost (you can reduce to m ≈ k/ε^2 or even O(log k) refinements), enable approximate matrix multiplication and sketch‑and‑solve least squares.
AI-written summary · about
chapters (10)
- 0:00Introduction to embeddings
- 3:15Johnson-Lindenstrauss theory
- 11:25Proofs and distributions
- 14:18Improving runtime
- 19:18Sparse constructions
- 28:52State-of-the-art sparse JL
- 33:50Applications: K-means
- 46:44Constrained low-rank
- 52:59Randomized linear algebra
- 1:02:50Subspace embeddings
related talks
01h 03mSketching as a Tool for Numerical Linear Algebra
48mHomomorphic Sketches: Shrinking Big Data without Sacrificing Structure
35mSampling for Subset Selection and Applications
48mInput-sparsity Time Algorithms for Embeddings and Regression Problems
01h 26mStreaming, Sketching and Sufficient Statistics II
01h 24mStreaming, Sketching and Sufficient Statistics I
48mRandomized Numerical Linear Algebra
46mSpectral Sparsification of Graphs
