Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning

We present a new class of preconditioned iterative methods for solving linear systems of the form . Our methods are based on constructing a low-rank Nyström approximation to using sparse random matrix sketching. This approximation is used to construct a preconditioner, which itself is inverted quickly using additional levels of random sketching and preconditioning. We prove that the convergence of our methods depends on a natural average condition number of , which improves as the rank of the Nyström approximation increases. Concretely, this allows us to obtain faster runtimes for a number of fundamental linear algebraic problems:1. We show how to solve any linear system that is well-conditioned except for outlying large singular values in time, improving on a recent result of [Dereziński, Yang, STOC 2024] for all .2. We give the first ) time algorithm for solving a regularized linear system , where is positive semidefinite with effective dimension . This problem arises in applications like Gaussian process regression.3. We give faster algorithms for approximating Schatten -norms and other matrix norms. For example, for the Schatten 1-norm (nuclear norm), we give an algorithm that runs in time, improving on an method of [Musco et al., ITCS 2018]. All results are proven in the real RAM model of computation. Interestingly, previous state-of-the-art algorithms for most of the problems above relied on stochastic iterative methods, like stochastic coordinate and gradient descent. Our work takes a completely different approach, instead leveraging tools from matrix sketching.
View on arXiv@article{dereziński2025_2405.05865, title={ Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning }, author={ Michał Dereziński and Christopher Musco and Jiaming Yang }, journal={arXiv preprint arXiv:2405.05865}, year={ 2025 } }