Fetching the paper…
Reading the bibliography…
In the present paper we study the problem of existence of honest and adaptive confidence sets for matrix completion.
Using collaborative filtering to weave an information tapestry
D. Goldberg, D. Nichols, B. M. Oki, and D. Terry. (1992) · 1992
Earlier work this paper cites.
New concentration inequalities in product spaces
M. Talagrand. (1996) · 1996
Earlier work this paper cites.
On nonparametric confidence intervals
M. G. Low. (1997) · 1997
Earlier work this paper cites.
Confidence balls in Gaussian regression
Y. Baraud. (2004) · 2004
Earlier work this paper cites.
An adaptation theory for nonparametric confidence intervals
T. T. Cai and M. G. Low. (2004) · 2004
Earlier work this paper cites.
Nonparametric confidence set estimation
A. Juditsky and S. Lambert-Lacroix. (2004) · 2004
Earlier work this paper cites.
Semidefinite programming based algorithms for sensor network localization
P. Biswas, T. Liang, T. Wang, and Y. Ye. (2006) · 2006
Earlier work this paper cites.
The netflix prize
J. Bennett and S. Lanning. (2007) · 2007
Earlier work this paper cites.
Adaptive nonparametric confidence sets
J. Robins and A. W. van der Vaart. (2007) · 2007
Earlier work this paper cites.
A remark on global positioning from local distances
A. Singer. (2008) · 2008
Earlier work this paper cites.
Exact matrix completion via convex optimization
E. J. Candès and B. Recht. (2009) · 2009
Earlier work this paper cites.
Matrix completion with noise
Candès, E. J. and Plan, Y. (2009) · 2009
Earlier work this paper cites.
Confidence bands in density estimation
E. Giné and R. Nickl. (2010) · 2010
Earlier work this paper cites.
Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements
E. J. Candès and Y. Plan. (2011) · 2011
Cited alongside, same era.
Recovering low-rank matrices from few coefficients in any basis
D. Gross. (2011) · 2011
Cited alongside, same era.
On adaptive inference and confidence bands
M. Hoffmann and R. Nickl. (2011) · 2011
Cited alongside, same era.
Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
V. Koltchinskii, K. Lounici, and A. B. Tsybakov. (2011) · 2011
Cited alongside, same era.
A simpler approach to matrix completion
B. Recht. (2011) · 2011
Cited alongside, same era.
Estimation of high-dimensional low-rank matrices
A. Rohde and A. Tsybakov. (2011) · 2011
Cited alongside, same era.
Noisy low-rank matrix completion with general sampling distribution
O. Klopp. (2014) · 2014
Later among the works it cites.
A. Carpentier, J. Eisert, D. Gross, and R. Nickl. (2015) · 2015
Later among the works it cites.
On signal detection and confidence sets for low rank inference problems
A. Carpentier and R. Nickl. (2015) · 2015
Later among the works it cites.
Matrix estimation by universal singular value thresholding
S. Chatterjee. (2015) · 2015
Later among the works it cites.
Matrix completion by singular value thresholding: sharp bounds
O. Klopp. (2015) · 2015
Later among the works it cites.
Frequentist coverage of adaptive nonparametric Bayesian credible sets
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
S. Negahban and M. J. Wainwright. (2012) · 2012
Cited alongside, same era.
Concentration inequalities
S. Boucheron, G. Lugosi and P. Massart. (2013) · 2013
Cited alongside, same era.
Adaptive confidence sets in L 2 L^{2}
A. D. Bull and R. Nickl. (2013) · 2013
Cited alongside, same era.
Honest and adaptive confidence sets in L p L^{p}
A. Carpentier. (2013) · 2013
Cited alongside, same era.
Genotype imputation via matrix completion
E. C. Chi, H. Zhou, G.K. Chen, D.O. Del Vecchyo and K. Lange. (2013) · 2013
Cited alongside, same era.
Low-rank matrix completion using alternating minimization
P. Jain, P. Netrapalli and S. Sanghavi. (2013) · 2013
Cited alongside, same era.
B. Szabó, A. van der Vaart and H. van Zanten (2015) · 2015
Later among the works it cites.
Sharp nonasymptotic bounds on the norm of random matrices with independent entries
A. S. Bandeira and R. van Handel. (2016) · 2016
Closest in time.
Accuracy assessment for high-dimensional linear regression. http://arxiv.org/abs/1603.03474
T. T. Cai and Z. Guo. (2016) · 2016
Closest in time.
Matrix completion via max-norm constrained optimization
T. T. Cai and W. Zhou. (2016) · 2016
Closest in time.
Mathematical Foundations of Infinite-Dimensional Statistical Methods
E. Giné and R. Nickl. (2016) · 2016
Closest in time.
A sharp adaptive confidence ball for self-similar functions
R. Nickl and B. Szabó (2016) · 2016
Closest in time.
Matrix completion from noisy entries
R. H. Keshavan, A. Montanari, and S. Oh. (2010) · 2078
Closest in time.
The power of convex relaxation: near-optimal matrix completion
E. J. Candès and T. Tao. (2010) · 2080
Closest in time.