Accelerated Stochastic Variance Reduction Gradient Algorithms for Robust Subspace Clustering
Open Access
Abstract
Robust face clustering enjoys a wide range of applications for gate passes, surveillance systems and security analysis in embedded sensors. Nevertheless, existing algorithms have limitations in finding accurate clusters when data contain noise (e.g., occluded face clustering and recognition). It is known that in subspace clustering, the - and -norm regularizers can improve subspace preservation and connectivity, respectively, and the elastic net regularizer (i.e., the mixture of the - and -norms) provides a balance between the two properties. However, existing deterministic methods have high per iteration computational complexities, making them inapplicable to large-scale problems. To address this issue, this paper proposes the first accelerated stochastic variance reduction gradient (RASVRG) algorithm for robust subspace clustering. We also introduce a new momentum acceleration technique for the RASVRG algorithm. As a result of the involvement of this momentum, the RASVRG algorithm achieves both the best oracle complexity and the fastest convergence rate, and it reaches higher efficiency in practice for both strongly convex and not strongly convex models. Various experimental results show that the RASVRG algorithm outperformed existing state-of-the-art methods with elastic net and -norm regularizers in terms of accuracy in most cases. As demonstrated on real-world face datasets with different manually added levels of pixel corruption and occlusion situations, the RASVRG algorithm achieved much better performance in terms of accuracy and robustness.
Keywords
Funding Information
- National Natural Science Foundation of China (62276182, PCL2023A08)
- Peng Cheng Lab Program (62276182, PCL2023A08)
This publication has 38 references indexed in Scilit:
- Binary multi-view sparse subspace clusteringNeural Computing and Applications, 2023
- Attention reweighted sparse subspace clusteringPattern Recognition, 2023
- Deep face recognition: A surveyNeurocomputing, 2021
- Sparse and low-rank regularized deep subspace clusteringKnowledge-Based Systems, 2020
- Constrained bilinear factorization multi-view subspace clusteringKnowledge-Based Systems, 2020
- Subspace clustering by simultaneously feature selection and similarity learningKnowledge-Based Systems, 2020
- An optimal randomized incremental gradient methodMathematical Programming, 2017
- Forum latent Dirichlet allocation for user interest discoveryKnowledge-Based Systems, 2017
- Elastic Net subspace clustering applied to pop/rock music structure analysisPattern Recognition Letters, 2014
- A tutorial on spectral clusteringStatistics and Computing, 2007