← Core Methods
Machine Learning › Core Methods ›

Matrix Completion

103 directly classified papers

Papers per year

Papers

Provable Efficient Online Matrix Completion via Non-convex Stochastic Gradient Descent NIPS 2016
Dynamic matrix recovery from incomplete observations under an exact low-rank constraint NIPS 2016
Matrix Completion has No Spurious Local Minimum NIPS 2016
High-Rank Matrix Completion and Clustering under Self-Expressive Models NIPS 2016
Regularization-Free Estimation in Trace Regression with Symmetric Positive Semidefinite Matrices NIPS 2015
Matrix Completion from Fewer Entries: Spectral Detectability and Rank Estimation NIPS 2015
Estimating Jaccard Index with Missing Observations: A Matrix Calibration Approach NIPS 2015
Robust PCA with compressed data NIPS 2015
Matrix Completion Under Monotonic Single Index Models NIPS 2015
Collaborative Filtering with Graph Information: Consistency and Scalable Methods NIPS 2015
Functional Correspondence by Matrix Completion CVPR 2015
Pushing the Limits of Affine Rank Minimization by Adapting Probabilistic PCA ICML 2015
Matrix Completion for Resolving Label Ambiguity CVPR 2015
FaLRR: A Fast Low Rank Representation Solver CVPR 2015
Matrix Completion with Noisy Side Information NIPS 2015
Analysis of Robust PCA via Local Incoherence NIPS 2015
Unified View of Matrix Completion under General Structural Constraints NIPS 2015
Generalized Nonconvex Nonsmooth Low-Rank Minimization CVPR 2014
Probabilistic low-rank matrix completion on finite alphabets NIPS 2014
Efficient Structured Matrix Rank Minimization NIPS 2014
Extracting Certainty from Uncertainty: Transductive Pairwise Classification from Pairwise Similarities NIPS 2014
Deterministic Symmetric Positive Semidefinite Matrix Completion NIPS 2014
DFacTo: Distributed Factorization of Tensors NIPS 2014
General Table Completion using a Bayesian Nonparametric Model NIPS 2014
Depth Enhancement via Low-rank Matrix Completion CVPR 2014