ADMM algorithms for matrix completion problem in noisy settings
Matrix completion (MC) is a fundamental linear algebra problem to fully recover a low-rank matrix from its incomplete data. It is widely applied in machine learning and statistics, varied from wireless communication, image compression to collaborative filtering. Meanwhile, Alternating Direction Meth...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | Final Year Project |
| اللغة: | English |
| منشور في: |
Nanyang Technological University
2021
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://hdl.handle.net/10356/148502 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | Matrix completion (MC) is a fundamental linear algebra problem to fully recover a low-rank matrix from its incomplete data. It is widely applied in machine learning and statistics, varied from wireless communication, image compression to collaborative filtering. Meanwhile, Alternating Direction Method of Multiplier is a straightforward but effective algorithm for distributed convex optimization. In this work, we will study ADMM in application to matrix completion problem in the noisy setting. Two modified algorithms for noisy matrix completion problem are proposed. Convergence results of these algorithms will be discussed and numerical experiments are conducted to examine the performance of the new algorithms. |
|---|