Matrix Martingales in Randomized Numerical Linear Algebra
summary
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
chapters (20)
- 0:00Intro
- 0:49Matrix Martingales in Randomized Numerical Linear Algebra
- 1:00Concentration of Scalar Random Variables
- 2:21Concentration of Scalar Martingales
- 6:05Concentration of Matrix Random Variables
- 7:53Concentration of Matrix Martingales
- 9:06Laplacian Matrices
- 10:33Laplacian of a Graph
- 12:02Solving a Laplacian Linear Equation
- 14:40Additive View of Gaussian Elimination
- 17:23Why is Gaussian Elimination Slow?
- 20:18Approximate Gaussian Elimination
- 21:14Approximating Matrices by Sampling
- 21:45Approximating Matrices in Expectation
- 24:22Approximation?
- 25:31Essential Tools
- 26:20Matrix Concentration: Edge Variables
- 26:56Predictable Quadratic Variation
- 28:08Sample Variance
- 30:55Summary
related talks
01h 27mPast, Present and Future of Randomized Numerical Linear Algebra I
01h 31mPast, Present and Future of Randomized Numerical Linear Algebra II
33mA Few Connections Between Optimization and Probability
49mAnalysis of Algorithms on Dense Matrices using Approximate Message Passing
27mSharp Matrix Concentration
48mRandomized Numerical Linear Algebra
29mImplementing Randomized Matrix Algorithms in Parallel and Distributed Environments
01h 03mSampling for Linear Algebra, Statistics, and Optimization I
