2025
RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees
NeurIPS 2025poster
Recovering a low rank matrix from a subset of its entries, some of which may be corrupted, is known as the robust matrix completion (RMC) problem. Existing RMC methods have several limitations: they require a relatively large number of observed entries; they may fail under overparametrization, wh…