scientific article; zbMATH DE number 7164697

MaRDI QIDQ5214181zbMATH OpenFDO

Authors Tianbao Yang, Rong Jin, Zhi-Hua Zhou, Lijun Zhang

Publication date 7 February 2020

Full work available at URL http://jmlr.csail.mit.edu/papers/v20/15-504.html

zbMATH Keywords

full-rankleast squareslow-rankmatrix completionnuclear norm regularizationrelative error bound

Mathematics Subject Classification ID

Matrix completion problems (15A83) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Recommendations

• Nuclear norm regularization with a low-rank constraint for matrix completion
• Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
• Linear total variation approximate regularized nuclear norm optimization for matrix completion
• A Truncated Nuclear Norm Regularization Method Based on Weighted Residual Error for Matrix Completion
• Nuclear norm and indicator function model for matrix completion
• Relative errors for deterministic low-rank matrix approximations
• scientific article; zbMATH DE number 1424532
• Low-rank matrix recovery via regularized nuclear norm minimization
• On tensor completion via nuclear norm minimization
• On the nuclear norm heuristic for a Hankel matrix completion problem

Cites work

• A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion
• A simpler approach to matrix completion
• Adaptive estimation of a quadratic functional by model selection.
• An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
• An improved approximation algorithm for the column subset selection problem
• Clustering partially observed graphs via convex optimization
• Completing any low-rank matrix, provably
• Compressed sensing and best \(k\)-term approximation
• Distributed matrix completion and robust factorization
• Exact matrix completion via convex optimization
• Gradient methods for minimizing composite functions
• Guaranteed Matrix Completion via Non-Convex Factorization
• scientific article; zbMATH DE number 7164697 (Why is no real title available?)
• Matrix Completion From a Few Entries
• Matrix completion from noisy entries
• Noisy low-rank matrix completion with general sampling distribution
• Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• Restricted strong convexity and weighted matrix completion: optimal bounds with noise
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Trace norm regularization: reformulations, algorithms, and multi-task learning

Cited in

(5)

• Matrix completion with the trace norm: learning, bounding, and transducing
• Nuclear norm regularization with a low-rank constraint for matrix completion
• A Truncated Nuclear Norm Regularization Method Based on Weighted Residual Error for Matrix Completion
• scientific article; zbMATH DE number 7164697 (Why is no real title available?)
• Universal online convex optimization meets second-order bounds

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5214181)