Ellipsoid-Based Decision Boundaries for Open Intent Classification

• URL: http://arxiv.org/abs/2511.16685v2
• Date: Mon, 24 Nov 2025 03:32:27 GMT
• Title: Ellipsoid-Based Decision Boundaries for Open Intent Classification
• Authors: Yuetian Zou, Hanlei Zhang, Hua Xu, Songze Li, Long Xiao,
• Abstract summary: We propose EliDecide, a novel method that learns ellipsoids with varying scales along different feature directions.<n>Our method achieves state-of-the-art performance on multiple text intent benchmarks and further on a question classification dataset.
• Score: 25.81412056604663
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Textual open intent classification is crucial for real-world dialogue systems, enabling robust detection of unknown user intents without prior knowledge and contributing to the robustness of the system. While adaptive decision boundary methods have shown great potential by eliminating manual threshold tuning, existing approaches assume isotropic distributions of known classes, restricting boundaries to balls and overlooking distributional variance along different directions. To address this limitation, we propose EliDecide, a novel method that learns ellipsoid decision boundaries with varying scales along different feature directions. First, we employ supervised contrastive learning to obtain a discriminative feature space for known samples. Second, we apply learnable matrices to parameterize ellipsoids as the boundaries of each known class, offering greater flexibility than spherical boundaries defined solely by centers and radii. Third, we optimize the boundaries via a novelly designed dual loss function that balances empirical and open-space risks: expanding boundaries to cover known samples while contracting them against synthesized pseudo-open samples. Our method achieves state-of-the-art performance on multiple text intent benchmarks and further on a question classification dataset. The flexibility of the ellipsoids demonstrates superior open intent detection capability and strong potential for generalization to more text classification tasks in diverse complex open-world scenarios.

Related papers

• Generative Human-Object Interaction Detection via Differentiable Cognitive Steering of Multi-modal LLMs [85.69785384599827]
  Human-object interaction (HOI) detection aims to localize human-object pairs and the interactions between them.<n>Existing methods operate under a closed-world assumption, treating the task as a classification problem over a small, predefined verb set.<n>We propose GRASP-HO, a novel Generative Reasoning And Steerable Perception framework that reformulates HOI detection from the closed-set classification task to the open-vocabulary generation problem.
  arXiv  Detail & Related papers  (2025-12-19T14:41:50Z)
• Evolving from Unknown to Known: Retentive Angular Representation Learning for Incremental Open Set Recognition [12.916854998734621]
  We propose retentive angular representation learning (RARL) for incremental open set recognition (IOSR)<n>We adopt a virtual-intrinsic interactive (VII) training strategy, which compacts known representations by enforcing clear inter-class margins.<n>We conduct thorough evaluations on CIFAR100 and TinyImageNet datasets and establish a new benchmark for IOSR.
  arXiv  Detail & Related papers  (2025-09-08T11:35:12Z)
• Multi-Granularity Open Intent Classification via Adaptive Granular-Ball Decision Boundary [22.669965275069313]
  We propose a Multi-granularity Open intent classification method via adaptive Granular-Ball decision boundary (MOGB)<n>Our MOGB method consists of two modules: representation learning and decision boundary acquiring.<n>This involves iteratively alternating between adaptive granular-ball clustering and nearest sub-centroid classification to capture fine-grained semantic structures within known intent classes.
  arXiv  Detail & Related papers  (2024-12-18T06:42:19Z)
• Bidirectional Logits Tree: Pursuing Granularity Reconcilement in Fine-Grained Classification [89.20477310885731]
  This paper addresses the challenge of Granularity Competition in fine-grained classification tasks.<n>Existing approaches typically develop independent hierarchy-aware models based on shared features extracted from a common base encoder.<n>We propose a novel framework called the Bidirectional Logits Tree (BiLT) for Granularity Reconcilement.
  arXiv  Detail & Related papers  (2024-12-17T10:42:19Z)
• Electromagnetic Scattering Kernel Guided Reciprocal Point Learning for SAR Open-Set Recognition [6.226365654670747]
  Open Set Recognition (OSR) aims to categorize known classes while denoting unknown ones as "unknown"<n>To enhance open-set SAR classification, a method called scattering kernel with reciprocal learning network is proposed.<n>Proposal is made to design convolutional kernels based on large-sized attribute scattering center models.
  arXiv  Detail & Related papers  (2024-11-07T13:26:20Z)
• Learning for Transductive Threshold Calibration in Open-World Recognition [83.35320675679122]
  We introduce OpenGCN, a Graph Neural Network-based transductive threshold calibration method with enhanced robustness and adaptability. Experiments across open-world visual recognition benchmarks validate OpenGCN's superiority over existing posthoc calibration methods for open-world threshold calibration.
  arXiv  Detail & Related papers  (2023-05-19T23:52:48Z)
• Open-Set Likelihood Maximization for Few-Shot Learning [36.97433312193586]
  We tackle the Few-Shot Open-Set Recognition (FSOSR) problem, i.e. classifying instances among a set of classes for which we only have a few labeled samples. We explore the popular transductive setting, which leverages the unlabelled query instances at inference. Motivated by the observation that existing transductive methods perform poorly in open-set scenarios, we propose a generalization of the maximum likelihood principle.
  arXiv  Detail & Related papers  (2023-01-20T01:56:19Z)
• 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)
• Deep Magnification-Flexible Upsampling over 3D Point Clouds [103.09504572409449]
  We propose a novel end-to-end learning-based framework to generate dense point clouds. We first formulate the problem explicitly, which boils down to determining the weights and high-order approximation errors. Then, we design a lightweight neural network to adaptively learn unified and sorted weights as well as the high-order refinements.
  arXiv  Detail & Related papers  (2020-11-25T14:00:18Z)
• 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)
• Open Set Recognition with Conditional Probabilistic Generative Models [51.40872765917125]
  We propose Conditional Probabilistic Generative Models (CPGM) for open set recognition. CPGM can detect unknown samples but also classify known classes by forcing different latent features to approximate conditional Gaussian distributions. Experiment results on multiple benchmark datasets reveal that the proposed method significantly outperforms the baselines.
  arXiv  Detail & Related papers  (2020-08-12T06:23:49Z)
• Closed-Form Factorization of Latent Semantics in GANs [65.42778970898534]
  A rich set of interpretable dimensions has been shown to emerge in the latent space of the Generative Adversarial Networks (GANs) trained for synthesizing images. In this work, we examine the internal representation learned by GANs to reveal the underlying variation factors in an unsupervised manner. We propose a closed-form factorization algorithm for latent semantic discovery by directly decomposing the pre-trained weights.
  arXiv  Detail & Related papers  (2020-07-13T18:05:36Z)

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.