Hong Shan

Robust Online Matrix Completion with Gaussian Mixture Model

In this paper, we study the problem of online matrix completion (MC) aiming to achieve robustness to the variations in both low-rank subspace and noises. In contrast to existing methods, we progressively fit a specific Gaussian Mixture Model (GMM) for noises at each time slot, which ensures the adap…