~/talk

Sketching High-Dimensional Data

links:none on file
slides:none on file

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

  1. 0:00Introduction to embeddings
  2. 3:15Johnson-Lindenstrauss theory
  3. 11:25Proofs and distributions
  4. 14:18Improving runtime
  5. 19:18Sparse constructions
  6. 28:52State-of-the-art sparse JL
  7. 33:50Applications: K-means
  8. 46:44Constrained low-rank
  9. 52:59Randomized linear algebra
  10. 1:02:50Subspace embeddings
~/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.