mlsanityData to 7 Oct 2026

Towards Continual Learning Desiderata via HSIC-Bottleneck Orthogonalization and Equiangular Embedding

arXiv 2401.09067 ↗First posted 17 Jan 2024cs.LG cs.AI cs.CVcited by 9

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

  1. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  2. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  3. 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,842
  4. 2016Progressive Neural Networkscited by 1,332
  5. 2021Learning to Prompt for Continual Learningcited by 938
  6. 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
  7. 2019Large Scale Incremental Learningcited by 727
  8. 2017Lifelong Learning with Dynamically Expandable Networkscited by 689
  9. 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 672
  10. 2019On Variational Bounds of Mutual Informationcited by 550
  11. 2018Progress & Compress: A scalable framework for continual learningcited by 516
  12. 2019Orthogonal Gradient Descent for Continual Learningcited by 361
24 more
  1. 2021Gradient Projection Memory for Continual Learningcited by 338
  2. 2021Co2L: Contrastive Continual Learningcited by 243
  3. 2020Mnemonics Training: Multi-Class Incremental Learning without Forgettingcited by 220
  4. 2021New Insights on Reducing Abrupt Representation Change in Online Continual Learningcited by 215
  5. 2019REMIND Your Neural Network to Prevent Catastrophic Forgettingcited by 197
  6. 2018Reinforced Continual Learningcited by 186
  7. 2018Continual Learning of Context-dependent Processing in Neural Networkscited by 178
  8. 2019Class-incremental Learning via Deep Model Consolidationcited by 172
  9. 2021Training Networks in Null Space of Feature Covariance for Continual Learningcited by 139
  10. 2019Scalable and Order-robust Continual Learning with Additive Parameter Decompositioncited by 125
  11. 2023How Does Information Bottleneck Help Deep Learning?cited by 92
  12. 2021Achieving Forgetting Prevention and Knowledge Transfer in Continual Learningcited by 91
  13. 2019The HSIC Bottleneck: Deep Learning without Back-Propagationcited by 77
  14. 2021Self-Supervised Learning with Kernel Dependence Maximizationcited by 77
  15. 2021Flattening Sharpness for Dynamic Gradient Projection Memory Benefits Continual Learningcited by 71
  16. 2023Better Generative Replay for Continual Federated Learningcited by 53
  17. 2018Fix your classifier: the marginal value of training the last weight layercited by 43
  18. 2022On the Effectiveness of Lipschitz-Driven Rehearsal in Continual Learningcited by 39
  19. 2020Class-incremental Learning with Pre-allocated Fixed Classifierscited by 33
  20. 2021Revisiting Hilbert-Schmidt Information Bottleneck for Adversarial Robustnesscited by 20
  21. 2022Incremental Learning of Structured Memory via Closed-Loop Transcriptioncited by 17
  22. 2023DualHSIC: HSIC-Bottleneck and Alignment for Continual Learningcited by 15
  23. 2022Continual Learning with Guarantees via Weight Interval Constraintscited by 10
  24. 2023IF2Net: Innately Forgetting-Free Networks for Continual Learningcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 4; 2025: 3; 2026: 2.

9 papers.