~/talk

Matrix Martingales in Randomized Numerical Linear Algebra

links:none on file
slides:none on file

Matrix martingale concentration (a matrix Freedman bound) controls the predictable quadratic variation so randomized incomplete Gaussian elimination yields a sparse factor U with U^T U ≈ L after isotropic normalization. The algorithm does random vertex elimination and samples the induced clique instead of materializing it; expected decomposition equals the original Laplacian and martingale concentration (variance per round scales like 1/remaining‑vertices, giving a harmonic log factor) proves a constant‑factor spectral approximation in M log^3 n time.

AI-written summary · about

  1. 0:00Intro
  2. 0:49Matrix Martingales in Randomized Numerical Linear Algebra
  3. 1:00Concentration of Scalar Random Variables
  4. 2:21Concentration of Scalar Martingales
  5. 6:05Concentration of Matrix Random Variables
  6. 7:53Concentration of Matrix Martingales
  7. 9:06Laplacian Matrices
  8. 10:33Laplacian of a Graph
  9. 12:02Solving a Laplacian Linear Equation
  10. 14:40Additive View of Gaussian Elimination
  11. 17:23Why is Gaussian Elimination Slow?
  12. 20:18Approximate Gaussian Elimination
  13. 21:14Approximating Matrices by Sampling
  14. 21:45Approximating Matrices in Expectation
  15. 24:22Approximation?
  16. 25:31Essential Tools
  17. 26:20Matrix Concentration: Edge Variables
  18. 26:56Predictable Quadratic Variation
  19. 28:08Sample Variance
  20. 30:55Summary
~/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.