PANDA -- Patch And Distribution-Aware Augmentation for Long-Tailed Exemplar-Free Continual Learning
Not on the map. Why?
Abstract (arXiv)
Exemplar-Free Continual Learning (EFCL) restricts the storage of previous task data and is highly susceptible to catastrophic forgetting. While pre-trained models (PTMs) are increasingly leveraged for EFCL, existing methods often overlook the inherent imbalance of real-world data distributions. We discovered that real-world data streams commonly exhibit dual-level imbalances, dataset-level distributions combined with extreme or reversed skews within individual tasks, creating both intra-task and inter-task disparities that hinder effective learning and generalization. To address these challenges, we propose PANDA, a Patch-and-Distribution-Aware Augmentation framework that integrates seamlessly with existing PTM-based EFCL methods. PANDA amplifies low-frequency classes by using a CLIP encoder to identify representative regions and transplanting those into frequent-class samples within each task. Furthermore, PANDA incorporates an adaptive balancing strategy that leverages prior task distributions to smooth inter-task imbalances, reducing the overall gap between average samples across tasks and enabling fairer learning with frozen PTMs. Extensive experiments and ablation studies demonstrate PANDA's capability to work with existing PTM-based CL methods, improving accuracy and reducing catastrophic forgetting.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 26 of its 36 references that are in the map. First posted on arXiv 12 Nov 2025.
Builds on
26 of 36 references.
References · 26
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,884
- 2016Learning without Forgettingcited by 2,496
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
- 2017Improved Regularization of Convolutional Neural Networks with Cutoutcited by 1,628
- 2016Progressive Neural Networkscited by 1,361
- 2018Experience Replay for Continual Learningcited by 1,095
- 2019Learning Imbalanced Datasets with Label-Distribution-Aware Margin Losscited by 989
- 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 898
- 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 681
14 more
- 2022CODA-Prompt: COntinual Decomposed Attention-based Prompting for Rehearsal-Free Continual Learningcited by 450
- 2017Measuring Catastrophic Forgetting in Neural Networkscited by 360
- 2019On Tiny Episodic Memories in Continual Learningcited by 307
- 2018Selective Experience Replay for Lifelong Learningcited by 241
- 2024Continual Learning with Pre-Trained Models: A Surveycited by 154
- 2016Less-forgetting Learning in Deep Neural Networkscited by 97
- 2023FeCAM: Exploiting the Heterogeneity of Class Distributions in Exemplar-Free Continual Learningcited by 87
- 2020Incremental Learning In Online Scenariocited by 71
- 2022A Closer Look at Rehearsal-Free Continual Learningcited by 54
- 2023Weighted Ensemble Models Are Strong Continual Learnerscited by 42
- 2023Long-Tailed Continual Learning For Visual Food Recognitioncited by 20
- 2023Online Class-Incremental Learning For Real-World Food Image Classificationcited by 17
- 2024Enhanced Long-Tailed Recognition with Contrastive CutMix Augmentationcited by 7
- 2024Dynamically Anchored Prompting for Task-Imbalanced Continual Learningcited by 6
Built on by
Citing papers per year: 2026: 1.
1 paper.