~/talk

Sketching for Linear Algebra: Basics of Dimensionality Reduction and CountSketch I

slides:none on file

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

  1. 0:00Intro
  2. 0:35Outline
  3. 1:06Regression analysis
  4. 8:57Moore-Penrose Pseudoinverse
  5. 10:13Time Complexity
  6. 10:38Sketching to solve least squares regression
  7. 21:05How to choose the right sketching matrix S? [S]
  8. 24:28Faster Subspace Embeddings S CW,MM,NN
  9. 27:15Simple Proof ANW
  10. 35:45Matrix Product Result [Kane, Nelson]
  11. 39:25From Vectors to Matrices
  12. 54:43CountSketch Satisfies the JL Property
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.