GNMR: A provable one-line algorithm for low rank matrix recovery

v1v2v3 (latest)

GNMR: A provable one-line algorithm for low rank matrix recovery

24 June 2021

ArXiv (abs)PDF HTML

Papers citing "GNMR: A provable one-line algorithm for low rank matrix recovery"

7 / 7 papers shown

Title
RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees Eilon Vaknin Laufer Boaz Nadler 143 0 0 19 May 2025
Truncated Matrix Completion - An Empirical Study Rishhabh Naik Nisarg Trivedi Davoud Ataee Tarzanagh Laura Balzano 251 3 0 14 Apr 2025
Non-convex matrix sensing: Breaking the quadratic rank barrier in the sample complexity Dominik Stoger Yizhe Zhu 217 4 0 20 Aug 2024
Symmetric Matrix Completion with ReLU Sampling Huikang Liu Peng Wang Longxiu Huang Qing Qu Laura Balzano 117 3 0 09 Jun 2024
A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix Completion Xiaoqian Liu Xu Han Eric C. Chi B. Nadler 109 0 0 27 Apr 2023
Learning Transition Operators From Sparse Space-Time Samples C. Kümmerle Mauro Maggioni Sui Tang 87 1 0 01 Dec 2022
Inductive Matrix Completion: No Bad Local Minima and a Fast Algorithm Pini Zilber B. Nadler 107 8 0 31 Jan 2022