
High-Dimensional Probability
An Introduction with Applications in Data Science
- English
- PDF
- Available on iOS & Android
About this book
High-dimensional probability offers insight into the behavior of random vectors, random matrices, random subspaces, and objects used to quantify uncertainty in high dimensions. Drawing on ideas from probability, analysis, and geometry, it lends itself to applications in mathematics, statistics, theoretical computer science, signal processing, optimization, and more. It is the first to integrate theory, key tools, and modern applications of high-dimensional probability. Concentration inequalities form the core, and it covers both classical results such as Hoeffding's and Chernoff's inequalities and modern developments such as the matrix Bernstein's inequality. It then introduces the powerful methods based on stochastic processes, including such tools as Slepian's, Sudakov's, and Dudley's inequalities, as well as generic chaining and bounds based on VC dimension. A broad range of illustrations is embedded throughout, including classical and modern results for covariance estimation, clustering, networks, semidefinite programming, coding, dimension reduction, matrix completion, machine learning, compressed sensing, and sparse regression.
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Cover
- Reviews
- Half-title page
- Series page
- Title page
- Copyright page
- Contents
- Foreword
- Preface
- Appetizer Using Probability to Cover a Geometric Set
- 1 Preliminaries on Random Variables
- 2 Concentration of Sums of Independent Random Variables
- 3 Random Vectors in High Dimensions
- 4 Random Matrices
- 5 Concentration Without Independence
- 6 Quadratic Forms, Symmetrization, and Contraction
- 7 Random Processes
- 8 Chaining
- 9 Deviations of Random Matrices and Geometric Consequences
- 10 Sparse Recovery
- 11 Dvoretzky–Milman Theorem
- Hints for Exercises
- References
- Index