A matrix concentration inequality for products

08/12/2020
by   Sina Baghal, et al.
0

We present a non-asymptotic concentration inequality for the random matrix product Z_n = (I_d-α X_n)(I_d-α X_n-1)⋯(I_d-α X_1), where {X_k }_k=1^+∞ is a sequence of bounded independent random positive semidefinite matrices with common expectation 𝔼[X_k]=Σ. Under these assumptions, we show that, for small enough positive α, Z_n satisfies the concentration inequality ℙ(‖ Z_n-𝔼[Z_n]‖≥ t) ≤ 2d^2·(-t^2/ασ^2) for all t≥ 0, where σ^2 denotes a variance parameter.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/20/2019

Sparse random tensors: concentration, regularization and applications

We prove a non-asymptotic concentration inequality of sparse inhomogeneo...
research
12/11/2020

Scaling positive random matrices: concentration and asymptotic convergence

It is well known that any positive matrix can be scaled to have prescrib...
research
02/16/2017

A new concentration inequality for the excess risk in least-squares regression with random design and heteroscedastic noise

We prove a new concentration inequality for the excess risk of a M-estim...
research
03/16/2020

Symmetric Grothendieck inequality

We establish an analogue of the Grothendieck inequality where the rectan...
research
07/23/2018

Fisher Information and Logarithmic Sobolev Inequality for Matrix Valued Functions

We prove a version of Talagrand's concentration inequality for subordina...
research
02/08/2019

Bernstein Concentration Inequalities for Tensors via Einstein Products

A generalization of the Bernstein matrix concentration inequality to ran...
research
09/18/2020

Deviation bound for non-causal machine learning

Concentration inequality are widely used for analysing machines learning...

Please sign up or login with your details

Forgot password? Click here to reset