LGAIJun 29, 2023

Improving Online Continual Learning Performance and Stability with Temporal Ensembles

arXiv:2306.16817v218 citationsh-index: 66
Originality Incremental advance
AI Analysis

This work addresses stability and performance issues in online continual learning for neural networks, which is an incremental improvement over prior replay methods.

The paper tackles the problem of performance degradation and instability in online continual learning due to limited data availability and catastrophic forgetting, showing that using a lightweight temporal ensemble based on exponential moving average of weights can drastically increase performance and stability when combined with existing methods.

Neural networks are very effective when trained on large datasets for a large number of iterations. However, when they are trained on non-stationary streams of data and in an online fashion, their performance is reduced (1) by the online setup, which limits the availability of data, (2) due to catastrophic forgetting because of the non-stationary nature of the data. Furthermore, several recent works (Caccia et al., 2022; Lange et al., 2023) arXiv:2205.13452 showed that replay methods used in continual learning suffer from the stability gap, encountered when evaluating the model continually (rather than only on task boundaries). In this article, we study the effect of model ensembling as a way to improve performance and stability in online continual learning. We notice that naively ensembling models coming from a variety of training tasks increases the performance in online continual learning considerably. Starting from this observation, and drawing inspirations from semi-supervised learning ensembling methods, we use a lightweight temporal ensemble that computes the exponential moving average of the weights (EMA) at test time, and show that it can drastically increase the performance and stability when used in combination with several methods from the literature.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes