Leveraged Matrix Completion with Noise
Xinjian Huang, Weiwei Liu, Bo Du, Dacheng Tao

TL;DR
This paper introduces a leverage score-based sampling method for low-rank matrix completion that relaxes previous restrictive assumptions and achieves near-optimal recovery with noisy data.
Contribution
It proposes a novel biased sampling approach using leverage scores and a new proof technique, improving theoretical guarantees for noisy matrix completion.
Findings
Achieves matrix recovery with approximately O(n r log^2 n) samples.
Works under relaxed assumptions without requiring incoherence.
Empirical results confirm theoretical predictions.
Abstract
Completing low-rank matrices from subsampled measurements has received much attention in the past decade. Existing works indicate that datums are required to theoretically secure the completion of an noisy matrix of rank with high probability, under some quite restrictive assumptions: (1) the underlying matrix must be incoherent; (2) observations follow the uniform distribution. The restrictiveness is partially due to ignoring the roles of the leverage score and the oracle information of each element. In this paper, we employ the leverage scores to characterize the importance of each element and significantly relax assumptions to: (1) not any other structure assumptions are imposed on the underlying low-rank matrix; (2) elements being observed are appropriately dependent on their importance via the leverage score. Under these assumptions,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Blind Source Separation Techniques · Medical Image Segmentation Techniques
