Noisy $\ell^{0}$-Sparse Subspace Clustering on Dimensionality Reduced Data
Yingzhen Yang, Ping Li

TL;DR
This paper provides theoretical guarantees for noisy $ ext{l}^0$-Sparse Subspace Clustering (SSC) on noisy, high-dimensional data, and introduces a dimensionality reduction method to improve efficiency while maintaining accuracy.
Contribution
It offers the first theoretical analysis of noisy $ ext{l}^0$-SSC's subspace detection property on noisy data and proposes a dimensionality reduction approach for efficiency.
Findings
Theoretical guarantee of subspace detection property for noisy $ ext{l}^0$-SSC.
Dimensionality reduction via random projection preserves subspace recovery.
Experimental validation shows the effectiveness of the proposed method.
Abstract
Sparse subspace clustering methods with sparsity induced by -norm, such as -Sparse Subspace Clustering (-SSC)~\citep{YangFJYH16-L0SSC-ijcv}, are demonstrated to be more effective than its counterpart such as Sparse Subspace Clustering (SSC)~\citep{ElhamifarV13}. However, the theoretical analysis of -SSC is restricted to clean data that lie exactly in subspaces. Real data often suffer from noise and they may lie close to subspaces. In this paper, we show that an optimal solution to the optimization problem of noisy -SSC achieves subspace detection property (SDP), a key element with which data from different subspaces are separated, under deterministic and semi-random model. Our results provide theoretical guarantee on the correctness of noisy -SSC in terms of SDP on noisy data for the first time, which reveals the…
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
TopicsFace and Expression Recognition · Advanced Clustering Algorithms Research · Advanced Computing and Algorithms
