Continual learning is a promising machine learning paradigm to learn new tasks while retaining previously learned knowledge over streaming training data. Till now, rehearsal-based methods, keeping a small part of data from old tasks as a memory buffer, have shown good performance in mitigating catastrophic forgetting for previously learned knowledge. However, most of these methods typically treat each new task equally, which may not adequately consider the relationship or similarity between old and new tasks. Furthermore, these methods commonly neglect sample importance in the continual training process and result in sub-optimal performance on certain tasks. To address this challenging problem, we propose Relational Experience Replay (RER), a bi-level learning framework, to adaptively tune task-wise relationships and sample importance within each task to achieve a better ‘stability’ and ‘plasticity’ trade-off. As such, the proposed method is capable of accumulating new knowledge while consolidating previously learned old knowledge during continual learning. Extensive experiments conducted on three benchmark image datasets (CIFAR-10, CIFAR-100, and Tiny ImageNet) and two text datasets (20News and DBpedia) show that the proposed method can consistently improve the performance of all baselines and surpass current state-of-the-art methods.
10 April 2026 in IEEE Transactions on Circuits and Systems for Video Technology
Class-Incremental Learning (CIL) aims to prevent catastrophic forgetting of previously learned classes while sequentially incorporating new ones. Few-shot CIL (FSCIL) presents a more challenging setting by introducing novel classes with only a few labeled examples, which significantly increases the risk of overfitting beyond the standard challenges faced in CIL. While catastrophic forgetting has been extensively studied, overfitting in FSCIL, especially when using large foundation models, has received comparatively limited attention. To fill this gap, we propose Singular Value Fine-tuning for FSCIL (SVFCL) and compare it with existing Parameter Efficient Fine-Tuning (PEFT) methods like prompt tuning and Low-Rank Adaptation (LoRA). Specifically, SVFCL applies singular value decomposition to the foundation model weights. For each task, the singular vectors are kept fixed while only the singular values are fine-tuned, and the updated singular values are subsequently merged to obtain the adapted model. This simple yet effective approach not only alleviates the problem of catastrophic forgetting but also mitigates overfitting more effectively by significantly reducing the number of trainable parameters. The effectiveness of SVFCL is validated through extensive experiments on four benchmark datasets, accompanied by thorough ablation studies and in-depth discussions.
Automated pavement distress classification using high-resolution Unmanned Aerial Vehicle (UAV) imagery is pivotal for intelligent transportation systems. However, long-term UAV monitoring faces a continuous stream of evolving distress types and changing remote sensing background textures, necessitating Class-Incremental Learning (CIL) capabilities. Existing methods struggle to balance stability and plasticity, especially under the severe storage limitations typical of local edge stations in air–ground collaborative systems. This data scarcity leads to catastrophic forgetting and confusion among fine-grained distress categories. To address these challenges, we propose a data-efficient approach named Analytic Geometric Alignment (AGA). Our framework mainly consists of three key components. First, to overcome the optimization gap between the feature extractor and the fixed geometric target, we introduce a Subspace-Aware Analytic Initialization (SAI) that computes a closed-form projection to instantly align the feature subspace with the ETF manifold before each task training. Second, on this aligned basis, a Decoupled Geometric Adapter (DGA) is incorporated to facilitate continuous non-linear adaptation to complex aerial textures. Finally, for stable incremental training, we design a Memory-Prioritized Regression (MPR) loss to enforce tighter geometric constraints on replay samples, significantly enhancing model stability. Extensive experiments on the UAV-PDD2023 dataset demonstrate that AGA significantly outperforms state-of-the-art methods, showcasing excellent robustness and data efficiency.
Online continual learning (CL) aims to learn new knowledge and consolidate previously learned knowledge from non-stationary data streams. Due to the time-varying training setting, the model learned from a changing distribution easily forgets the previously learned knowledge and biases toward the newly received task. To address this problem, we propose a Continual Bias Adaptor (CBA) module to augment the classifier network to adapt to catastrophic distribution change during training, such that the classifier network is able to learn a stable consolidation of previously learned tasks. In the testing stage, CBA can be removed which introduces no additional computation cost and memory overhead. We theoretically reveal the reason why the proposed method can effectively alleviate catastrophic distribution shifts, and empirically demonstrate its effectiveness through extensive experiments based on four rehearsal-based baselines and three public continual learning benchmarks.
In online continual learning (CL), models trained on changing distributions easily forget previously learned knowledge and bias toward newly received tasks. To address this issue, we present Continual Bias Adaptor (CBA), a bi-level framework that augments the classification network to adapt to catastrophic distribution shifts during training, enabling the network to achieve a stable consolidation of all seen tasks. However, the CBA module adjusts distribution shifts in a class-specific manner, exacerbating the stability gap issue and, to some extent, fails to meet the need for continual testing in online CL. To mitigate this challenge, we further propose a novel class-agnostic CBA module that separately aggregates the posterior probabilities of classes from new and old tasks, and applies a stable adjustment to the resulting posterior probabilities. We combine the two kinds of CBA modules into a unified Dual-CBA module, which thus is capable of adapting to catastrophic distribution shifts and simultaneously meets the real-time testing requirements of online CL. Besides, we propose Incremental Batch Normalization (IBN), a tailored BN module to re-estimate its population statistics for alleviating the feature bias arising from the inner loop optimization problem of our bi-level framework. To validate the effectiveness of the proposed method, we theoretically provide some insights into how it mitigates catastrophic distribution shifts, and empirically demonstrate its superiority through extensive experiments based on four rehearsal-based baselines and three public continual learning benchmarks.