A remark on low rank matrix recovery and noncommutative Bernstein type inequalities

[1]  E. Lieb.  Convex trace functions and the Wigner-Yanase-Dyson conjecture , 1973 .

[2]  J. Aubin,et al.  Applied Nonlinear Analysis , 1984 .

[3]  G. Watson.  Characterization of the subdifferential of some matrix norms , 1992 .

[4]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

[5]  Rudolf Ahlswede,et al.  Strong converse for identification via quantum channels , 2000, IEEE Trans. Inf. Theory.

[6]  L. Artiles,et al.  An invitation to quantum tomography , 2003, quant-ph/0303020.

[7]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2009, Found. Comput. Math..

[8]  Stephen Becker,et al.  Quantum state tomography via compressed sensing. , 2009, Physical review letters.

[9]  V. Koltchinskii,et al.  Nuclear norm penalization and optimal rates for noisy low rank matrix completion , 2010, 1011.6256.

[10]  V. Koltchinskii.  Von Neumann Entropy Penalization and Low Rank Matrix Estimation , 2010, 1009.2439.

[11]  A. Tsybakov,et al.  Estimation of high-dimensional low-rank matrices , 2009, 0912.5338.

[12]  Emmanuel J. Candès,et al.  The Power of Convex Relaxation: Near-Optimal Matrix Completion , 2009, IEEE Transactions on Information Theory.

[13]  Emmanuel J. Candès,et al.  Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements , 2010, ArXiv.

[14]  V. Koltchinskii,et al.  Oracle inequalities in empirical risk minimization and sparse recovery problems , 2011 .

[15]  David Gross,et al.  Recovering Low-Rank Matrices From Few Coefficients in Any Basis , 2009, IEEE Transactions on Information Theory.

[16]  Benjamin Recht,et al.  A Simpler Approach to Matrix Completion , 2009, J. Mach. Learn. Res..

[17]  Joel A. Tropp,et al.  User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..