~/talk

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

slides:none on file

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

  1. 0:00Start
  2. 5:47CountSketch Satisfies the JL Property
  3. 12:42Outline
  4. 12:54High Precision Regression
  5. 13:48Small QR Decomposition
  6. 32:17Finding a Constant Factor Solution
  7. 45:31What is a good low rank approximation?
  8. 48:24Solution to low-rank approximation [S]
  9. 51:53What is the matrix S?
  10. 52:32Caveat: Projecting the points onto SA is Slow
  11. 55:54Why do these Matrices Work?
~/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.