Learning Discriminative Representations and Decision Boundaries for Open Intent Detection

• URL: http://arxiv.org/abs/2203.05823v3
• Date: Fri, 5 May 2023 15:02:53 GMT
• Title: Learning Discriminative Representations and Decision Boundaries for Open Intent Detection
• Authors: Hanlei Zhang, Hua Xu, Shaojie Zhao, Qianrui Zhou
• Abstract summary: 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.
• Score: 16.10123071366136
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Open intent detection is a significant problem in natural language understanding, which aims to identify the unseen open intent while ensuring known intent identification performance. However, current methods face two major challenges. Firstly, they struggle to learn friendly representations to detect the open intent with prior knowledge of only known intents. Secondly, there is a lack of an effective approach to obtaining specific and compact decision boundaries for known intents. To address these issues, this paper presents an original framework called DA-ADB, which successively learns distance-aware intent representations and adaptive decision boundaries for open intent detection. Specifically, we first leverage distance information to enhance the distinguishing capability of the intent representations. Then, we design a novel loss function to obtain appropriate decision boundaries by balancing both empirical and open space risks. Extensive experiments demonstrate the effectiveness of the proposed distance-aware and boundary learning strategies. Compared to state-of-the-art methods, our framework achieves substantial improvements on three benchmark datasets. Furthermore, it yields robust performance with varying proportions of labeled data and known categories.

Related papers

• Clarify When Necessary: Resolving Ambiguity Through Interaction with LMs [58.620269228776294]
  We propose a task-agnostic framework for resolving ambiguity by asking users clarifying questions. We evaluate systems across three NLP applications: question answering, machine translation and natural language inference. We find that intent-sim is robust, demonstrating improvements across a wide range of NLP tasks and LMs.
  arXiv  Detail & Related papers  (2023-11-16T00:18:50Z)
• Effective Open Intent Classification with K-center Contrastive Learning and Adjustable Decision Boundary [28.71330804762103]
  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.
  arXiv  Detail & Related papers  (2023-04-20T11:35:06Z)
• 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)
• Few-Shot Intent Detection via Contrastive Pre-Training and Fine-Tuning [27.154414939086426]
  We present a simple yet effective few-shot intent detection schema via contrastive pre-training and fine-tuning. We first conduct self-supervised contrastive pre-training on collected intent datasets, which implicitly learns to discriminate semantically similar utterances. We then perform few-shot intent detection together with supervised contrastive learning, which explicitly pulls utterances from the same intent closer.
  arXiv  Detail & Related papers  (2021-09-13T22:28:58Z)
• Few-Shot Fine-Grained Action Recognition via Bidirectional Attention and Contrastive Meta-Learning [51.03781020616402]
  Fine-grained action recognition is attracting increasing attention due to the emerging demand of specific action understanding in real-world applications. We propose a few-shot fine-grained action recognition problem, aiming to recognize novel fine-grained actions with only few samples given for each class. Although progress has been made in coarse-grained actions, existing few-shot recognition methods encounter two issues handling fine-grained actions.
  arXiv  Detail & Related papers  (2021-08-15T02:21:01Z)
• Generalized Zero-shot Intent Detection via Commonsense Knowledge [5.398580049917152]
  We propose RIDE: an intent detection model that leverages commonsense knowledge in an unsupervised fashion to overcome the issue of training data scarcity. RIDE computes robust and generalizable relationship meta-features that capture deep semantic relationships between utterances and intent labels. Our extensive experimental analysis on three widely-used intent detection benchmarks shows that relationship meta-features significantly increase the accuracy of detecting both seen and unseen intents.
  arXiv  Detail & Related papers  (2021-02-04T23:36:41Z)
• 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)
• 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)
• Efficient Intent Detection with Dual Sentence Encoders [53.16532285820849]
  We introduce intent detection methods backed by pretrained dual sentence encoders such as USE and ConveRT. We demonstrate the usefulness and wide applicability of the proposed intent detectors, showing that they outperform intent detectors based on fine-tuning the full BERT-Large model. We release our code, as well as a new challenging single-domain intent detection dataset.
  arXiv  Detail & Related papers  (2020-03-10T15:33:54Z)

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.