Fetching the paper…
Reading the bibliography…
The noisy matrix completion problem, which aims to recover a low-rank matrix $\mathbf{X}$ from a partial, noisy observation of its entries, arises in many statistical, machine learning, and engineering applications.
The Design of Experiments
Fisher, R. A · 1937
Earlier work this paper cites.
Maximum entropy sampling
Shewry, M. C. and Wynn, H. P · 1987
Earlier work this paper cites.
Information-based objective functions for active data selection
MacKay, D. J · 1992
Earlier work this paper cites.
Learning binary relations using weighted majority voting
Goldman, S. A. and Warmuth, M. K · 1995
Earlier work this paper cites.
Generating uniformly distributed random Latin squares
Jacobson, M. T. and Matthews, P · 1996
Earlier work this paper cites.
Matrix Variate Distributions
Gupta, A. K. and Nagar, D. K · 1999
Earlier work this paper cites.
Eigentaste: A constant time collaborative filtering algorithm
Goldberg, K., Roeder, T., Gupta, D., and Perkins, C · 2001
Earlier work this paper cites.
On the singular values of Gaussian random matrices
Shen, J · 2001
Earlier work this paper cites.
Online learning of binary and n-ary relations over clustered domains
Nakamura, A. and Abe, N · 2002
Earlier work this paper cites.
Permutation arrays for powerline communication and mutually orthogonal Latin squares
Colbourn, C. J., Klove, T., and Ling, A. C · 2004
Earlier work this paper cites.
Powerline communication and the 36 officers problem
Huczynska, S · 2006
Earlier work this paper cites.
Gradient of mutual information in linear vector Gaussian channels
Palomar, D. P. and Verdú, S · 2006
Earlier work this paper cites.
Exact matrix completion via convex optimization
Candès, E. and Recht, B · 2009
Cited alongside, same era.
Simulation of the matrix Bingham–von Mises–Fisher distribution, with applications to multivariate and relational data
Hoff, P. D · 2009
Cited alongside, same era.
Matrix completion with noise
Candès, E. J. and Plan, Y · 2010
Cited alongside, same era.
The power of convex relaxation: Near-optimal matrix completion
Candès, E. J. and Tao, T · 2010
Cited alongside, same era.
Matrix completion from a few entries
Keshavan, R. H., Montanari, A., and Oh, S · 2010
Cited alongside, same era.
Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
Koltchinskii, V., Lounici, K., Tsybakov, A. B., et al · 2011
Cited alongside, same era.
Bayesian Data Analysis , volume 2
Gelman, A., Carlin, J. B., Stern, H. S., Dunson, D. B., Vehtari, A., and Rubin, D. B · 2014
Later among the works it cites.
Inductive matrix completion for predicting gene–disease associations
Natarajan, N. and Dhillon, I. S · 2014
Later among the works it cites.
Nonlinear information-theoretic compressive measurement design
Wang, L., Razi, A., Rodrigues, M., Calderbank, R., and Carin, L · 2014
Later among the works it cites.
Latin Squares and Their Applications
Keedwell, A. D. and Dénes, J · 2015
Later among the works it cites.
Matrix completion with queries
Ruchansky, N., Crovella, M., and Terzi, E · 2015
Later among the works it cites.
An overview of low-rank matrix recovery from incomplete observations
Davenport, M. A. and Romberg, J · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A simpler approach to matrix completion
Recht, B · 2011
Cited alongside, same era.
Communications-inspired projection design with application to compressive sensing
Carson, W. R., Chen, M., Rodrigues, M. R., Calderbank, R., and Carin, L · 2012
Cited alongside, same era.
Statistics on Special Manifolds
Chikuse, Y · 2012
Cited alongside, same era.
Elements of Information Theory
Cover, T. M. and Thomas, J. A · 2012
Cited alongside, same era.
Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
Negahban, S. and Wainwright, M. J · 2012
Cited alongside, same era.
Active learning and search on low-rank matrices
Sutherland, D. J., Póczos, B., and Schneider, J · 2013
Cited alongside, same era.
A disagreement-based active matrix completion approach with provable guarantee
Lan, C., Deng, Y., and Huan, J · 2016
Later among the works it cites.
Active positive semidefinite matrix completion: Algorithms, theory and applications
Bhargava, A., Ganti, R., and Nowak, R · 2017
Closest in time.
Measurement matrix design for phase retrieval based on mutual information
Shlezinger, N., Dabora, R., and Eldar, Y. C · 2017
Closest in time.
Maximum entropy low-rank matrix recovery
Mak, S. and Xie, Y · 2018
Closest in time.
Nonconvex optimization meets low-rank matrix factorization: An overview
Chi, Y., Lu, Y. M., and Chen, Y · 2019
Closest in time.
Bayesian uncertainty quantification for low-rank matrix completion
Yuchi, H. S., Mak, S., and Xie, Y · 2021
Closest in time.