A Manifold Proximal Linear Method for Sparse Spectral Clustering with Application to Single-Cell RNA Sequencing Data Analysis
Not on the map. Why?
Abstract (arXiv)
Spectral clustering is one of the fundamental unsupervised learning methods widely used in data analysis. Sparse spectral clustering (SSC) imposes sparsity to the spectral clustering and it improves the interpretability of the model. This paper considers a widely adopted model for SSC, which can be formulated as an optimization problem over the Stiefel manifold with nonsmooth and nonconvex objective. Such an optimization problem is very challenging to solve. Existing methods usually solve its convex relaxation or need to smooth its nonsmooth part using certain smoothing techniques. In this paper, we propose a manifold proximal linear method (ManPL) that solves the original SSC formulation. We also extend the algorithm to solve the multiple-kernel SSC problems, for which an alternating ManPL algorithm is proposed. Convergence and iteration complexity results of the proposed methods are established. We demonstrate the advantage of our proposed methods over existing methods via the single-cell RNA sequencing data analysis.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 18 Jul 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 3; 2024: 0; 2025: 1.
7 papers.
- 2023Forward-backward Gaussian variational inference via JKO in the Bures-Wasserstein Spacecited by 36
- 2022A Riemannian ADMMcited by 2
- 2021A Riemannian smoothing steepest descent method for non-Lipschitz optimization on submanifoldscited by 1
- 2023A New Inexact Proximal Linear Algorithm with Adaptive Stopping Criteria for Robust Phase Retrievalcited by 1
- 2023Do algorithms and barriers for sparse principal component analysis extend to other structured settings?cited by 1
- 2022Provably Uncertainty-Guided Universal Domain Adaptationcited by 0
- 2025Enhancing Distributional Robustness in Principal Component Analysis by Wasserstein Distancescited by 0
- 2025Enhancing Distributional Robustness in Principal Component Analysis by Wasserstein Distances4 Mar 2025
- 2023Do algorithms and barriers for sparse principal component analysis extend to other structured settings?25 Jul 2023
- 2023A New Inexact Proximal Linear Algorithm with Adaptive Stopping Criteria for Robust Phase Retrieval25 Apr 2023
- 2023Forward-backward Gaussian variational inference via JKO in the Bures-Wasserstein Space10 Apr 2023
- 2022A Riemannian ADMM3 Nov 2022
- 2022Provably Uncertainty-Guided Universal Domain Adaptation19 Sep 2022
- 2021A Riemannian smoothing steepest descent method for non-Lipschitz optimization on submanifolds9 Apr 2021