Task-Adaptive Negative Class Envision for Few-Shot Open-Set Recognition

• URL: http://arxiv.org/abs/2012.13073v1
• Date: Thu, 24 Dec 2020 02:30:18 GMT
• Title: Task-Adaptive Negative Class Envision for Few-Shot Open-Set Recognition
• Authors: Shiyuan Huang, Jiawei Ma, Guangxing Han, Shih-Fu Chang
• Abstract summary: We study the problem of few-shot open-set recognition (FSOR), which learns a recognition system robust to queries from new sources. We propose a novel task-adaptive negative class envision method (TANE) to model the open world. Our approach significantly improves the state-of-the-art performance on few-shot open-set recognition.
• Score: 36.53830822788852
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recent works seek to endow recognition systems with the ability to handle the open world. Few shot learning aims for fast learning of new classes from limited examples, while open-set recognition considers unknown negative class from the open world. In this paper, we study the problem of few-shot open-set recognition (FSOR), which learns a recognition system robust to queries from new sources with few examples and from unknown open sources. To achieve that, we mimic human capability of envisioning new concepts from prior knowledge, and propose a novel task-adaptive negative class envision method (TANE) to model the open world. Essentially we use an external memory to estimate a negative class representation. Moreover, we introduce a novel conjugate episode training strategy that strengthens the learning process. Extensive experiments on four public benchmarks show that our approach significantly improves the state-of-the-art performance on few-shot open-set recognition. Besides, we extend our method to generalized few-shot open-set recognition (GFSOR), where we also achieve performance gains on MiniImageNet.

Related papers

• Learning Prompt with Distribution-Based Feature Replay for Few-Shot Class-Incremental Learning [56.29097276129473]
  We propose a simple yet effective framework, named Learning Prompt with Distribution-based Feature Replay (LP-DiF) To prevent the learnable prompt from forgetting old knowledge in the new session, we propose a pseudo-feature replay approach. When progressing to a new session, pseudo-features are sampled from old-class distributions combined with training images of the current session to optimize the prompt.
  arXiv  Detail & Related papers  (2024-01-03T07:59:17Z)
• OpenIncrement: A Unified Framework for Open Set Recognition and Deep Class-Incremental Learning [4.278434830731282]
  We introduce a deep class-incremental learning framework integrated with open set recognition. Our approach refines class-incrementally learned features to adapt them for distance-based open set recognition. Experimental results validate that our method outperforms state-of-the-art incremental learning techniques.
  arXiv  Detail & Related papers  (2023-10-05T19:08:08Z)
• Open Long-Tailed Recognition in a Dynamic World [82.91025831618545]
  Real world data often exhibits a long-tailed and open-ended (with unseen classes) distribution. A practical recognition system must balance between majority (head) and minority (tail) classes, generalize across the distribution, and acknowledge novelty upon the instances of unseen classes (open classes) We define Open Long-Tailed Recognition++ as learning from such naturally distributed data and optimizing for the classification accuracy over a balanced test set.
  arXiv  Detail & Related papers  (2022-08-17T15:22:20Z)
• Open-world Contrastive Learning [25.585152083052574]
  We introduce a new learning framework, open-world contrastive learning (OpenCon) OpenCon tackles the challenges of learning compact representations for both known and novel classes. On the ImageNet dataset, OpenCon significantly outperforms the current best method by 11.9% and 7.4% on novel and overall classification accuracy.
  arXiv  Detail & Related papers  (2022-08-04T16:48:02Z)
• Contrastive Learning for Cross-Domain Open World Recognition [17.660958043781154]
  The ability to evolve is fundamental for any valuable autonomous agent whose knowledge cannot remain limited to that injected by the manufacturer. We show how it learns a feature space perfectly suitable to incrementally include new classes and is able to capture knowledge which generalizes across a variety of visual domains. Our method is endowed with a tailored effective stopping criterion for each learning episode and exploits a novel self-paced thresholding strategy.
  arXiv  Detail & Related papers  (2022-03-17T11:23:53Z)
• Bayesian Embeddings for Few-Shot Open World Recognition [60.39866770427436]
  We extend embedding-based few-shot learning algorithms to the open-world recognition setting. We benchmark our framework on open-world extensions of the common MiniImageNet and TieredImageNet few-shot learning datasets.
  arXiv  Detail & Related papers  (2021-07-29T00:38:47Z)
• Opening Deep Neural Networks with Generative Models [2.0962464943252934]
  We propose GeMOS: simple and plug-and-play open set recognition modules that can be attached to pretrained Deep Neural Networks for visual recognition. The GeMOS framework pairs pre-trained Convolutional Neural Networks with generative models for open set recognition to extract open set scores for each sample. We conduct a thorough evaluation of the proposed method in comparison with state-of-the-art open set algorithms, finding that GeMOS either outperforms or is statistically indistinguishable from more complex and costly models.
  arXiv  Detail & Related papers  (2021-05-20T20:02:29Z)
• 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)
• 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.