Matrix completion from a computational statistics perspective

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares
Reduced rank regression via adaptive nuclear norm penalization
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Matrix completion via max-norm constrained optimization
On tensor completion via nuclear norm minimization
Localization from incomplete noisy distance measurements
Fixed point and Bregman iterative methods for matrix rank minimization
Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
Max-norm optimization for robust matrix recovery
Positive definite completions of partial Hermitian matrices
Matrix completion by singular value thresholding: sharp bounds
A trace inequality of John von Neumann
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
Matrix completion discriminant analysis
Cross: efficient low-rank tensor completion
Proximal algorithms in statistics and machine learning
Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
Rank penalized estimators for high-dimensional matrices
Matrix estimation by universal singular value thresholding
Parallel stochastic gradient algorithms for large-scale matrix completion
Noisy low-rank matrix completion with general sampling distribution
Local minima and convergence in low-rank semidefinite programming
Fast singular value thresholding without singular value decomposition
Singular value decomposition and least squares solutions
The approximation of one matrix by another of lower rank.
Exact matrix completion via convex optimization
Completing Any Low-rank Matrix, Provably
Robust Low-Rank Tensor Recovery: Models and Algorithms
A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion
An Extended Frank--Wolfe Method with “In-Face” Directions, and Its Application to Low-Rank Matrix Completion
Guaranteed Matrix Completion via Non-Convex Factorization
A Singular Value Thresholding Algorithm for Matrix Completion
Tensor completion and low-n-rank tensor recovery via convex optimization
Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning
Sampling from large matrices
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Inference and missing data
On the Early History of the Singular Value Decomposition
The Fundamental Theorem of Linear Algebra
Incoherent Tensor Norms and Their Applications in Higher Order Tensor Completion
Sparse Reconstruction by Separable Approximation
An iterative hard thresholding estimator for low rank matrix recovery with explicit limiting distribution
High-Dimensional Probability
Regularized Matrix Regression
1-Bit matrix completion
Recovering Low-Rank Matrices From Few Coefficients in Any Basis
Matrix Completion From a Few Entries
The Power of Convex Relaxation: Near-Optimal Matrix Completion
A Simpler Approach to Matrix Completion
Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
Signal Recovery by Proximal Forward-Backward Splitting
Low-rank matrix completion using alternating minimization
Calculating the Singular Values and Pseudo-Inverse of a Matrix
Statistical significance of the Netflix challenge

This page was built for publication: Matrix completion from a computational statistics perspective