← Core Methods
Machine Learning › Core Methods ›

Matrix Completion

103 directly classified papers

Papers per year

Papers

Error-Minimizing Estimates and Universal Entry-Wise Error Bounds for Low-Rank Matrix Completion NIPS 2013
Exact and Stable Recovery of Pairwise Interaction Tensors NIPS 2013
Generalizing Analytic Shrinkage for Arbitrary Covariance Structures NIPS 2013
A New Convex Relaxation for Tensor Completion NIPS 2013
Low-Rank Matrix and Tensor Completion via Adaptive Sampling NIPS 2013
Low-rank matrix reconstruction and clustering via approximate message passing NIPS 2013
Probabilistic Low-Rank Matrix Completion with Adaptive Spectral Regularization Algorithms NIPS 2013
Matrix Completion From any Given Set of Observations NIPS 2013
Spectral Learning of General Weighted Automata via Constrained Matrix Completion NIPS 2012
Scaled Gradients on Grassmann Manifolds for Matrix Completion NIPS 2012
Finding Exemplars from Pairwise Dissimilarities via Simultaneous Sparse Recovery NIPS 2012
Matrix reconstruction with the local max norm NIPS 2012
Calibrated Elastic Regularization in Matrix Completion NIPS 2012
Matrix Completion for Multi-label Image Classification NIPS 2011
A Denoising View of Matrix Completion NIPS 2011
RTRMC: A Riemannian trust-region method for low-rank matrix completion NIPS 2011
Learning Eigenvectors for Free NIPS 2011
SpaRCS: Recovering low-rank and sparse matrices from compressive measurements NIPS 2011
Universal low-rank matrix recovery from Pauli measurements NIPS 2011
Transduction with Matrix Completion: Three Birds with One Stone NIPS 2010
Online Learning in The Manifold of Low-Rank Matrices NIPS 2010
Collaborative Filtering in a Non-Uniform World: Learning with the Weighted Trace Norm NIPS 2010
Latent Variable Models for Predicting File Dependencies in Large-Scale Software Development NIPS 2010
Guaranteed Rank Minimization via Singular Value Projection NIPS 2010
Link Discovery using Graph Feature Tracking NIPS 2010