Matrix and Tensor Completion Algorithms
Prateek Jain, Raghunandan H. Keshavan, Andrea Montanari, and Sewoong Oh
Papers on Matrix/Tensor Completion
Theory
A Characterization of Deterministic Sampling Patterns for Low-Rank Matrix Completion, Daniel L. Pimentel-Alarcon, Nigel Boston, Robert D. Nowak, Mar 2015
A New Sampling Technique for Tensors, S. Bhojanapalli, S. Sanghavi, Feb 2015
Provable Tensor Factorization with Missing Data, P. Jain, S. Oh, June 2014
On Tensor Completion via Nuclear Norm Minimization, M. Yuan, C. Zhang , May 2014
Provable low-rank tensor recovery, B Huang, C Mu, D Goldfarb, J Wright, 2014
Square deal: Lower bounds and improved relaxations for tensor recovery, C Mu, B Huang, J Wright, D Goldfarb, July 2013
Low-rank Matrix Completion using Alternating Minimization, P. Jain, P. Netrapalli, S. Sanghavi, Dec 2012
Concentration-Based Guarantees for Low-Rank Matrix Reconstruction, R. Foygel, N. Srebro, Feb 2011
Robust Matrix Completion with Corrupted Columns, Y. Chen, H. Xu, C. Caramanis, S. Sanghavi, 2011
Regularization for Matrix Completion, R. Keshavan, A. Montanari, 2010 [Code]
Restricted strong convexity and weighted matrix completion: Optimal bounds with noise, S. Negahban, M. J. Wainwright, 2010
A Geometric Approach to Low-Rank Matrix Completion, W. Dai, E. Kerman, O. Milenkovic, 2010
Information Theoretic Bounds for Low-Rank Matrix Completion, S. Vishwanath, 2010
Estimation of High-Dimensional Low-Rank Matrices, A. Rohde, A. Tsybakov, 2009
Recovering low-rank matrices from few coefficients in any basis, D. Gross, 2009
A Simpler Approach to Matrix Completion, B. Recht, 2009
Matrix Completion from Noisy Entries, R.H. Keshavan, A. Montanari, S. Oh, 2009
Matrix completion with noise, E.J. Candes, Y. Plan, 2009
The power of convex relaxation: Near-optimal matrix completion, E.J. Candes, T. Tao, 2009
Matrix Completion from a Few Entries, R.H. Keshavan, A. Montanari, S. Oh, 2009
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory, A. Singer, M. Cucuringu, 2008
Matrix completion via convex optimization, E.J. Candes, B. Recht, 2008
Algorithms/Implementations
Decentralized matrix completion with gossiping, B. Mishra, H. Kasai, and A. Saroop, May 2016 Mishra, H. Kasai, and A. Saroop [code]
A Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorization, K. Huang, N. D. Sidiropoulos, A. P. Liavas, June 2015
Riemannian preconditioning for tensor completion, H. Kasai, B. Mishra, June 2015 [code]
Low-rank tensor completion by Riemannian optimization, D. Kressner, M. Steinlechner, B. Vandereycken, June 2014
Parallel matrix factorization for low-rank tensor completion, Y. Xu, R. Hao, W. Yin, Z. Su, Dec 2013
Manopt, a Matlab toolbox for optimization on manifolds, N. Boumal, B. Mishra, P.-A. Absil, R. Sepulchre, August 2013 [ManOpt]
Parallel Stochastic Gradient Algorithms for Large-Scale Matrix Completion, B. Recht, C. Re, Apr 2011 [Jellyfish-Code]
An Alternating Direction Algorithm for Matrix Completion with Nonnegative Factors, Y. Xu, W. Yin, Z. Wen, Y. Zhang, Mar 2011
Grassmann algorithms for low rank approximation of matrices with missing values, L. Simonsson, L. Eldén, 2010
Online Identification and Tracking of Subspaces from Highly Incomplete Information, L. Balzano, R. Nowak, B. Recht, 2010 [GROUSE-Code]
IMP: A Message-Passing Algorithmfor Matrix Completion, B. Kim, A. Yedla, H. D. Pfister, 2010
Solving A Low-Rank Factorization Model for Matrix Completion by A Nonlinear Successive Over-Relaxation Algorithm, Z. Wen, W. Yin, Y. Zhang, 2010 [LMaFit-Code]
A Gradient Descent Algorithm on the Grassman Manifold for Matrix Completion, R.H.Keshavan, S.Oh, 2009
Matrix Completion from Power-Law Distributed Samples, R. Meka, P. Jain, I.S. Dhillon, 2009
Guaranteed Rank Minimization via Singular Value Projection, R. Meka, P. Jain, I.S.Dhillon, 2009 [SVP-Code]
SET: an algorithm for consistent matrix completion, W. Dai, O. Milenkovic, 2009 [SET-Code]
An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems, K. Toh, S. Yun, 2009 [NNLS-Code]
Regularization methods for learning incomplete matrices, R. Mazumdar, T. Hastie, R. Tibshirani, 2009
Fixed point and Bregman iterative methods for matrix rank minimization, S. Ma, D. Goldfard, L. Chen, 2009 [FPCA-Code]
ADMiRA: Atomic Decomposition for Minimum Rank Approximation, K. Lee, Y. Bresler, 2009
A singular value thresholding algorithm for matrix completion, J-F Cai, E.J. Candes, Z. Shen, 2008 [SVT-Code]
Weighted low-rank approximations, N. Srebro, T. Jaakkola, 2003
|