2014
DOI: 10.1214/13-aop892
|View full text |Cite
|
Sign up to set email alerts
|

Matrix concentration inequalities via the method of exchangeable pairs

Abstract: This paper derives exponential concentration inequalities and polynomial moment inequalities for the spectral norm of a random matrix. The analysis requires a matrix extension of the scalar concentration theory developed by Sourav Chatterjee using Stein's method of exchangeable pairs. When applied to a sum of independent random matrices, this approach yields matrix generalizations of the classical inequalities due to Hoeffding, Bernstein, Khintchine and Rosenthal. The same technique delivers bounds for sums of… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
91
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
5
4

Relationship

2
7

Authors

Journals

citations
Cited by 105 publications
(94 citation statements)
references
References 49 publications
3
91
0
Order By: Relevance
“…The annotated bibliography includes references to the large literature on moment inequalities for random matrices. Recently, Lester Mackey and the author, in collaboration with Daniel Paulin and several other researchers [118,143], have developed another framework for establishing matrix concentration. This approach extends a scalar argument, introduced by Chatterjee [38,39], that depends on exchangeable pairs and Markov chain couplings.…”
Section: Matrix Freedmanmentioning
confidence: 99%
“…The annotated bibliography includes references to the large literature on moment inequalities for random matrices. Recently, Lester Mackey and the author, in collaboration with Daniel Paulin and several other researchers [118,143], have developed another framework for establishing matrix concentration. This approach extends a scalar argument, introduced by Chatterjee [38,39], that depends on exchangeable pairs and Markov chain couplings.…”
Section: Matrix Freedmanmentioning
confidence: 99%
“…Secondly, the spectrum bound for N S n=1 ς n h * Λ,n h Λ,n , the sum of independent random matrix, can be estimated according to the Bornstein's inequality [23], which states…”
Section: N S and H N• Is The N-th Row Of Hmentioning
confidence: 99%
“…For instance, let the bandwidth and time duration of waveform given by (2) be chosen as 150 MHz and 6 µs, respectively, then N H µ H ∼ = 14.81. Assume ρ K ≤ 1/10N H µ H = 0.6753%, then it can be calculated from (41) that C(ρ K ) takes value in (14,23.125].…”
Section: Support Preserving Conditionmentioning
confidence: 99%
“…For a detailed account of the method see the monograph [10] or the review article [40]. Over the years, the method has been adapted to many other probability distributions, such as the Poisson [9], gamma [26,32], exponential [7,36] and Laplace distribution [14,39], and has been applied to a wide range of applications, including random matrix theory [33], random graph theory [3], urn models [13,28,38], goodness-of-fit statistics [27,26] and statistical physics [8,19]. For an overview of the current literature see [31].…”
Section: Introductionmentioning
confidence: 99%