R. Ahlswede and A. Winter, Strong converse for identification via quantum channels, IEEE Transactions on Information Theory, vol.48, issue.3, pp.569-679, 2002.
DOI : 10.1109/18.985947

A. Belloni, V. Chernozhukov, and L. Wang, Square-root lasso: pivotal recovery of sparse signals via conic programming, Biometrika, vol.98, issue.4, pp.791-806, 2011.
DOI : 10.1093/biomet/asr043

P. Buehlmann and S. Van-de-geer, Statistics for High-Dimensional Data: Methods, Theory and Applications, 2011.
DOI : 10.1007/978-3-642-20192-9

F. Bunea, Y. She, and M. Wegkamp, Optimal selection of reduced rank estimators of high-dimensional matrices, The Annals of Statistics, vol.39, issue.2, pp.1282-1309, 2011.
DOI : 10.1214/11-AOS876

E. J. Candès and Y. Plan, Matrix Completion With Noise, Proceedings of IEEE, pp.925-936, 2009.
DOI : 10.1109/JPROC.2009.2035722

E. J. Candès and B. Recht, Exact Matrix Completion via Convex Optimization, Foundations of Computational Mathematics, vol.170, issue.1, pp.717-772, 2009.
DOI : 10.1007/s10208-009-9045-5

E. J. Candès and T. Tao, The Power of Convex Relaxation: Near-Optimal Matrix Completion, IEEE Transactions on Information Theory, vol.56, issue.5, pp.2053-2080, 2009.
DOI : 10.1109/TIT.2010.2044061

R. Foygel, R. Salakhutdinov, O. Shamir, and N. Srebro, Learning with the Weighted Trace-norm under Arbitrary Sampling Distributions, Advances in Neural Information Processing Systems (NIPS), p.24, 2011.

S. Ga¨?ffasga¨?ffas and G. Lecué, Sharp Oracle Inequalities for High-Dimensional Matrix Prediction, IEEE Transactions on Information Theory, vol.57, issue.10, pp.6942-6957, 2010.
DOI : 10.1109/TIT.2011.2136318

D. Gross, Recovering Low-Rank Matrices From Few Coefficients in Any Basis, IEEE Transactions on Information Theory, vol.57, issue.3, pp.1548-1566, 2011.
DOI : 10.1109/TIT.2011.2104999

R. H. Keshavan, A. Montanari, and S. Oh, Matrix completion from noisy entries, Journal of Machine Learning Research, vol.11, pp.2057-2078, 2010.

R. H. Keshavan, A. Montanari, and S. Oh, Matrix Completion From a Few Entries, IEEE Transactions on Information Theory, vol.56, issue.6, pp.2980-2998, 2010.
DOI : 10.1109/TIT.2010.2046205

O. Klopp, Matrix completion with unknown variance of the noise, 2011.

O. Klopp, Rank penalized estimators for high-dimensional matrices, Electronic Journal of Statistics, vol.5, issue.0, pp.1161-1183, 2011.
DOI : 10.1214/11-EJS637
URL : https://hal.archives-ouvertes.fr/hal-00583884

V. Koltchinskii, A remark on low rank matrix recovery and noncommutative Bernstein type inequalities, IMS Collections, 2011.
DOI : 10.1214/12-IMSCOLL915

V. Koltchinskii, Oracle Inequalities in Empirical Risk Minimization and Sparse Recovery Problems. Ecole d'Eté de Probabilités de Saint-Flour XXXVIII-2008, 2011.

V. Koltchinskii, Von Neumann entropy penalization and low-rank matrix estimation, The Annals of Statistics, vol.39, issue.6, pp.2936-2973, 2011.
DOI : 10.1214/11-AOS926
URL : http://arxiv.org/abs/1009.2439

V. Koltchinskii, K. Lounici, and A. Tsybakov, Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion, The Annals of Statistics, vol.39, issue.5, pp.2302-2329, 2011.
DOI : 10.1214/11-AOS894
URL : https://hal.archives-ouvertes.fr/hal-00676868

K. Lounici, Optimal spectral norm rates for noisy low-rank matrix completion, 2011.

S. Negahban and M. J. Wainwright, Restricted strong convexity and weighted matrix completion: Optimal bounds with noise, 2010.

B. Recht, A simpler approach to matrix completion, Journal of Machine Learning Research, vol.12, pp.3413-3430, 2011.

A. Rohde and A. Tsybakov, Estimation of high-dimensional low-rank matrices, The Annals of Statistics, vol.39, issue.2, pp.887-930, 2011.
DOI : 10.1214/10-AOS860
URL : https://hal.archives-ouvertes.fr/hal-00606063

R. Salakhutdinov and N. Srebro, Collaborative Filtering in a Non- Uniform World: Learning with the Weighted Trace Norm, Advances in Neural Information Processing Systems (NIPS), p.23, 2010.

J. A. Tropp, User-Friendly Tail Bounds for Sums of Random Matrices, Foundations of Computational Mathematics, vol.16, issue.2, 2011.
DOI : 10.1007/s10208-011-9099-z