paper-with-me

홈 › Papers

Watch the Neighbors: A Unified K-Nearest Neighbor Contrastive Learning Framework for OOD Intent Discovery

2022-10-17 · Yutao Mou, Keqing He, Pei Wang, Yanan Wu, Jingang Wang, Wei Wu, Weiran Xu

Discovering out-of-domain (OOD) intent is important for developing new skills in task-oriented dialogue systems. The key challenges lie in how to transfer prior in-domain (IND) knowledge to OOD clustering, as well as jointly learn OOD representations and cluster assignments. Previous methods suffer from in-domain overfitting problem, and there is a natural gap between representation learning and clustering objectives. In this paper, we propose a unified K-nearest neighbor contrastive learning framework to discover OOD intents. Specifically, for IND pre-training stage, we propose a KCL objective to learn inter-class discriminative features, while maintaining intra-class diversity, which alleviates the in-domain overfitting problem. For OOD clustering stage, we propose a KCC method to form compact clusters by mining true hard negative samples, which bridges the gap between clustering and representation learning. Extensive experiments on three benchmark datasets show that our method achieves substantial improvements over the state-of-the-art methods.

📄 PDF Abstract BibTeX arXiv:2210.08909

Code (1)

myt517/kcod 공식 구현

Tasks

ClusteringContrastive LearningDiversityIntent DiscoveryRepresentation LearningTask-Oriented Dialogue Systems

Methods 이 논문이 사용한 방법론

Contrastive Learning 설명 없음

Similar Papers 제목 키워드 기반

pNNCLR: Stochastic Pseudo Neighborhoods for Contrastive Learning based Unsupervised Representation Learning Problems

2023-08-14 · Momojit Biswas, Himanshu Buckchash, Dilip K. Prasad

Nearest neighbor (NN) sampling provides more semantic variations than pre-defined transformations for self-supervised learning (SSL) based image recognition problems. However, its performance is restricted by the quality…

Contrastive LearningRepresentation LearningSelf-Supervised Learning

Contrast then Memorize: Semantic Neighbor Retrieval-Enhanced Inductive Multimodal Knowledge Graph Completion

2024-07-03 · Yu Zhao, Ying Zhang, Baohang Zhou, Xinying Qian 외

A large number of studies have emerged for Multimodal Knowledge Graph Completion (MKGC) to predict the missing links in MKGs. However, fewer studies have been proposed to study the inductive MKGC (IMKGC) involving emergi…

Contrastive LearningKnowledge Graph CompletionRetrieval

Promoting Semantic Connectivity: Dual Nearest Neighbors Contrastive Learning for Unsupervised Domain Generalization

2023-01-01 · CVPR 2023 1 · Yuchen Liu, Yaoming Wang, Yabo Chen, Wenrui Dai 외

Domain Generalization (DG) has achieved great success in generalizing knowledge from source domains to unseen target domains. However, current DG methods rely heavily on labeled source data, which are usually costly …

Contrastive LearningDomain GeneralizationLinear evaluation

MNN: Mixed Nearest-Neighbors for Self-Supervised Learning

2023-11-01 · Xianzhong Long, Chen Peng, Yun Li

In contrastive self-supervised learning, positive samples are typically drawn from the same image but in different augmented views, resulting in a relatively limited source of positive samples. An effective way to allevi…

Self-Supervised Learning

Nearest Neighbor Matching for Deep Clustering

2021-06-19 · CVPR 2021 1 · Zhiyuan Dang, Cheng Deng, Xu Yang, Kun Wei 외

Deep clustering gradually becomes an important branch in unsupervised learning methods. However, current approaches hardly take into consideration the semantic sample relationships that existed in both local and glob…

ClusteringDeep Clustering