mlsanityData to 14 Oct 2026

R3MC: A Riemannian three-factor algorithm for low-rank matrix completion

arXiv 1306.2672 ↗First posted 11 Jun 2013math.OC cs.LGcited by 11

Not on the map. Why?

Abstract (arXiv)

We exploit the versatile framework of Riemannian optimization on quotient manifolds to develop R3MC, a nonlinear conjugate-gradient method for low-rank matrix completion. The underlying search space of fixed-rank matrices is endowed with a novel Riemannian metric that is tailored to the least-squares cost. Numerical comparisons suggest that R3MC robustly outperforms state-of-the-art algorithms across different problem instances, especially those that combine scarcely sampled and ill-conditioned data.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). First posted on arXiv 11 Jun 2013.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 4; 2022: 1; 2023: 1; 2024: 2; 2025: 1; 2026: 2.

11 papers.