Label-independent hyperparameter-free self-supervised single-view deep subspace clustering
Not on the map. Why?
Abstract (arXiv)
Deep subspace clustering (DSC) algorithms face several challenges that hinder their widespread adoption across variois application domains. First, clustering quality is typically assessed using only the encoder's output layer, disregarding valuable information present in the intermediate layers. Second, most DSC approaches treat representation learning and subspace clustering as independent tasks, limiting their effectiveness. Third, they assume the availability of a held-out dataset for hyperparameter tuning, which is often impractical in real-world scenarios. Fourth, learning termination is commonly based on clustering error monitoring, requiring external labels. Finally, their performance often depends on post-processing techniques that rely on labeled data. To address this limitations, we introduce a novel single-view DSC approach that: (i) minimizes a layer-wise self expression loss using a joint representation matrix; (ii) optimizes a subspace-structured norm to enhance clustering quality; (iii) employs a multi-stage sequential learning framework, consisting of pre-training and fine-tuning, enabling the use of multiple regularization terms without hyperparameter tuning; (iv) incorporates a relative error-based self-stopping mechanism to terminate training without labels; and (v) retains a fixed number of leading coefficients in the learned representation matrix based on prior knowledge. We evaluate the proposed method on six datasets representing faces, digits, and objects. The results show that our method outperforms most linear SC algorithms with careffulyl tuned hyperparameters while maintaining competitive performance with the best performing linear appoaches.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 17 of its 66 references that are in the map. First posted on arXiv 25 Apr 2025.
Builds on
17 of 66 references.
References · 17
- 2015Unsupervised Deep Embedding for Clustering Analysiscited by 767
- 2019Data-Efficient Image Recognition with Contrastive Predictive Codingcited by 673
- 2017Deep Clustering via Joint Convolutional Autoencoder Embedding and Relative Entropy Minimizationcited by 113
- 2017Deep Subspace Clustering Networkscited by 94
- 2021Self-Supervised Discriminative Feature Learning for Deep Multi-View Clusteringcited by 41
- 2019Self-Supervised Convolutional Subspace Clustering Networkcited by 32
- 2021Pseudo-supervised Deep Subspace Clusteringcited by 29
- 2020A Critique of Self-Expressive Deep Subspace Clusteringcited by 18
- 2013Robust Subspace Clustering via Thresholdingcited by 16
- 2022Self-Supervised Information Bottleneck for Deep Multi-View Subspace Clusteringcited by 15
- 2017Sketched Subspace Clusteringcited by 11
- 2014Greedy Subspace Clusteringcited by 10
5 more
- 2020Is an Affine Constraint Needed for Affine Subspace Clustering?cited by 10
- 2020Maximum Entropy Subspace Clustering Networkcited by 9
- 2017A Data Mining Approach Combining K-Means Clustering with Bagging Neural Network for Short-term Wind Power Forecastingcited by 5
- 2018ℓ0-Motivated Low-Rank Sparse Subspace Clusteringcited by 2
- 2024Multilayer Graph Approach to Deep Subspace Clusteringcited by 1
Built on by
Not cited yet.