Beyond Low-rankness: Guaranteed Matrix Recovery via Modified Nuclear Norm
Jiangjun Peng, Yisi Luo, Xiangyong Cao, Shuang Xu, and Deyu Meng

TL;DR
This paper proposes a modified nuclear norm framework that captures both local and global low-rank structures in matrix recovery, providing theoretical guarantees and improved performance over existing methods.
Contribution
Introduction of a flexible modified nuclear norm framework that guarantees exact recovery in matrix completion and Robust PCA without parameter tuning.
Findings
The MNN framework guarantees exact recovery under mild assumptions.
MNN captures both local and global information without trade-off parameters.
Experimental results show superior performance of MNN over existing methods.
Abstract
The nuclear norm (NN) has been widely explored in matrix recovery problems, such as Robust PCA and matrix completion, leveraging the inherent global low-rank structure of the data. In this study, we introduce a new modified nuclear norm (MNN) framework, where the MNN family norms are defined by adopting suitable transformations and performing the NN on the transformed matrix. The MNN framework offers two main advantages: (1) it jointly captures both local information and global low-rankness without requiring trade-off parameter tuning; (2) Under mild assumptions on the transformation, we provided exact theoretical recovery guarantees for both Robust PCA and MC tasks-an achievement not shared by existing methods that combine local and global information. Thanks to its general and flexible design, MNN can accommodate various proven transformations, enabling a unified and effective…
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
