Sparse Representation Classification via Screening for Graphs
arXiv:1906.01601
Abstract
The sparse representation classifier (SRC) is shown to work well for image recognition problems that satisfy a subspace assumption. In this paper we propose a new implementation of SRC via screening, establish its equivalence to the original SRC under regularity conditions, and prove its classification consistency for random graphs drawn from stochastic blockmodels. The results are demonstrated via simulations and real data experiments, where the new algorithm achieves comparable numerical performance but significantly faster.
Accepted at Learning and Reasoning with Graph-Structured Representations in International Conference on Machine Learning (ICML) 2019
References in corpus (14)
- Discussion of "Least angle regression" by Efron et al
- Rejoinder to "Least angle regression" by Efron et al
- Least Angle Regression
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Compressed Sensing of Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Structural Properties of the Caenorhabditis elegans Neuronal Network
- Block-Sparse Recovery via Convex Optimization
- Robust Vertex Classification