An Introduction to Matrix Concentration Inequalities
Random matrices now play a role in many areas of theoretical, applied, and computational mathematics. It is therefore 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.
1121992587
An Introduction to Matrix Concentration Inequalities
Random matrices now play a role in many areas of theoretical, applied, and computational mathematics. It is therefore 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.
99.0 In Stock
An Introduction to Matrix Concentration Inequalities

An Introduction to Matrix Concentration Inequalities

by Joel A. Tropp
An Introduction to Matrix Concentration Inequalities

An Introduction to Matrix Concentration Inequalities

by Joel A. Tropp

Overview

Random matrices now play a role in many areas of theoretical, applied, and computational mathematics. It is therefore 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.

Product Details

ISBN-13: 9781601988386
Publisher: Now Publishers
Publication date: 05/27/2015
Series: Foundations and Trends in Machine Learning , #25
Pages: 252
Product dimensions: 6.14(w) x 9.21(h) x 0.53(d)

Table of Contents

Preface 1: Introduction 2: Matrix Functions & Probability with Matrices 3: The Matrix Laplace Transform Method 4: Matrix Gaussian Series & Matrix Rademacher Series 5: A Sum of Random Positive-Semidefinite Matrices 6: A Sum of Bounded Random Matrices 7: Results Involving the Intrinsic Dimension 8: A Proof of Lieb's Theorem. Appendices. References
From the B&N Reads Blog
Page 1 of

Customer Reviews