Robust Matrix Regression
Hang Zhang, Fengyuan Zhu, Shixin Li

TL;DR
This paper introduces a robust matrix regression method that effectively handles noisy data in matrix-structured datasets, maintaining data integrity and achieving state-of-the-art results in real-world applications.
Contribution
The paper proposes a novel robust matrix regression approach with efficient algorithms, addressing noise contamination in training data and improving performance over existing methods.
Findings
Achieves state-of-the-art performance on real-world datasets
Effectively handles noisy and contaminated training data
Demonstrates practical value through comparative studies
Abstract
Modern technologies are producing datasets with complex intrinsic structures, and they can be naturally represented as matrices instead of vectors. To preserve the latent data structures during processing, modern regression approaches incorporate the low-rank property to the model and achieve satisfactory performance for certain applications. These approaches all assume that both predictors and labels for each pair of data within the training set are accurate. However, in real-world applications, it is common to see the training data contaminated by noises, which can affect the robustness of these matrix regression methods. In this paper, we address this issue by introducing a novel robust matrix regression method. We also derive efficient proximal algorithms for model training. To evaluate the performance of our methods, we apply it to real world applications with comparative studies.…
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 · Face and Expression Recognition · Machine Learning and ELM
