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

07/17/2019
by   Jwo-Yuh Wu, et al.
0

Sparse subspace clustering (SSC) relies on sparse regression for accurate neighbor identification. Inspired by recent progress in compressive sensing, this paper proposes a new sparse regression scheme for SSC via two-step reweighted ℓ_1-minimization, which also generalizes a two-step ℓ_1-minimization algorithm introduced by E. J. Candès et al in [The Annals of Statistics, vol. 42, no. 2, pp. 669-699, 2014] without incurring extra algorithmic complexity. To fully exploit the prior information offered by the computed sparse representation vector in the first step, our approach places a weight on each component of the regression vector, and solves a weighted LASSO in the second step. We propose a data weighting rule suitable for enhancing neighbor identification accuracy. Then, under the formulation of the dual problem of weighted LASSO, we study in depth the theoretical neighbor recovery rates of the proposed scheme. Specifically, an interesting connection between the locations of nonzeros of the optimal sparse solution to the weighted LASSO and the indexes of the active constraints of the dual problem is established. Afterwards, under the semi-random model, analytic probability lower/upper bounds for various neighbor recovery events are derived. Our analytic results confirm that, with the aid of data weighting and if the prior neighbor information is enough accurate, the proposed scheme with a higher probability can produce many correct neighbors and few incorrect neighbors as compared to the solution without data weighting. Computer simulations are provided to validate our analytic study and evidence the effectiveness of the proposed approach.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 9

page 19

02/02/2020

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

Sparse subspace clustering (SSC) using greedy-based neighbor selection, ...
07/06/2019

Fusion-Based Cooperative Support Identification for Compressive Networked Sensing

This paper proposes a fusion-based cooperative support identification sc...
12/05/2017

Energy-Efficient Sensor Censoring for Compressive Distributed Sparse Signal Recovery

To strike a balance between energy efficiency and data quality control, ...
07/10/2018

Scalable Sparse Subspace Clustering via Ordered Weighted ℓ_1 Regression

The main contribution of the paper is a new approach to subspace cluster...
01/18/2019

A New Weighting Scheme in Weighted Markov Model for Predicting the Probability of Drought Episodes

Drought is a complex stochastic natural hazard caused by prolonged short...
02/08/2018

Online Decomposition of Compressive Streaming Data Using n-ℓ_1 Cluster-Weighted Minimization

We consider a decomposition method for compressive streaming data in the...
11/02/2018

Asynchronous Neighbor Discovery Using Coupled Compressive Sensing

The neighbor discovery paradigm finds wide application in Internet of Th...
This week in AI

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