An Introduction to Matrix Concentration Inequalities
January 07, 2015 Β· Declared Dead Β· π Found. Trends Mach. Learn.
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Joel A. Tropp
arXiv ID
1501.01571
Category
math.PR
Cross-listed
cs.DS,
cs.IT,
math.NA,
stat.ML
Citations
1.2K
Venue
Found. Trends Mach. Learn.
Last Checked
1 month ago
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β math.PR
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Non-backtracking spectrum of random graphs: community detection and non-regular Ramanujan graphs
R.I.P.
π»
Ghosted
Convergence of the Deep BSDE Method for Coupled FBSDEs
R.I.P.
π»
Ghosted
A Random Matrix Approach to Neural Networks
R.I.P.
π»
Ghosted
Concentration and regularization of random graphs
R.I.P.
π»
Ghosted
Sampling from a log-concave distribution with Projected Langevin Monte Carlo
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Language Models are Few-Shot Learners
R.I.P.
π»
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
π»
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
π»
Ghosted