Sketching for Linear Algebra: Basics of Dimensionality Reduction and CountSketch II
summary
Shows that CountSketch JL moment (L=2) gives an unbiased subspace embedding with variance O(1/K) and needs about K = 2/(ε^2 δ) rows to get the desired moment bound (and explains the D^2 collision lower bound on hashing). Uses S·A and a QR to produce an R that makes the condition number → O(1) so gradient descent needs O(log(1/ε)) iterations, each doing matrix–vector products in NNZ(A) time, yielding run time NNZ(A)·log(1/ε) for high‑precision regression. For low‑rank, sketch to ~k/ε rows, project rows into that row‑span and SVD the smaller matrix in NNZ(A)+n·poly(k/ε) time.
AI-written summary · about
chapters (11)
- 0:00Start
- 5:47CountSketch Satisfies the JL Property
- 12:42Outline
- 12:54High Precision Regression
- 13:48Small QR Decomposition
- 32:17Finding a Constant Factor Solution
- 45:31What is a good low rank approximation?
- 48:24Solution to low-rank approximation [S]
- 51:53What is the matrix S?
- 52:32Caveat: Projecting the points onto SA is Slow
- 55:54Why do these Matrices Work?
related talks
01h 03mSketching as a Tool for Numerical Linear Algebra
01h 04mSketching and Randomized Linear Algebra
31mSimple and Deterministic Matrix Sketches
42mDimensionality Reduction Via Sparse Matrices
01h 27mPast, Present and Future of Randomized Numerical Linear Algebra I
32mRandomized Numerical Linear Algebra: Overview
28mSketching for M-Estimators: A Unified Approach to Robust Regression
48mRandomized Numerical Linear Algebra
