Matrix Completion under Low-Rank Missing Mechanism

DOI10.5705/ss.202019.0196OpenAlexW3106442442MaRDI QIDQ5037801

Xiaojun Mao, Song Xi Chen, Raymond K. W. Wong

Publication date: 4 March 2022

Published in: Statistica Sinica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.07813

zbMATH Keywords

regularizationmissinglow-ranknuclear-norm

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items (3)

Matrix completion under complex survey sampling ⋮ Robust Recommendation via Social Network Enhanced Matrix Completion ⋮ A Zero-imputation Approach in Recommendation Systems with Data Missing Heterogeneously

Uses Software

• softImpute

Cites Work

• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Matrix completion via max-norm constrained optimization
• Demystifying double robustness: a comparison of alternative strategies for estimating a population mean from incomplete data
• Estimation of high-dimensional low-rank matrices
• Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
• Noisy low-rank matrix completion with general sampling distribution
• Exact matrix completion via convex optimization
• A Singular Value Thresholding Algorithm for Matrix Completion
• Improving Semiparametric Estimation by Using Surrogate Data
• Adjusting for Nonignorable Drop-Out Using Semiparametric Nonresponse Models
• 1-Bit matrix completion
• Matrix Completion With Covariate Information
• A Simpler Approach to Matrix Completion
• Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent

This page was built for publication: Matrix Completion under Low-Rank Missing Mechanism