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

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Li, Yujie, Wang, Xiangkun, Yang, Xin, Bonsangue, Marcello, Zhang, Junbo, Li, Tianrui
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866913961644916736
author Li, Yujie
Wang, Xiangkun
Yang, Xin
Bonsangue, Marcello
Zhang, Junbo
Li, Tianrui
author_facet Li, Yujie
Wang, Xiangkun
Yang, Xin
Bonsangue, Marcello
Zhang, Junbo
Li, Tianrui
contents 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 that the proposed OFCL framework outperforms all baselines remarkably with practical importance and reproducibility. The source code is released at https://github.com/liyj1201/OFCL.
format Preprint
id arxiv_https___arxiv_org_abs_2502_20974
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Improving Open-world Continual Learning under the Constraints of Scarce Labeled Data
Li, Yujie
Wang, Xiangkun
Yang, Xin
Bonsangue, Marcello
Zhang, Junbo
Li, Tianrui
Machine Learning
Artificial Intelligence
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 that the proposed OFCL framework outperforms all baselines remarkably with practical importance and reproducibility. The source code is released at https://github.com/liyj1201/OFCL.
title Improving Open-world Continual Learning under the Constraints of Scarce Labeled Data
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2502.20974