We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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 iterative algorithm for low rank matrix recovery, based on a Gauss-Newton linearization. On the theoretical front, we derive recovery guarantees for GNMR in both the matrix sensing and matrix completion settings. Some of these results improve upon the best currently known for other methods. A key property of GNMR is that it implicitly keeps the factor matrices approximately balanced throughout its iterations. On the empirical front, we show that for matrix completion with uniform sampling, GNMR performs better than several popular methods, especially when given very few observations close to the information limit.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2106.12933")
get_code_for_paper("2106.12933")
have("2106.12933")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2106.12933.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2106.12933)
Connect an agent — have() is free.