Nov 2024· Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2· pp. 7432-7443· 0 citations· 94 references
Computer Science
TL;DR
This framework is the first to address catastrophic forgetting by leveraging models in CL as their own memory buffers by exploiting an implicit bias of gradient-based neural networks due to which these converge to margin maximization points.
Abstract
Continual learning (CL) aims to incrementally update machine learning models from a stream of data without forgetting previously acquired knowledge. CL is highly relevant in many real-world applications such as manufacturing, where storing historical data for retraining is often infeasible due to volume, governance, or system constraints. Yet, a common challenge in continual learning (CL) is catastrophic forgetting, where the performance on old tasks drops after new, additional tasks are learned. In this paper, we propose a novel framework called ReCL to slow down forgetting in CL. Our framework exploits an implicit bias of gradient-based neural networks due to which these converge to margin maximization points. Such convergence points allow us to reconstruct old data from previous tasks, which we then combine with the current training data. Our framework is flexible and can be applied on top of existing, state-of-the-art CL methods. We first demonstrate the performance gain from our framework across a large series of experiments on three established public CL datasets (MNIST, CIFAR10, TinyImageNet), a public industrial dataset (SECOM), and across two different scenarios (class incremental and domain incremental learning). Then, we evaluate the performance of ReCL for predictive maintenance in a manufacturing environment at Bosch, a global engineering company, using an internal real-world time-series feature dataset captured from a high-volume precision-machining process. Lastly, we apply our framework to streaming machine data from real-world industrial data at Bosch. Across all our experiments, we find large performance gains through ReCL. To the best of our knowledge, our framework is the first to address catastrophic forgetting by leveraging models in CL as their own memory buffers.
A central challenge in continual learning is to acquire new knowledge without forgetting what the model has already learned. This challenge appears in language model training when training data comes from various domain-, user-, or task-specific distributions that are encountered unevenly over time. In such settings, s...
Anton Baumann, Jonas Hübotter, Zeynep Akata et al.· 0 citations
We explore catastrophic forgetting in the context of large pre-trained models. By considering forgetting as a geometric problem in the input space of each weight matrix, we uncover a natural retention objective under which updates produced by gradient-based optimizers are suboptimal. Following this observation, we prop...
Assaf Ben-Kish, Akarsh Kumar, James R. Glass et al.· 0 citations
Introducing new capabilities to frontier models has long been the goal of posttraining, which predominantly employs supervised finetuning (SFT) and reinforcement learning (RL) to this end. Conventional wisdom dictates that RL enables strong generalization on new tasks without losing existing capabilities, while SFT is...
A long-standing goal of AI is a model that can continually learn and improve itself. On post-trained models, supervised finetuning (SFT) on new data often causes poor generalization and catastrophic forgetting. As such, the conventional wisdom is that on-policy training is a prerequisite for continual learning. In prac...
C. Wu, Thomas T. Zhang, Aditi Raghunathan· 0 citations
On-policy self-distillation (OPSD) of large language models (LLMs) has demonstrated the ability to improve reasoning capabilities while preserving previously acquired knowledge. Despite substantial empirical success, the dynamics of OPSD in continual reasoning remain incompletely understood. Modeling LLM reasoning as s...
LoRA-based continual learning methods mitigate catastrophic forgetting through various mechanisms, yet nearly all complement these with small learning rates as a heuristic to restrict gradient scaling magnitude. Such fixed heuristics lack theoretical guidance on how the strength of this restriction should evolve as tas...
Yuxuan Li, Fan-Hu Zeng, Hao Tang· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.