Nearly Linear Time Algorithms for Solving Inverse Symmetric M-Matrices
summary
Provides algorithms that recover and solve three hard cases—perturbed Laplacians, Laplacian pseudoinverses, and inverse symmetric M-matrices—by producing a spectral approximation and then preconditioning to solve linear systems in roughly n^2 time while making only polylogarithmic matrix‑vector multiplies. Uses a matrix‑recovery SDP framework (packing/covering solvers), iterative preconditioning with a decreasing regularization parameter, and sparse edge decompositions. Works in an oracle model (only matvecs); proofs give poly(1/γ) iteration bounds. Open: faster than n^2 and nonadaptive queries.
AI-written summary · about
chapters (19)
- 0:00Intro
- 1:08Motivation
- 2:42Laplacian System Solving
- 6:00Beyond Laplacian Systems?
- 8:33Directed Graphs and Asymmetric Systems
- 10:38Perturbed Laplacians
- 14:02Laplacian Pseudoinverse
- 16:52Inverse M-Matrices
- 19:24Hold up!
- 20:12Our Results
- 23:47Rest of Talk
- 26:47How to Solve?
- 28:55Picture
- 30:52Idea #1 - Linear Sketch
- 36:04Idea #2 - Optimize
- 37:27General Problem
- 45:04Pseudoinverse Problem
- 46:50Inverse Symmetric M-Matrices
- 47:39Open Problems
related talks
44mScalable Algorithmic Primitives for Data Science
35mConvergence Theory for Iterative Eigensolvers
29mImplementing Randomized Matrix Algorithms in Parallel and Distributed Environments
32mRandomized Numerical Linear Algebra: Overview
29mRecent Advances in Positive Semidefinite Matrix Approximation
01h 27mPast, Present and Future of Randomized Numerical Linear Algebra I
01h 31mPast, Present and Future of Randomized Numerical Linear Algebra II
42mDimensionality Reduction Via Sparse Matrices
