Dimension-free tail inequalities for sums of random matrices

Details Dimension-free tail inequalities for sums of random matrices Dimension-free tail inequalities for sums of random matrices

2011-04-09

arxiv.org/abs/1104.1672v3

Mathematics

Probability

Scientific paper

We derive exponential tail inequalities for sums of random matrices with no dependence on the explicit matrix dimensions. These are similar to the matrix versions of the Chernoff bound and Bernstein inequality except with the explicit matrix dimensions replaced by a trace quantity that can be small even when the dimension is large or infinite. Some applications to principal component analysis and approximate matrix multiplication are given to illustrate the utility of the new bounds.

Affiliated with

Also associated with

No associations

Rating

Dimension-free tail inequalities for sums of random matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dimension-free tail inequalities for sums of random matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dimension-free tail inequalities for sums of random matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-353167