Unlocking the Potential of Continual Model Merging: An ODE Perspective
Lihong Lin, Haidong Kang

TL;DR
This paper introduces an ODE-based approach for continual model merging that constructs low-loss paths in parameter space, reducing forgetting and improving performance in sequential task adaptation.
Contribution
It proposes a novel ODE-driven merging method that explicitly constructs transition paths respecting model connectivity, outperforming existing fixed-rule methods.
Findings
Achieves state-of-the-art results on CMM benchmarks.
Reduces forgetting in heterogeneous task importance scenarios.
Effectively constructs low-loss connecting paths in parameter space.
Abstract
Continual Model Merging (CMM) enables rapid customization of foundation models across sequentially arriving tasks, offering a scalable alternative to repeated retraining. However, existing merging rules lack explicit controllability over the allocation of learning capacity between previously learned capabilities and newly merged models. Consequently, as tasks are merged sequentially, this deficiency accumulates into severe forgetting, particularly in scenarios with heterogeneous task importance, where performance allocation becomes highly inconsistent. The key reason can be attributed to the fact that previous methods treat each task model as an isolated parameter point and apply fixed algebraic combinations, rather than explicitly constructing a transition that respects how independently trained models can be connected in parameter space. Motivated by mode connectivity, we assume that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
