Activation-Guided Consensus Merging for Large Language Models

Zhijiang Guo (The Hong Kong University of Science and Technology (Guangzhou)) · Yuxuan Yao (City University of Hong Kong) · Shuqi LIU (Huawei Technologies Ltd.) · Zehua Liu (Huawei Technologies Ltd.) · Qintong Li (The University of Hong Kong) · Mingyang LIU (City University of Hong Kong) · Xiongwei Han · Han Wu (Huawei Technologies Ltd.) · Linqi Song (City University of Hong Kong)
activation-guided consensus mergingbaseline methodsfine-tuned modelsgeneral merging tasksgradient computationslayer-specific merging coefficientslong-to-short tasksmodel mergingmutual informationplug-and-play frameworkreasoning accuracyresponse length reductionsystem 1system 2task-specific capabilities

Recent research has increasingly focused on reconciling the reasoning capabilities of System 2 with the efficiency of System 1. While existing training-based and prompt-based approaches face significant challenges in terms of efficiency and stability, model merging emerges as a promising strategy to integrate the diverse capabilities of different Large Language Models (LLMs) into a unified model. However, conventional model merging methods often assume uniform importance across layers, overlooking the functional heterogeneity inherent in neural components. To address this limitation, we propose \textbf{A}ctivation-Guided \textbf{C}onsensus \textbf{M}erging (\textbf{ACM}), a plug-and-play merging framework that determines layer-specific merging coefficients based on mutual information between activations of pre-trained and fine-tuned models. ACM effectively preserves task-specific capabilities without requiring gradient computations or additional training. Extensive experiments on Long-to-Short (L2S) and general merging tasks demonstrate that ACM consistently outperforms all baseline methods. For instance, in the case of Qwen-7B models, TIES-Merging equipped with ACM achieves a \textbf{55.3\%} reduction in response length while simultaneously improving reasoning accuracy by \textbf{1.3} points. We submit the code with the paper for reproducibility, and it will be publicly available.