Topological Continual Learning with Wasserstein Distance and Barycenter
Not on the map. Why?
Abstract (arXiv)
Continual learning in neural networks suffers from a phenomenon called catastrophic forgetting, in which a network quickly forgets what was learned in a previous task. The human brain, however, is able to continually learn new tasks and accumulate knowledge throughout life. Neuroscience findings suggest that continual learning success in the human brain is potentially associated with its modular structure and memory consolidation mechanisms. In this paper we propose a novel topological regularization that penalizes cycle structure in a neural network during training using principled theory from persistent homology and optimal transport. The penalty encourages the network to learn modular structure during training. The penalization is based on the closed-form expressions of the Wasserstein distance and barycenter for the topological features of a 1-skeleton representation for the network. Our topological continual learning method combines the proposed regularization with a tiny episodic memory to mitigate forgetting. We demonstrate that our method is effective in both shallow and deep network architectures for multiple image classification datasets.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 55 references that are in the map. First posted on arXiv 6 Oct 2022.
Builds on
21 of 55 references.
References · 21
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
- 2016Matching Networks for One Shot Learningcited by 2,255
- 2017Gradient Episodic Memory for Continual Learningcited by 1,898
- 2017Continual Learning with Deep Generative Replaycited by 1,158
- 2018Efficient Lifelong Learning with A-GEMcited by 1,058
- 2017Lifelong Learning with Dynamically Expandable Networkscited by 694
- 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 681
- 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 521
- 2019Learn to Grow: A Continual Structure Learning Framework for Overcoming Catastrophic Forgettingcited by 302
9 more
- 2018Reinforced Continual Learningcited by 186
- 2015A roadmap for the computation of persistent homologycited by 127
- 2019PersLay: A Neural Network Layer for Persistence Diagrams and New Graph Topological Signaturescited by 126
- 2019Scalable and Order-robust Continual Learning with Additive Parameter Decompositioncited by 125
- 2020Continual Learning in Low-rank Orthogonal Subspacescited by 99
- 2019Graph Filtration Learningcited by 69
- 2020Learning Visual Commonsense for Robust Scene Graph Generationcited by 47
- 2022Continual Learning with Recursive Gradient Optimizationcited by 32
- 2021Fast Topological Clustering with Wasserstein Distancecited by 5
Built on by
Not cited yet.