无需标签和调参,单视角深度子空间聚类新方法
Label-independent hyperparameter-free self-supervised single-view deep subspace clustering
- 分层自表达损失+结构化正则,联合优化表示与聚类
- 多阶段学习框架实现无超参自动训练,性能超越多数线性方法
- 自停止机制无需标签,适合真实场景无监督聚类
深度子空间聚类(DSC)算法在实际应用中面临诸多挑战:仅依赖编码器输出层信息、表征学习与聚类解耦、需预留数据调参、依赖标签终止训练,且性能常依赖标注后处理。为此,本文提出一种新的单视角DSC方法:(i) 使用联合表示矩阵最小化分层自表达损失;(ii) 优化子空间结构化范数提升聚类质量;(iii) 采用多阶段渐进学习框架,支持多正则项而无需调参;(iv) 引入基于相对误差的自停止机制,无需标签即可终止训练;(v) 基于先验知识保留学习表示矩阵中的前若干系数。在六个数据集(人脸、数字、物体)上评估,结果表明该方法在人工精心调参的线性方法中表现更优,且与最佳线性方法性能相当。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。