An Introduction to Matrix Concentration Inequalities
Foundations and Trends® in Machine Learning · 27.05.2015 · 8 (1-2) · 1-230
DOI: 10.1561/2200000048 ↗Kurz gefasst
Fachartikel in der Zeitschrift Foundations and Trends® in Machine Learning, online erschienen am 27.05.2015. Verfasst von Joel A. Tropp. Die Arbeit wurde bisher 379-mal zitiert (Crossref) und nennt 194 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
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