Sketching for Linear Algebra: Basics of Dimensionality Reduction and CountSketch I
summary
Shows that CountSketch matrices (hash rows, random ±1 signs) give a subspace embedding for regression with one non-zero per column and k = Θ(d^2/ε^2) rows, so SA is computable in O(nnz(A)) time and regression reduces to solving a k×d system in poly(d/ε) time. Proof uses an approximate matrix product bound derived from a JL-moment condition (unbiased sketch, variance and higher moments control) and yields only linear dependence on failure probability δ.
AI-written summary · about
chapters (12)
- 0:00Intro
- 0:35Outline
- 1:06Regression analysis
- 8:57Moore-Penrose Pseudoinverse
- 10:13Time Complexity
- 10:38Sketching to solve least squares regression
- 21:05How to choose the right sketching matrix S? [S]
- 24:28Faster Subspace Embeddings S CW,MM,NN
- 27:15Simple Proof ANW
- 35:45Matrix Product Result [Kane, Nelson]
- 39:25From Vectors to Matrices
- 54:43CountSketch Satisfies the JL Property
related talks
01h 03mSketching as a Tool for Numerical Linear Algebra
01h 04mSketching and Randomized Linear Algebra
31mSimple and Deterministic Matrix Sketches
28mSketching for M-Estimators: A Unified Approach to Robust Regression
01h 27mPast, Present and Future of Randomized Numerical Linear Algebra I
32mRandomized Numerical Linear Algebra: Overview
42mDimensionality Reduction Via Sparse Matrices
48mRandomized Numerical Linear Algebra
