A. S. Bandeira and R. Van-handel, Sharp nonasymptotic bounds on the norm of random matrices with independent entries, The Annals of Probability, vol.44, issue.4, pp.2479-2506, 2016.
DOI : 10.1214/15-AOP1025

Y. Baraud, Confidence balls in Gaussian regression, The Annals of Statistics, vol.32, issue.2, pp.528-551, 2004.
DOI : 10.1214/009053604000000085
URL : https://hal.archives-ouvertes.fr/hal-00012909

J. Bennett and S. Lanning, The netflix prize, Proceedings of KDD Cup and Workshop, 2007.

P. Biswas, T. Liang, T. Wang, and Y. Ye, Semidefinite programming based algorithms for sensor network localization, ACM Transactions on Sensor Networks, vol.2, issue.2, pp.188-220, 2006.
DOI : 10.1145/1149283.1149286
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.1023

S. Boucheron, G. Lugosi, and P. Massart, Concentration Inequalities, 2013.
DOI : 10.1007/978-1-4757-2440-0
URL : https://hal.archives-ouvertes.fr/hal-00751496

A. D. Bull and R. Nickl, Adaptive confidence sets in L 2 . Probab. Theory Related Fields, pp.889-919, 2013.
DOI : 10.1007/s00440-012-0446-z
URL : http://arxiv.org/abs/1111.5568

T. T. Cai and M. G. Low, An adaptation theory for nonparametric confidence intervals, Ann. Statist, vol.32, issue.5, pp.1805-1840, 2004.

T. T. Cai and Z. Guo, Accuracy assessment for high-dimensional linear regression, 2016.

T. T. Cai and W. Zhou, Matrix completion via max-norm constrained optimization, Electronic Journal of Statistics, vol.10, issue.1, pp.1493-1525, 2016.
DOI : 10.1214/16-EJS1147
URL : http://arxiv.org/abs/1303.0341

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, 2010.
DOI : 10.1109/TIT.2010.2044061

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 Y. Plan, Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements, IEEE Transactions on Information Theory, vol.57, issue.4, pp.2342-2359, 2011.
DOI : 10.1109/TIT.2011.2111771

A. Carpentier, Honest and adaptive confidence sets in L p . Electron, J. Statist, vol.7, pp.2875-2923, 2013.

A. Carpentier, J. Eisert, D. Gross, and R. Nickl, Uncertainty Quantification for Matrix Compressed Sensing and Quantum Tomography Problems, 2015.

A. Carpentier and R. Nickl, On signal detection and confidence sets for low rank inference problems, Electronic Journal of Statistics, vol.9, issue.2, pp.2675-2688, 2015.
DOI : 10.1214/15-EJS1087

S. Chatterjee, Matrix estimation by Universal Singular Value Thresholding, The Annals of Statistics, vol.43, issue.1, pp.177-214, 2015.
DOI : 10.1214/14-AOS1272
URL : http://arxiv.org/abs/1212.1247

E. C. Chi, H. Zhou, G. K. Chen, D. O. Vecchyo, and K. Lange, Genotype imputation via matrix completion, Genome Research, vol.23, issue.3, pp.509-518, 2013.
DOI : 10.1101/gr.145821.112
URL : http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3589539

E. Giné and R. Nickl, Confidence bands in density estimation, The Annals of Statistics, vol.38, issue.2, pp.1122-1170, 2010.
DOI : 10.1214/09-AOS738

E. Giné and R. Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Methods, 2016.

D. Goldberg, D. Nichols, B. M. Oki, and D. Terry, Using collaborative filtering to weave an information tapestry, Communications of the ACM, vol.35, issue.12, pp.61-70, 1992.
DOI : 10.1145/138859.138867
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.3739

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

M. Hoffmann and R. Nickl, On adaptive inference and confidence bands, The Annals of Statistics, vol.39, issue.5, pp.2383-2409, 2011.
DOI : 10.1214/11-AOS903
URL : https://hal.archives-ouvertes.fr/hal-00692981

P. Jain, P. Netrapalli, and S. Sanghavi, Low-rank matrix completion using alternating minimization, Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, STOC '13, pp.665-674, 2013.
DOI : 10.1145/2488608.2488693
URL : http://arxiv.org/abs/1212.0467

A. Juditsky and S. Lambert-lacroix, Nonparametric confidence set estimation, Math. Methods Statist, vol.12, issue.4, pp.410-428, 2004.

R. H. Keshavan, A. Montanari, and S. Oh, Matrix completion from noisy entries, J. Mach. Learn. Res, vol.11, pp.2057-2078, 2010.
DOI : 10.1109/isit.2009.5205567
URL : http://arxiv.org/abs/0901.3150

O. Klopp, Noisy low-rank matrix completion with general sampling distribution, Bernoulli, vol.20, issue.1, pp.282-303, 2014.
DOI : 10.3150/12-BEJ486
URL : https://hal.archives-ouvertes.fr/hal-00675413

O. Klopp, Matrix completion by singular value thresholding: Sharp bounds, Electronic Journal of Statistics, vol.9, issue.2, pp.2348-2369, 2015.
DOI : 10.1214/15-EJS1076
URL : https://hal.archives-ouvertes.fr/hal-01111757

V. Koltchinskii, K. Lounici, and A. B. 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

M. G. Low, On nonparametric confidence intervals, The Annals of Statistics, vol.25, issue.6, pp.2547-2554, 1997.
DOI : 10.1214/aos/1030741084

S. Negahban and M. J. Wainwright, Restricted strong convexity and weighted matrix completion: Optimal bounds with noise, J. Mach. Learn. Res, vol.13, pp.1665-1697, 2012.

R. Nickl and B. Szabó, A sharp adaptive confidence ball for self-similar functions. Stochastic Process, Appl, vol.126, issue.12, pp.3913-3934, 2016.
DOI : 10.1016/j.spa.2016.04.017
URL : http://arxiv.org/abs/1406.3994

R. Nickl and S. Van-de-geer, Confidence sets in sparse regression, The Annals of Statistics, vol.41, issue.6, pp.2852-2876, 2013.
DOI : 10.1214/13-AOS1170
URL : http://arxiv.org/abs/1209.1508

B. Recht, A simpler approach to matrix completion, J. Mach. Learn. Res, vol.12, pp.3413-3430, 2011.

J. Robins and A. W. Van-der-vaart, Adaptive nonparametric confidence sets, The Annals of Statistics, vol.34, issue.1, pp.229-253, 2007.
DOI : 10.1214/009053605000000877
URL : http://arxiv.org/abs/math/0605473

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

A. Singer, A remark on global positioning from local distances, Proceedings of the National Academy of Sciences, vol.105, issue.28, pp.9507-9511, 2008.
DOI : 10.1073/pnas.0709842104

B. Szabó, A. Van-der-vaart, and H. Van-zanten, Frequentist coverage of adaptive nonparametric Bayesian credible sets, The Annals of Statistics, vol.43, issue.4, pp.1391-1428, 2015.
DOI : 10.1214/14-AOS1270

M. Talagrand, New concentration inequalities in product spaces, Inventiones Mathematicae, vol.126, issue.3, pp.505-563, 1996.
DOI : 10.1007/s002220050108