Note on sampling without replacing from a finite collection of matrices
read the original abstract
This technical note supplies an affirmative answer to a question raised in a recent pre-print [arXiv:0910.1879] in the context of a "matrix recovery" problem. Assume one samples m Hermitian matrices X_1, ..., X_m with replacement from a finite collection. The deviation of the sum X_1+...+X_m from its expected value in terms of the operator norm can be estimated by an "operator Chernoff-bound" due to Ahlswede and Winter. The question arose whether the bounds obtained this way continue to hold if the matrices are sampled without replacement. We remark that a positive answer is implied by a classical argument by Hoeffding. Some consequences for the matrix recovery problem are sketched.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness
Riemannian gradient descent on rank-r Gram matrices for EDMC achieves linear convergence with high probability for sampling probability p ≥ O(ν² r² log(n)/n) and a hard-thresholding initialization under a weaker rate.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.