Matrix Completion From any Given Set of Observations

By Troy Lee, Adi Shraibman. 2013

27 citations recorded by the source corpus.

Subfields: Statistical Learning Theory, Mathematical Optimization

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Statistical Learning Theory

1. Yuanzhi Li
2. Yingyu Liang
3. Srinadh Bhojanapalli
4. Prateek Jain
5. Zeyuan Allen-Zhu
6. Samet Oymak
7. Jason D. Lee
8. M. Soltanolkotabi

In Mathematical Optimization

1. Srinadh Bhojanapalli
2. Yuanzhi Li
3. Yingyu Liang
4. Andrej Risteski
5. Prateek Jain
6. Ruoyu Sun
7. Zhi-Quan Tom Luo
8. Zeyuan Allen-Zhu

Citations in the corpus

• Recovery guarantee of weighted low-rank approximation via alternating minimization (2016, background): “The full details are included in the appendix.”
• Universal Matrix Completion (2014, methodology): “Our second results shows that if M satisfies both A 1 and A 2, then using nuclear-norm minimization based method, P Ω ( M ) can be used to recover back M exactly.”