TY - GEN
T1 - Noisy ℓ0-Sparse Subspace Clustering on Dimensionality Reduced Data
AU - Yang, Yingzhen
AU - Li, Ping
N1 - Publisher Copyright:
© 2022 Proceedings of the 38th Conference on Uncertainty in Artificial Intelligence, UAI 2022. All right reserved.
PY - 2022
Y1 - 2022
N2 - aSparse subspace clustering methods with sparsity induced by ℓ0-norm, such as ℓ0-Sparse Subspace Clustering (ℓ0-SSC) [Yang et al., 2018], are demonstrated to be more effective than its ℓ1 counterpart such as Sparse Subspace Clustering (SSC) [Elhamifar and Vidal, 2013]. However, the theoretical analysis of ℓ0-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 ℓ0-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 ℓ0-SSC in terms of SDP on noisy data for the first time, which reveals the advantage of noisy ℓ0-SSC in terms of much less restrictive condition on subspace affinity. In order to improve the efficiency of noisy ℓ0-SSC, we propose Noisy-DR-ℓ0-SSC which provably recovers the subspaces on dimensionality reduced data. Noisy-DR-ℓ0-SSC first projects the data onto a lower dimensional space by random projection, then performs noisy ℓ0-SSC on the projected data for improved efficiency. Experimental results demonstrate the effectiveness of Noisy-DR-ℓ0-SSC.
AB - aSparse subspace clustering methods with sparsity induced by ℓ0-norm, such as ℓ0-Sparse Subspace Clustering (ℓ0-SSC) [Yang et al., 2018], are demonstrated to be more effective than its ℓ1 counterpart such as Sparse Subspace Clustering (SSC) [Elhamifar and Vidal, 2013]. However, the theoretical analysis of ℓ0-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 ℓ0-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 ℓ0-SSC in terms of SDP on noisy data for the first time, which reveals the advantage of noisy ℓ0-SSC in terms of much less restrictive condition on subspace affinity. In order to improve the efficiency of noisy ℓ0-SSC, we propose Noisy-DR-ℓ0-SSC which provably recovers the subspaces on dimensionality reduced data. Noisy-DR-ℓ0-SSC first projects the data onto a lower dimensional space by random projection, then performs noisy ℓ0-SSC on the projected data for improved efficiency. Experimental results demonstrate the effectiveness of Noisy-DR-ℓ0-SSC.
UR - http://www.scopus.com/inward/record.url?scp=85146144280&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85146144280&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85146144280
T3 - Proceedings of the 38th Conference on Uncertainty in Artificial Intelligence, UAI 2022
SP - 2235
EP - 2245
BT - Proceedings of the 38th Conference on Uncertainty in Artificial Intelligence, UAI 2022
PB - Association For Uncertainty in Artificial Intelligence (AUAI)
T2 - 38th Conference on Uncertainty in Artificial Intelligence, UAI 2022
Y2 - 1 August 2022 through 5 August 2022
ER -