Understanding alternating minimization for matrix completion

DOI10.1109/FOCS.2014.75MaRDI QIDQ6947196zbMATH OpenFDO

Authors Moritz Hardt

Publication date 5 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2014.75

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(6)

• Randomized approach to matrix completion: applications in recommendation systems and image inpainting
• Private low-rank approximation for covariance matrices, Dyson Brownian motion, and eigenvalue-gap bounds for Gaussian perturbations
• Robust Matrix Completion with Heavy-Tailed Noise
• Variable projection algorithms: theoretical insights and a novel approach for problems with large residual
• A learned proximal alternating minimization algorithm and its induced network for a class of two-block nonconvex and nonsmooth optimization
• LEARNER: a transfer learning method for low-rank matrix estimation

This page was built for publication: Understanding alternating minimization for matrix completion

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