Provable Noisy Sparse Subspace Clustering using Greedy Neighbor Selection: A Coherence-Based Perspective

by   Jwo-Yuh Wu, et al.

Sparse subspace clustering (SSC) using greedy-based neighbor selection, such as matching pursuit (MP) and orthogonal matching pursuit (OMP), has been known as a popular computationally-efficient alternative to the conventional L1-minimization based methods. Under deterministic bounded noise corruption, in this paper we derive coherence-based sufficient conditions guaranteeing correct neighbor identification using MP/OMP. Our analyses exploit the maximum/minimum inner product between two noisy data points subject to a known upper bound on the noise level. The obtained sufficient condition clearly reveals the impact of noise on greedy-based neighbor recovery. Specifically, it asserts that, as long as noise is sufficiently small so that the resultant perturbed residual vectors stay close to the desired subspace, both MP and OMP succeed in returning a correct neighbor subset. A striking finding is that, when the ground truth subspaces are well-separated from each other and noise is not large, MP-based iterations, while enjoying lower algorithmic complexity, yield smaller perturbation of residuals, thereby better able to identify correct neighbors and, in turn, achieving higher global data clustering accuracy. Extensive numerical experiments are used to corroborate our theoretical study.



There are no comments yet.


page 1

page 4

page 5


Greedier is Better: Selecting Multiple Neighbors per Iteration for Sparse Subspace Clustering

Sparse subspace clustering (SSC) using greedy-based neighbor selection, ...

Greedy Feature Selection for Subspace Clustering

Unions of subspaces provide a powerful generalization to linear subspace...

Sparse Subspace Clustering via Two-Step Reweighted L1-Minimization: Algorithm and Provable Neighbor Recovery Rates

Sparse subspace clustering (SSC) relies on sparse regression for accurat...

Restricted Connection Orthogonal Matching Pursuit For Sparse Subspace Clustering

Sparse Subspace Clustering (SSC) is one of the most popular methods for ...

Provable Data Clustering via Innovation Search

This paper studies the subspace clustering problem in which data points ...

A Novel Efficient Approach with Data-Adaptive Capability for OMP-based Sparse Subspace Clustering

Orthogonal Matching Pursuit (OMP) plays an important role in data scienc...

Sparse Representation Classification Beyond L1 Minimization and the Subspace Assumption

The sparse representation classifier (SRC) proposed in Wright et al. (20...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.