paper-with-me

홈 › Papers

Deep Clustering with Diffused Sampling and Hardness-aware Self-distillation

2024-01-25 · Hai-Xin Zhang, Dong Huang

Deep clustering has gained significant attention due to its capability in learning clustering-friendly representations without labeled data. However, previous deep clustering methods tend to treat all samples equally, which neglect the variance in the latent distribution and the varying difficulty in classifying or clustering different samples. To address this, this paper proposes a novel end-to-end deep clustering method with diffused sampling and hardness-aware self-distillation (HaDis). Specifically, we first align one view of instances with another view via diffused sampling alignment (DSA), which helps improve the intra-cluster compactness. To alleviate the sampling bias, we present the hardness-aware self-distillation (HSD) mechanism to mine the hardest positive and negative samples and adaptively adjust their weights in a self-distillation fashion, which is able to deal with the potential imbalance in sample contributions during optimization. Further, the prototypical contrastive learning is incorporated to simultaneously enhance the inter-cluster separability and intra-cluster compactness. Experimental results on five challenging image datasets demonstrate the superior clustering performance of our HaDis method over the state-of-the-art. Source code is available at https://github.com/Regan-Zhang/HaDis.

📄 PDF Abstract BibTeX arXiv:2401.14038

Code (1)

regan-zhang/hadis 공식 구현 pytorch

Tasks

ClusteringContrastive LearningDeep ClusteringKnowledge DistillationSelf-Knowledge DistillationSelf-Supervised Learning

Methods 이 논문이 사용한 방법론

Contrastive Learning 설명 없음
ALIGN In the ALIGN method, visual and language representations are jointly trained from noisy image alt-text data. The image and text encoders are learned via contrastive loss…

Similar Papers 제목 키워드 기반

Happy: A Debiased Learning Framework for Continual Generalized Category Discovery

2024-10-09 · Shijie Ma, Fei Zhu, Zhun Zhong, Wenzhuo LIU 외

Constantly discovering novel concepts is crucial in evolving environments. This paper explores the underexplored task of Continual Generalized Category Discovery (C-GCD), which aims to incrementally discover new classes …

Novel Concepts

Swift and Sure: Hardness-aware Contrastive Learning for Low-dimensional Knowledge Graph Embeddings

2022-01-03 · Kai Wang, Yu Liu, Quan Z. Sheng

Knowledge graph embedding (KGE) has shown great potential in automatic knowledge graph (KG) completion and knowledge-driven tasks. However, recent KGE models suffer from high training cost and large storage space, thus l…

Contrastive LearningGraph EmbeddingKnowledge Graph EmbeddingKnowledge Graph Embeddings

Counting Objects by Diffused Index: geometry-free and training-free approach

2021-10-15 · Mengyi Tang, Maryam Yashtini, Sung Ha Kang

Counting objects is a fundamental but challenging problem. In this paper, we propose diffusion-based, geometry-free, and learning-free methodologies to count the number of objects in images. The main idea is to represent…

ClusteringComputational EfficiencyObject

Hardness Sampling for Self-Training Based Transductive Zero-Shot Learning

2021-06-01 · CVPR 2021 1 · Liu Bo, Qiulei Dong, Zhanyi Hu

Transductive zero-shot learning (T-ZSL) which could alleviate the domain shift problem in existing ZSL works, has received much attention recently. However, an open problem in T-ZSL: how to effectively make use of unseen…

Zero-Shot Learning

Universal NP-Hardness of Clustering under General Utilities

2026-02-27 · Angshul Majumdar arxiv

Clustering is a central primitive in unsupervised learning, yet practice is dominated by heuristics whose outputs can be unstable and highly sensitive to representations, hyperparameters, and initialisation. Existing the…