Known Meets Unknown: Mitigating Overconfidence in Open Set Recognition

• URL: http://arxiv.org/abs/2511.13775v1
• Date: Sat, 15 Nov 2025 09:56:44 GMT
• Title: Known Meets Unknown: Mitigating Overconfidence in Open Set Recognition
• Authors: Dongdong Zhao, Ranxin Fang, Changtian Song, Zhihui Liu, Jianwen Xiang,
• Abstract summary: Open Set Recognition (OSR) requires models to accurately classify known classes and to effectively reject unknown samples.<n>When unknown samples are semantically similar to known classes, inter-class overlap in the feature space often causes models to assign unjustifiably high confidence to them.<n>We propose a framework that explicitly mitigates overconfidence caused by inter-class overlap.
• Score: 4.377912830814393
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Open Set Recognition (OSR) requires models not only to accurately classify known classes but also to effectively reject unknown samples. However, when unknown samples are semantically similar to known classes, inter-class overlap in the feature space often causes models to assign unjustifiably high confidence to them, leading to misclassification as known classes -- a phenomenon known as overconfidence. This overconfidence undermines OSR by blurring the decision boundary between known and unknown classes. To address this issue, we propose a framework that explicitly mitigates overconfidence caused by inter-class overlap. The framework consists of two components: a perturbation-based uncertainty estimation module, which applies controllable parameter perturbations to generate diverse predictions and quantify predictive uncertainty, and an unknown detection module with distinct learning-based classifiers, implemented as a two-stage procedure, which leverages the estimated uncertainty to improve discrimination between known and unknown classes, thereby enhancing OSR performance. Experimental results on three public datasets show that the proposed framework achieves superior performance over existing OSR methods.

Related papers

• Knowing the Unknown: Interpretable Open-World Object Detection via Concept Decomposition Model [51.81962097623522]
  Open-world object detection (OWOD) requires incrementally detecting known categories while reliably identifying unknown objects.<n>This paper aims to make the entire OWOD framework interpretable, enabling the detector to truly "knowing the unknown"
  arXiv  Detail & Related papers  (2026-02-24T07:08:47Z)
• In defense of the two-stage framework for open-set domain adaptive semantic segmentation [114.08201544572546]
  Open-Set Domain Adaptation for Semantic Training (OSDA-SS) requires both domain adaptation for known classes and the distinction of unknowns.<n>We propose SATS, a Separating-then-Adapting Training Strategy, which addresses OSDA-SS through two sequential steps: known/unknown separation and unknown-aware domain adaptation.<n>Our method ensures a balanced learning of discriminative features for both known and unknown classes, steering the model toward discovering truly unknown objects.
  arXiv  Detail & Related papers  (2026-01-04T08:58:03Z)
• Open-World Deepfake Attribution via Confidence-Aware Asymmetric Learning [78.92934995292113]
  We propose a Confidence-Aware Asymmetric Learning (CAL) framework, which balances confidence across known and novel forgery types.<n>CAL consistently outperforms previous methods, achieving new state-of-the-art performance on both known and novel forgery attribution.
  arXiv  Detail & Related papers  (2025-12-14T12:31:28Z)
• Perceive, Act and Correct: Confidence Is Not Enough for Hyperspectral Classification [22.167975466562822]
  Confidence alone is often misleading in hyperspectral image classification, as models tend to mistake high predictive scores for correctness while lacking awareness of uncertainty.<n>We propose CABIN, a semi-supervised framework that addresses this limitation through a closed-loop learning process of perception, action, and correction.
  arXiv  Detail & Related papers  (2025-11-13T08:14:32Z)
• Looking Beyond the Known: Towards a Data Discovery Guided Open-World Object Detection [3.9890357781493595]
  Open-World Object Detection (OWOD) enriches traditional object detectors by enabling continual discovery and integration of unknown objects via human guidance.<n>Existing OWOD approaches frequently suffer from semantic confusion between known and unknown classes, alongside catastrophic forgetting, leading to diminished unknown recall and degraded known-class accuracy.<n>We propose Combinatorial Open-World Detection (CROWD), a unified framework reformulating unknown object discovery and adaptation as an interwoven (set-based) data-discovery and representation learning task.
  arXiv  Detail & Related papers  (2025-09-30T21:48:08Z)
• 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)
• Open-Set LiDAR Panoptic Segmentation Guided by Uncertainty-Aware Learning [17.188627352236782]
  We propose ULOPS, an uncertainty-guided open-set panoptic segmentation framework.<n>Our architecture incorporates separate decoders for semantic segmentation with uncertainty estimation.<n>During inference, we leverage uncertainty estimates to identify and segment unknown instances.
  arXiv  Detail & Related papers  (2025-06-16T09:03:51Z)
• Boosting Few-Shot Open-Set Object Detection via Prompt Learning and Robust Decision Boundary [10.054397736100245]
  Few-shot Open-set Object Detection (FOOD) poses a challenge in many open-world scenarios.<n>It aims to train an open-set detector to detect known objects while rejecting unknowns with scarce training samples.<n>Our method achieves superior performance over previous state-of-the-art approaches.
  arXiv  Detail & Related papers  (2024-06-26T15:48:24Z)
• Cycles of Thought: Measuring LLM Confidence through Stable Explanations [53.15438489398938]
  Large language models (LLMs) can reach and even surpass human-level accuracy on a variety of benchmarks, but their overconfidence in incorrect responses is still a well-documented failure mode. We propose a framework for measuring an LLM's uncertainty with respect to the distribution of generated explanations for an answer.
  arXiv  Detail & Related papers  (2024-06-05T16:35:30Z)
• Learning Classifiers of Prototypes and Reciprocal Points for Universal Domain Adaptation [79.62038105814658]
  Universal Domain aims to transfer the knowledge between datasets by handling two shifts: domain-shift and categoryshift. Main challenge is correctly distinguishing the unknown target samples while adapting the distribution of known class knowledge from source to target. Most existing methods approach this problem by first training the target adapted known and then relying on the single threshold to distinguish unknown target samples.
  arXiv  Detail & Related papers  (2022-12-16T09:01:57Z)
• What is Flagged in Uncertainty Quantification? Latent Density Models for Uncertainty Categorization [68.15353480798244]
  Uncertainty Quantification (UQ) is essential for creating trustworthy machine learning models. Recent years have seen a steep rise in UQ methods that can flag suspicious examples. We propose a framework for categorizing uncertain examples flagged by UQ methods in classification tasks.
  arXiv  Detail & Related papers  (2022-07-11T19:47:00Z)
• Adversarial Reciprocal Points Learning for Open Set Recognition [21.963137599375862]
  Open set recognition (OSR) aims to simultaneously classify the seen classes and identify the unseen classes as 'unknown' We formulate the open space risk problem from the perspective of multi-class integration. A novel learning framework, termed Adrial Reciprocal Point Learning (ARPL), is proposed to minimize the overlap of known distribution and unknown distributions.
  arXiv  Detail & Related papers  (2021-03-01T12:25:45Z)
• Entropy-Based Uncertainty Calibration for Generalized Zero-Shot Learning [49.04790688256481]
  The goal of generalized zero-shot learning (GZSL) is to recognise both seen and unseen classes. Most GZSL methods typically learn to synthesise visual representations from semantic information on the unseen classes. We propose a novel framework that leverages dual variational autoencoders with a triplet loss to learn discriminative latent features.
  arXiv  Detail & Related papers  (2021-01-09T05:21:27Z)
• 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)

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.