An Introduction to Matrix Concentration Inequalities
read the original abstract
In recent years, random matrices have come to play a major role in computational mathematics, but most of the classical areas of random matrix theory remain the province of experts. Over the last decade, with the advent of matrix concentration inequalities, research has advanced to the point where we can conquer many (formerly) challenging problems with a page or two of arithmetic. The aim of this monograph is to describe the most successful methods from this area along with some interesting examples that these techniques can illuminate.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Select-then-differentiate: Solving Bilevel Optimization with Manifold Lower-level Solution Sets
Optimistic bilevel optimization with manifold lower-level minimizers is differentiable if the optimistic selection is unique, yielding a pseudoinverse hyper-gradient and a convergent HG-MS algorithm whose rate depends...
-
Stability of digital and analog quantum simulations under noise
Rigorous worst- and average-case error bounds show comparable worst-case scaling for digital and analog quantum simulators under perturbative noise, with distinct average-case error cancellation and concentration boun...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.