Effective Open Intent Classification with K-center Contrastive Learning and Adjustable Decision Boundary

• URL: http://arxiv.org/abs/2304.10220v1
• Date: Thu, 20 Apr 2023 11:35:06 GMT
• Title: Effective Open Intent Classification with K-center Contrastive Learning and Adjustable Decision Boundary
• Authors: Xiaokang Liu, Jianquan Li, Jingjing Mu, Min Yang, Ruifeng Xu, and Benyou Wang
• Abstract summary: We introduce novel K-center contrastive learning and adjustable decision boundary learning (CLAB) to improve the effectiveness of open intent classification. Specifically, we devise a K-center contrastive learning algorithm to learn discriminative and balanced intent features. We then learn a decision boundary for each known intent class, which consists of a decision center and the radius of the decision boundary.
• Score: 28.71330804762103
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Open intent classification, which aims to correctly classify the known intents into their corresponding classes while identifying the new unknown (open) intents, is an essential but challenging task in dialogue systems. In this paper, we introduce novel K-center contrastive learning and adjustable decision boundary learning (CLAB) to improve the effectiveness of open intent classification. First, we pre-train a feature encoder on the labeled training instances, which transfers knowledge from known intents to unknown intents. Specifically, we devise a K-center contrastive learning algorithm to learn discriminative and balanced intent features, improving the generalization of the model for recognizing open intents. Second, we devise an adjustable decision boundary learning method with expanding and shrinking (ADBES) to determine the suitable decision conditions. Concretely, we learn a decision boundary for each known intent class, which consists of a decision center and the radius of the decision boundary. We then expand the radius of the decision boundary to accommodate more in-class instances if the out-of-class instances are far from the decision boundary; otherwise, we shrink the radius of the decision boundary. Extensive experiments on three benchmark datasets clearly demonstrate the effectiveness of our method for open intent classification. For reproducibility, we submit the code at: https://github.com/lxk00/CLAP

Related papers

• Open-Set Automatic Target Recognition [52.27048031302509]
  Automatic Target Recognition (ATR) is a category of computer vision algorithms which attempts to recognize targets on data obtained from different sensors. Existing ATR algorithms are developed for traditional closed-set methods where training and testing have the same class distribution. We propose an Open-set Automatic Target Recognition framework where we enable open-set recognition capability for ATR algorithms.
  arXiv  Detail & Related papers  (2022-11-10T21:28:24Z)
• Discovering New Intents Using Latent Variables [51.50374666602328]
  We propose a probabilistic framework for discovering intents where intent assignments are treated as latent variables. In E-step, we conduct discovering intents and explore the intrinsic structure of unlabeled data by the posterior of intent assignments. In M-step, we alleviate the forgetting of prior knowledge transferred from known intents by optimizing the discrimination of labeled data.
  arXiv  Detail & Related papers  (2022-10-21T08:29:45Z)
• Learning to Classify Open Intent via Soft Labeling and Manifold Mixup [10.863749481341497]
  Open intent classification is a practical yet challenging task in dialogue systems. We consider another way without using outlier detection algorithms. We propose a deep model based on Soft Labeling and Manifold Mixup.
  arXiv  Detail & Related papers  (2022-04-16T14:10:07Z)
• R(Det)^2: Randomized Decision Routing for Object Detection [64.48369663018376]
  We propose a novel approach to combine decision trees and deep neural networks in an end-to-end learning manner for object detection. To facilitate effective learning, we propose randomized decision routing with node selective and associative losses. We name this approach as the randomized decision routing for object detection, abbreviated as R(Det)$2$.
  arXiv  Detail & Related papers  (2022-04-02T07:54:58Z)
• Learning Discriminative Representations and Decision Boundaries for Open Intent Detection [16.10123071366136]
  Open intent detection is a significant problem in natural language understanding. We propose DA-ADB, which learns distance-aware intent representations and adaptive decision boundaries for open intent detection. Our framework achieves substantial improvements on three benchmark datasets.
  arXiv  Detail & Related papers  (2022-03-11T10:02:09Z)
• Deep Open Intent Classification with Adaptive Decision Boundary [21.478553057876972]
  We propose a post-processing method to learn the adaptive decision boundary (ADB) for open intent classification. Specifically, we propose a new loss function to balance both the empirical risk and the open space risk. Our approach is surprisingly insensitive with less labeled data and fewer known intents.
  arXiv  Detail & Related papers  (2020-12-18T13:05:11Z)
• Discovering New Intents with Deep Aligned Clustering [19.11073686645496]
  We propose an effective method, Deep Aligned Clustering, to discover new intents with the aid of limited known intent data. With an unknown number of new intents, we predict the number of intent categories by eliminating low-confidence intent-wise clusters. Experiments on two benchmark datasets show that our method is more robust and achieves substantial improvements over the state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-12-16T14:32:06Z)
• Learning Open Set Network with Discriminative Reciprocal Points [70.28322390023546]
  Open set recognition aims to simultaneously classify samples from predefined classes and identify the rest as 'unknown' In this paper, we propose a new concept, Reciprocal Point, which is the potential representation of the extra-class space corresponding to each known category. Based on the bounded space constructed by reciprocal points, the risk of unknown is reduced through multi-category interaction.
  arXiv  Detail & Related papers  (2020-10-31T03:20:31Z)
• Discriminative Nearest Neighbor Few-Shot Intent Detection by Transferring Natural Language Inference [150.07326223077405]
  Few-shot learning is attracting much attention to mitigate data scarcity. We present a discriminative nearest neighbor classification with deep self-attention. We propose to boost the discriminative ability by transferring a natural language inference (NLI) model.
  arXiv  Detail & Related papers  (2020-10-25T00:39:32Z)
• Few-Shot Open-Set Recognition using Meta-Learning [72.15940446408824]
  The problem of open-set recognition is considered. A new oPen sEt mEta LEaRning (PEELER) algorithm is introduced.
  arXiv  Detail & Related papers  (2020-05-27T23:49:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.