Adiabatic replay for continual learning
Alexander Krawczyk, Alexander Gepperth · 2024
To avoid catastrophic forgetting, many replay-based approaches to continual learning (CL) require, for each learning phase with new data, the replay of samples representing all of the previously learned knowledge. Since this knowledge grows over time, such approaches invest linearly growing computational resources just for re-learning what is already known. In this proof-of-concept study, we propose a generative replay-based CL strategy that we term adiabatic replay (AR), which achieves CL in constant time and memory complexity by making use of the (very common) situation where each new learning phase is adiabatic, i.e., represents only a small addition to existing knowledge. The employed Gaussian Mixture Models (GMMs) are capable of selective updating only those parts of their internal representation affected by the new task. The information that would otherwise be overwritten by such updates is protected by selective replay of samples that are similar to newly arriving ones. Thus, the amount of to-be-replayed samples depends not at all on accumulated, but only on added knowledge, which is small by construction. Based on the challenging CIFAR and SVHN datasets in combination with pre-trained feature extractors, we confirm AR’s superior scaling behavior while showing better accuracy than common baselines in the field.