Towards Continual Learning Desiderata via HSIC-Bottleneck Orthogonalization and Equiangular Embedding
Not on the map. Why?
Abstract (arXiv)
Deep neural networks are susceptible to catastrophic forgetting when trained on sequential tasks. Various continual learning (CL) methods often rely on exemplar buffers or/and network expansion for balancing model stability and plasticity, which, however, compromises their practical value due to privacy and memory concerns. Instead, this paper considers a strict yet realistic setting, where the training data from previous tasks is unavailable and the model size remains relatively constant during sequential training. To achieve such desiderata, we propose a conceptually simple yet effective method that attributes forgetting to layer-wise parameter overwriting and the resulting decision boundary distortion. This is achieved by the synergy between two key components: HSIC-Bottleneck Orthogonalization (HBO) implements non-overwritten parameter updates mediated by Hilbert-Schmidt independence criterion in an orthogonal space and EquiAngular Embedding (EAE) enhances decision boundary adaptation between old and new tasks with predefined basis vectors. Extensive experiments demonstrate that our method achieves competitive accuracy performance, even with absolute superiority of zero exemplar buffer and 1.02x the base model.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 36 of its 61 references that are in the map. First posted on arXiv 17 Jan 2024.
Builds on
36 of 61 references.
References · 36
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,842
- 2016Progressive Neural Networkscited by 1,332
- 2021Learning to Prompt for Continual Learningcited by 938
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
- 2019Large Scale Incremental Learningcited by 727
- 2017Lifelong Learning with Dynamically Expandable Networkscited by 689
- 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 672
- 2019On Variational Bounds of Mutual Informationcited by 550
- 2018Progress & Compress: A scalable framework for continual learningcited by 516
- 2019Orthogonal Gradient Descent for Continual Learningcited by 361
24 more
- 2021Gradient Projection Memory for Continual Learningcited by 338
- 2021Co2L: Contrastive Continual Learningcited by 243
- 2020Mnemonics Training: Multi-Class Incremental Learning without Forgettingcited by 220
- 2021New Insights on Reducing Abrupt Representation Change in Online Continual Learningcited by 215
- 2019REMIND Your Neural Network to Prevent Catastrophic Forgettingcited by 197
- 2018Reinforced Continual Learningcited by 186
- 2018Continual Learning of Context-dependent Processing in Neural Networkscited by 178
- 2019Class-incremental Learning via Deep Model Consolidationcited by 172
- 2021Training Networks in Null Space of Feature Covariance for Continual Learningcited by 139
- 2019Scalable and Order-robust Continual Learning with Additive Parameter Decompositioncited by 125
- 2023How Does Information Bottleneck Help Deep Learning?cited by 92
- 2021Achieving Forgetting Prevention and Knowledge Transfer in Continual Learningcited by 91
- 2019The HSIC Bottleneck: Deep Learning without Back-Propagationcited by 77
- 2021Self-Supervised Learning with Kernel Dependence Maximizationcited by 77
- 2021Flattening Sharpness for Dynamic Gradient Projection Memory Benefits Continual Learningcited by 71
- 2023Better Generative Replay for Continual Federated Learningcited by 53
- 2018Fix your classifier: the marginal value of training the last weight layercited by 43
- 2022On the Effectiveness of Lipschitz-Driven Rehearsal in Continual Learningcited by 39
- 2020Class-incremental Learning with Pre-allocated Fixed Classifierscited by 33
- 2021Revisiting Hilbert-Schmidt Information Bottleneck for Adversarial Robustnesscited by 20
- 2022Incremental Learning of Structured Memory via Closed-Loop Transcriptioncited by 17
- 2023DualHSIC: HSIC-Bottleneck and Alignment for Continual Learningcited by 15
- 2022Continual Learning with Guarantees via Weight Interval Constraintscited by 10
- 2023IF2Net: Innately Forgetting-Free Networks for Continual Learningcited by 3
Built on by
Citing papers per year: 2024: 4; 2025: 3; 2026: 2.
9 papers.
- 2024Multi-Task Model Merging via Adaptive Weight Disentanglementcited by 22
- 2024Dynamic Integration of Task-Specific Adapters for Class Incremental Learningcited by 11
- 2025Soup to go: mitigating forgetting during continual learning with model averagingcited by 11
- 2024Class-incremental Learning for Time Series: Benchmark and Evaluationcited by 9
- 2025On the Discrimination and Consistency for Exemplar-Free Class Incremental Learningcited by 8
- 2024Harnessing Neural Unit Dynamics for Effective and Scalable Class-Incremental Learningcited by 4
- 2025Towards Robust Incremental Learning under Ambiguous Supervisioncited by 0
- 2026GR4CIL: Gap-compensated Routing for CLIP-based Class Incremental Learningcited by 0
- 2026RMB: Reward Model Boosting Mitigates Reward Hackingcited by 0
- 2026RMB: Reward Model Boosting Mitigates Reward Hacking27 Sep 2026
- 2026GR4CIL: Gap-compensated Routing for CLIP-based Class Incremental Learning20 Apr 2026
- 2025On the Discrimination and Consistency for Exemplar-Free Class Incremental Learning26 Jan 2025
- 2025Towards Robust Incremental Learning under Ambiguous Supervision23 Jan 2025
- 2025Soup to go: mitigating forgetting during continual learning with model averaging9 Jan 2025
- 2024Multi-Task Model Merging via Adaptive Weight Disentanglement27 Nov 2024
- 2024Dynamic Integration of Task-Specific Adapters for Class Incremental Learning23 Sep 2024
- 2024Harnessing Neural Unit Dynamics for Effective and Scalable Class-Incremental Learning4 Jun 2024
- 2024Class-incremental Learning for Time Series: Benchmark and Evaluation19 Feb 2024