ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2405.05865
40
2

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

9 May 2024
Michal Dereziñski
Christopher Musco
Jiaming Yang
ArXivPDFHTML
Abstract

We present a new class of preconditioned iterative methods for solving linear systems of the form Ax=bAx = bAx=b. Our methods are based on constructing a low-rank Nyström approximation to AAA 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 AAA, 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 n×nn\times nn×n linear system that is well-conditioned except for kkk outlying large singular values in O~(n2.065+kω)\tilde{O}(n^{2.065} + k^\omega)O~(n2.065+kω) time, improving on a recent result of [Dereziński, Yang, STOC 2024] for all k≳n0.78k \gtrsim n^{0.78}k≳n0.78.2. We give the first O~(n2+dλω\tilde{O}(n^2 + {d_\lambda}^{\omega}O~(n2+dλ​ω) time algorithm for solving a regularized linear system (A+λI)x=b(A + \lambda I)x = b(A+λI)x=b, where AAA is positive semidefinite with effective dimension dλ=tr(A(A+λI)−1)d_\lambda=\mathrm{tr}(A(A+\lambda I)^{-1})dλ​=tr(A(A+λI)−1). This problem arises in applications like Gaussian process regression.3. We give faster algorithms for approximating Schatten ppp-norms and other matrix norms. For example, for the Schatten 1-norm (nuclear norm), we give an algorithm that runs in O~(n2.11)\tilde{O}(n^{2.11})O~(n2.11) time, improving on an O~(n2.18)\tilde{O}(n^{2.18})O~(n2.18) 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 }
}
Comments on this paper