🤖 AI Summary
In continual learning, balancing stability (resistance to forgetting) and plasticity (capacity to acquire new knowledge) remains a fundamental challenge. Existing gradient projection methods preserve stability at the expense of plasticity, while model merging approaches—though promising—often rely on heuristic assumptions and manual hyperparameter tuning. This paper introduces the first Bayesian-driven adaptive model fusion framework: it integrates Bayesian continual learning principles into model merging and derives task-adaptive, closed-form optimal fusion coefficients via rigorous theoretical analysis, eliminating hyperparameter sensitivity and empirical design. Our method synergistically combines gradient projection with a two-stage collaborative optimization. Evaluated on multiple standard benchmarks, it consistently outperforms state-of-the-art methods and mainstream merging strategies, achieving superior stability and plasticity simultaneously—thereby effectively mitigating catastrophic forgetting and enhancing generalization on novel tasks.
📝 Abstract
Continual Learning (CL) strives to learn incrementally across tasks while mitigating catastrophic forgetting. A key challenge in CL is balancing stability (retaining prior knowledge) and plasticity (learning new tasks). While representative gradient projection methods ensure stability, they often limit plasticity. Model merging techniques offer promising solutions, but prior methods typically rely on empirical assumptions and carefully selected hyperparameters. In this paper, we explore the potential of model merging to enhance the stability-plasticity trade-off, providing theoretical insights that underscore its benefits. Specifically, we reformulate the merging mechanism using Bayesian continual learning principles and derive a closed-form solution for the optimal merging coefficient that adapts to the diverse characteristics of tasks. To validate our approach, we introduce a two-stage framework named BECAME, which synergizes the expertise of gradient projection and adaptive merging. Extensive experiments show that our approach outperforms state-of-the-art CL methods and existing merging strategies.