An Introduction to Matrix Concentration Inequalities
Foundations and Trends® in Machine Learning · 2015-05-27 · 8 (1-2) · 1-230
DOI: 10.1561/2200000048 ↗At a glance
Journal article in Foundations and Trends® in Machine Learning, published online on 2015-05-27. Written by Joel A. Tropp. Cited 379 times so far (Crossref); 194 references.
Abstract (original language)
Random matrices now play a role in many areas of theoretical, applied, and computational mathematics. Therefore, it is desirable to have tools for studying random matrices that are flexible, easy to use, and powerful. Over the last fifteen years, researchers have developed a remarkable family of results, called matrix concentration inequalities, that achieve all of these goals. This monograph offers an invitation to the field of matrix concentration inequalities. It begins with some history of random matrix theory; it describes a flexible model for random matrices that is suitable for many problems; and it discusses the most important matrix concentration results. To demonstrate the value of these techniques, the presentation includes examples drawn from statistics, machine learning, optimization, combinatorics, algorithms, scientific computing, and beyond.
Cite
APA
Tropp, J. A. (2015). An Introduction to Matrix Concentration Inequalities. Foundations and Trends® in Machine Learning, 8(1-2), 1-230. https://doi.org/10.1561/2200000048
Vancouver
Tropp JA. An Introduction to Matrix Concentration Inequalities. Foundations and Trends® in Machine Learning. 2015;8(1-2):1-230. doi:10.1561/2200000048
BibTeX
@article{Tropp2015,
author = {Tropp, Joel A.},
title = {An Introduction to Matrix Concentration Inequalities},
journal = {Foundations and Trends® in Machine Learning},
year = {2015},
volume = {8},
number = {1-2},
pages = {1--230},
doi = {10.1561/2200000048}
}
EUVIMED