利用扩散模型中间层与去噪步骤,自动寻找最佳聚类表示。
DiEC: Diffusion Embedded Clustering
- 在扩散模型的层级与噪声步长空间中搜索最优聚类表示。
- 在多个数据集上达到先进聚类效果,无需对比学习或数据增强。
- 保留生成能力的同时提升聚类性能,适合无监督表征学习场景。
深度聚类方法通常依赖单一明确的表示。而预训练扩散模型在不同网络层和噪声时间步上提供了丰富多样的多尺度表示。但关键挑战在于如何高效识别出最适配聚类的表示。为此,本文提出扩散嵌入聚类(DiEC),一种无监督框架,通过利用预训练扩散模型中的最优中间表示进行聚类。DiEC系统性评估了沿网络深度与噪声时间步轨迹的表示可聚类性,并设计了一种无监督搜索策略,以识别层*时间步空间中的聚类最优层(COL)与聚类最优时间步(COT),旨在提升聚类性能并降低计算开销。DiEC主要在固定的COL+COT处以保持结构的DEC风格KL散度目标进行微调,同时引入随机时间步的扩散去噪目标以维持预训练模型的生成能力。无需依赖增强一致性约束或对比学习,DiEC在多个基准数据集上实现了优异的聚类性能。
原文摘要 · Abstract (English)
Deep clustering methods typically rely on a single, well-defined representation for clustering. In contrast, pretrained diffusion models provide abundant and diverse multi-scale representations across network layers and noise timesteps. However, a key challenge is how to efficiently identify the most clustering-friendly representation in the layer*timestep space. To address this issue, we propose Diffusion Embedded Clustering (DiEC), an unsupervised framework that performs clustering by leveraging optimal intermediate representations from pretrained diffusion models. DiEC systematically evaluates the clusterability of representations along the trajectory of network depth and noise timesteps. Meanwhile, an unsupervised search strategy is designed for recognizing the Clustering-optimal Layer (COL) and Clustering-optimal Timestep (COT) in the layer*timestep space of pretrained diffusion models, aiming to promote clustering performance and reduce computational overhead. DiEC is fine-tuned primarily with a structure-preserving DEC-style KL-divergence objective at the fixed COL + COT, together with a random-timestep diffusion denoising objective to maintain the generative capability of the pretrained model. Without relying on augmentation-based consistency constraints or contrastive learning, DiEC achieves excellent clustering performance across multiple benchmark datasets.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。