mlsanityData to 7 Oct 2026

Training-Free Knowledge Transfer Across Model Scales through Activation-Guided Pruning

arXiv 2608.13596 ↗First posted 31 Jul 2026cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Heterogeneous model fusion seeks to combine models that differ in tasks, initializations, architectures, or scales. We study an underexplored cross-scale setting: improving a small recipient language model with a stronger donor despite substantial architectural mismatch. We ask whether useful capabilities can be transferred without explicit neuron-wise semantic alignment. Building on the observation that truncating a large model to a smaller architecture and injecting it with a tiny mixing weight can already improve the recipient, we propose Activation-Prune-Merge (APM), an activation-guided framework for cross-scale fusion. APM constructs task-conditioned activation maps on the donor, selects salient layers, hidden dimensions, attention heads, and MLP neurons to prune it to the recipient architecture, and injects the resulting donor slice into the original recipient using a micro interpolation coefficient. This formulation treats the donor as a source of concentrated functional components rather than requiring precise structural transplantation. Across 16 benchmarks spanning reasoning, mathematics, code generation, instruction following, and classification, APM improves the overall average accuracy from 55.5% to 60.6% over the original 3B recipient. RTE accuracy increases from 64.3% to 82.3%, QNLI from 52.3% to 65.7%, and BoolQ from 70.8% to 79.2%. Analyses of injection ratios and sequential multi-stage fusion further suggest that activation-guided extraction improves the quality of the transferable donor slice while preserving the small-ratio fusion regime. These results provide evidence that cross-scale heterogeneous fusion can succeed without explicit semantic alignment when the donor contribution is sufficiently concentrated and carefully selected.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 27 of its 38 references that are in the map. First posted on arXiv 31 Jul 2026.

Builds on

27 of 38 references.

References · 27

  1. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  2. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  3. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  4. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  5. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  6. 2023Let's Verify Step by Stepcited by 3,598
  7. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  8. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
  9. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
  10. 2023Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generationcited by 1,332
  11. 2023TIES-Merging: Resolving Interference When Merging Modelscited by 795
  12. 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 780
15 more
  1. 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 679
  2. 2021Merging Models with Fisher-Weighted Averagingcited by 613
  3. 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 384
  4. 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
  5. 2023ZipIt! Merging Models from Different Tasks without Trainingcited by 178
  6. 2024Compact Language Models via Pruning and Knowledge Distillationcited by 142
  7. 2023Model Breadcrumbs: Scaling Multi-Task Model Merging with Sparse Maskscited by 130
  8. 2024Localizing Task Information for Improved Model Merging and Compressioncited by 130
  9. 2024What Matters for Model Merging at Scale?cited by 52
  10. 2024Localize-and-Stitch: Efficient Model Merging via Sparse Task Arithmeticcited by 50
  11. 2023Merging by Matching Models in Task Parameter Subspacescited by 36
  12. 2025MergeBench: A Benchmark for Merging Domain-Specialized LLMscited by 30
  13. 2025AdaMMS: Model Merging for Heterogeneous Multimodal Large Language Models with Unsupervised Coefficient Optimizationcited by 25
  14. 2024HM3: Heterogeneous Multi-Class Model Mergingcited by 3
  15. 2025SeMe: Training-Free Language Model Merging via Semantic Alignmentcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.