Do Pre-trained Models Benefit Equally in Continual Learning?
Kuan-Ying Lee, Yuanyi Zhong, Yu-Xiong Wang
TL;DR
This paper investigates whether pre-trained models add equal value across continual learning (CL) settings. It shows that benefits of pre-training vary substantially by CL algorithm, dataset complexity, and CL scenario, sometimes reversing algorithm rankings when initialization comes from pre-trained weights. A simple yet powerful baseline—Experience Replay (ER) with an ImageNet RN50 backbone plus a two-stage training pipeline—achieves strong, and often state-of-the-art, performance, underscoring the need to evaluate CL methods with pre-training in mind. Key takeaways include CLIP RN50's limited advantages in typical CL regimes and the pronounced forgetting reductions offered by self-supervised fine-tuning, suggesting hybrid approaches that blend self-supervision with supervised learning could be fruitful.
Abstract
Existing work on continual learning (CL) is primarily devoted to developing algorithms for models trained from scratch. Despite their encouraging performance on contrived benchmarks, these algorithms show dramatic performance drops in real-world scenarios. Therefore, this paper advocates the systematic introduction of pre-training to CL, which is a general recipe for transferring knowledge to downstream tasks but is substantially missing in the CL community. Our investigation reveals the multifaceted complexity of exploiting pre-trained models for CL, along three different axes, pre-trained models, CL algorithms, and CL scenarios. Perhaps most intriguingly, improvements in CL algorithms from pre-training are very inconsistent an underperforming algorithm could become competitive and even state-of-the-art when all algorithms start from a pre-trained model. This indicates that the current paradigm, where all CL methods are compared in from-scratch training, is not well reflective of the true CL objective and desired progress. In addition, we make several other important observations, including that CL algorithms that exert less regularization benefit more from a pre-trained model; and that a stronger pre-trained model such as CLIP does not guarantee a better improvement. Based on these findings, we introduce a simple yet effective baseline that employs minimum regularization and leverages the more beneficial pre-trained model, coupled with a two-stage training pipeline. We recommend including this strong baseline in the future development of CL algorithms, due to its demonstrated state-of-the-art performance.
