Improving Open-world Continual Learning under the Constraints of Scarce Labeled Data

• URL: http://arxiv.org/abs/2502.20974v1
• Date: Fri, 28 Feb 2025 11:39:18 GMT
• Title: Improving Open-world Continual Learning under the Constraints of Scarce Labeled Data
• Authors: Yujie Li, Xiangkun Wang, Xin Yang, Marcello Bonsangue, Junbo Zhang, Tianrui Li,
• Abstract summary: Openworld continual learning (OWCL) adapts to sequential tasks with open samples, learning knowledge incrementally while preventing forgetting.<n>We propose a novel OFCL framework that integrates three key components: (1) an instance-wise token augmentation (ITA) that represents and enriches sample representations with additional knowledge, (2) a margin-based open boundary (MOB) that supports open detection with new tasks, and (3) an adaptive knowledge space (AKS) that endows unknowns with knowledge for the updating from unknowns to knowns.
• Score: 19.168022702075774
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Open-world continual learning (OWCL) adapts to sequential tasks with open samples, learning knowledge incrementally while preventing forgetting. However, existing OWCL still requires a large amount of labeled data for training, which is often impractical in real-world applications. Given that new categories/entities typically come with limited annotations and are in small quantities, a more realistic situation is OWCL with scarce labeled data, i.e., few-shot training samples. Hence, this paper investigates the problem of open-world few-shot continual learning (OFCL), challenging in (i) learning unbounded tasks without forgetting previous knowledge and avoiding overfitting, (ii) constructing compact decision boundaries for open detection with limited labeled data, and (iii) transferring knowledge about knowns and unknowns and even update the unknowns to knowns once the labels of open samples are learned. In response, we propose a novel OFCL framework that integrates three key components: (1) an instance-wise token augmentation (ITA) that represents and enriches sample representations with additional knowledge, (2) a margin-based open boundary (MOB) that supports open detection with new tasks emerge over time, and (3) an adaptive knowledge space (AKS) that endows unknowns with knowledge for the updating from unknowns to knowns. Finally, extensive experiments show the proposed OFCL framework outperforms all baselines remarkably with practical importance and reproducibility. The source code is released at https://github.com/liyj1201/OFCL.

Related papers

• Exploring Open-world Continual Learning with Knowns-Unknowns Knowledge Transfer [10.426450189369266]
  Open-World Continual Learning (OWCL) is a challenging paradigm where models must incrementally learn new knowledge without forgetting while operating under an open-world assumption.<n>We propose textbfHoliTrans (Holistic Knowns-Unknowns Knowledge Transfer), a novel OWCL framework that integrates nonlinear random projection (NRP) to create an adaptive knowledge space.
  arXiv  Detail & Related papers  (2025-02-27T14:16:01Z)
• Uncertainty Quantification in Continual Open-World Learning [5.268548403469063]
  In the field of continual learning, the reliance on novelty and labeling oracles is commonplace albeit unrealistic. We propose our method COUQ "Continual Open-world Uncertainty Quantification", an iterative uncertainty estimation algorithm tailored for learning. We demonstrate the effectiveness of our method across multiple datasets, ablations, backbones and performance superior to state-of-the-art.
  arXiv  Detail & Related papers  (2024-12-21T00:09:20Z)
• Few-Shot Class Incremental Learning with Attention-Aware Self-Adaptive Prompt [58.880105981772324]
  We propose a novel framework named Attention-aware Self-adaptive Prompt (ASP) ASP encourages task-invariant prompts to capture shared knowledge by reducing specific information from the attention aspect. In summary, ASP prevents overfitting on base task and does not require enormous data in few-shot incremental tasks.
  arXiv  Detail & Related papers  (2024-03-14T20:34:53Z)
• InfuserKI: Enhancing Large Language Models with Knowledge Graphs via Infuser-Guided Knowledge Integration [58.61492157691623]
  Methods for integrating knowledge have been developed, which augment LLMs with domain-specific knowledge graphs through external modules.<n>Our research focuses on a novel problem: efficiently integrating unknown knowledge into LLMs without unnecessary overlap of known knowledge.<n>A risk of introducing new knowledge is the potential forgetting of existing knowledge.
  arXiv  Detail & Related papers  (2024-02-18T03:36:26Z)
• Learning to Prompt Knowledge Transfer for Open-World Continual Learning [13.604171414847531]
  Pro-KT is a novel prompt-enhanced knowledge transfer model for Open-world Continual Learning. Pro-KT includes two key components: (1) a prompt bank to encode and transfer both task-generic and task-specific knowledge, and (2) a task-aware open-set boundary to identify unknowns in the new tasks.
  arXiv  Detail & Related papers  (2023-12-22T11:53:31Z)
• Open-CRB: Towards Open World Active Learning for 3D Object Detection [40.80953254074535]
  LiDAR-based 3D object detection has recently seen significant advancements through active learning (AL) In real-world deployments where streaming point clouds may include unknown or novel objects, the ability of current AL methods to capture such objects remains unexplored. This paper investigates a more practical and challenging research task: Open World Active Learning for 3D Object Detection (OWAL-3D)
  arXiv  Detail & Related papers  (2023-10-16T13:32:53Z)
• Recognizing Unseen Objects via Multimodal Intensive Knowledge Graph Propagation [68.13453771001522]
  We propose a multimodal intensive ZSL framework that matches regions of images with corresponding semantic embeddings. We conduct extensive experiments and evaluate our model on large-scale real-world data.
  arXiv  Detail & Related papers  (2023-06-14T13:07:48Z)
• Prompt-driven efficient Open-set Semi-supervised Learning [52.30303262499391]
  Open-set semi-supervised learning (OSSL) has attracted growing interest, which investigates a more practical scenario where out-of-distribution (OOD) samples are only contained in unlabeled data. We propose a prompt-driven efficient OSSL framework, called OpenPrompt, which can propagate class information from labeled to unlabeled data with only a small number of trainable parameters.
  arXiv  Detail & Related papers  (2022-09-28T16:25:08Z)
• Learning with Recoverable Forgetting [77.56338597012927]
  Learning wIth Recoverable Forgetting explicitly handles the task- or sample-specific knowledge removal and recovery. Specifically, LIRF brings in two innovative schemes, namely knowledge deposit and withdrawal. We conduct experiments on several datasets, and demonstrate that the proposed LIRF strategy yields encouraging results with gratifying generalization capability.
  arXiv  Detail & Related papers  (2022-07-17T16:42:31Z)
• A Review of Open-World Learning and Steps Toward Open-World Learning Without Labels [11.380522815465984]
  In open-world learning, an agent starts with a set of known classes, detects, and manages things that it does not know, and learns them over time from a non-stationary stream of data. This paper formalizes various open-world learning problems including open-world learning without labels.
  arXiv  Detail & Related papers  (2020-11-25T17:41:03Z)
• 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)

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.