Revisiting Model Interpolation for Efficient Reasoning
Taiqiang Wu, Runming Yang, Tao Liu, Jiahao Wang, Ngai Wong
TL;DR
This work investigates efficient reasoning in large language models by revisiting a simple weight interpolation (MI) strategy that blends Thinking (long CoT) and Instruct (short responses) variants. It reveals a consistent three-stage dynamic as the interpolation coefficient $\lambda$ sweeps from 0 to 1, guiding when reasoning emerges and when overthinking occurs. Across 4B and 30B Qwen models, strategically chosen MI configurations surpass advanced merging baselines on math, instruction-following, and science-reasoning benchmarks, while also offering token-efficiency advantages. Extensive ablations map the contributions of layers, Transformer modules, and decoding choices, providing a practical framework for constructing reasoning behaviors with targeted token budgets. The findings offer a scalable, interpretable approach to model merging with broad implications for efficient, controllable reasoning in LLMs.
Abstract
Model merging, typically on Instruct and Thinking models, has shown remarkable performance for efficient reasoning. In this paper, we systematically revisit the simplest merging method that interpolates two weights directly. Particularly, we observe that model interpolation follows a three-stage evolutionary paradigm with distinct behaviors on the reasoning trajectory. These dynamics provide a principled guide for navigating the performance-cost trade-off. Empirical results demonstrate that a strategically interpolated model surprisingly surpasses sophisticated model merging baselines on both efficiency and effectiveness. We further validate our findings with extensive ablation studies on model layers, modules, and decoding strategies. Ultimately, this work demystifies model interpolation and offers a practical framework for crafting models with precisely targeted reasoning capabilities. Code is available at \href{https://github.com/wutaiqiang/MI}{Github}.
