37 citations · 82 across the 8 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2021
GNMR: A provable one-line algorithm for low rank matrix recovery
Pini Zilber, Boaz Nadler
Low rank matrix recovery problems, including matrix completion and matrix sensing, appear in a broad range of applications. In this work we present GNMR -- an extremely simple iter…
math.OC2020★ 11 cited
Rank iterative least squares: efficient recovery of ill-conditioned low rank matrices from few entries
Jonathan Bauch, Boaz Nadler, Pini Zilber
We present a new, simple and computationally efficient iterative method for low rank matrix completion. Our method is inspired by the class of factorization-type iterative algorith…