5 Concentration Inequalities
We now turn to the high-dimensional setting, beginning with concentration inequalities. The section is organized as follows:
- 1.
- Basic Concentration Inequalities
- 2.
- Random Vectors
- 3.
- Random Matrices
- 4.
- Concentration of Lipschitz Functions
- 5.
- Gaussian Concentration
This section mainly follows STAT210B (UC Berkeley, taught by Song Mei), High-dimensional probability (PKU, taught by Zhihua Zhang) and Introduction to Machine Learning (PKU, taught by Lei Wu), STAT300B (Stanford), CS839 (U Wisconsin–Madison). I also referred to the book High-dimensional probability: An introduction with applications in data science [5] and the book High-Dimensional Statistics: A Non-Asymptotic Viewpoint [6].
5.1.1 Sub-Gaussians
5.1.2 Sub-Exponentials
5.1.3 Maximal Inequality
5.2 Random Vectors
5.2.1 Random Vectors
5.2.2 Grothendieck’s Inequality
5.3 Random Matrices
5.3.1 Covering Number
5.3.2 Sub-Gaussian Matrices
5.3.3 Application: Community Detection in Networks
5.4 Concentration of Lipschitz Functions
5.5 Martingale Concentration Inequalities
5.5.1 Martingale Concentration
5.5.2 Gaussian Complexity