scientific article; zbMATH DE number 7164697

zbMath1440.65053MaRDI QIDQ5214181

Tianbao Yang, Rong Jin, Zhi-Hua Zhou, Li-jun Zhang

Publication date: 7 February 2020

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

matrix completionleast squaresnuclear norm regularizationlow-rankrelative error boundfull-rank

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gradient methods for minimizing composite functions
• Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
• Adaptive estimation of a quadratic functional by model selection.
• Noisy low-rank matrix completion with general sampling distribution
• Exact matrix completion via convex optimization
• Completing Any Low-rank Matrix, Provably
• A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion
• Guaranteed Matrix Completion via Non-Convex Factorization
• Compressed sensing and best 𝑘-term approximation
• Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning
• 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
• Distributed Matrix Completion and Robust Factorization

This page was built for publication: