Boomerang Distillation Enables Zero-Shot Model Size Interpolation
Not on the map. Why?
Abstract (arXiv)
Large language models (LLMs) are typically deployed under diverse memory and compute constraints. Existing approaches build model families by training each size independently, which is prohibitively expensive and provides only coarse-grained size options. In this work, we identify a novel phenomenon that we call boomerang distillation: starting from a large base model (the teacher), one first distills down to a small student and then progressively reconstructs intermediate-sized models by re-incorporating blocks of teacher layers into the student without any additional training. This process produces zero-shot interpolated models of many intermediate sizes whose performance scales smoothly between the student and teacher, often matching or surpassing pretrained or distilled models of the same size. We further analyze when this type of interpolation succeeds, showing that alignment between teacher and student through pruning and distillation is essential. Boomerang distillation thus provides a simple and efficient way to generate fine-grained model families, dramatically reducing training cost while enabling flexible adaptation across deployment environments. The code and models are available at https://github.com/dcml-lab/boomerang-distillation.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 61 of its 77 references that are in the map. First posted on arXiv 6 Oct 2025.
Builds on
61 of 77 references.
References · 61
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2025Qwen3 Technical Reportcited by 8,195
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2023DINOv2: Learning Robust Visual Features without Supervisioncited by 7,764
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
38 more
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2022Robust Speech Recognition via Large-Scale Weak Supervisioncited by 3,972
- 2025Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilitiescited by 3,655
- 2023Mistral 7Bcited by 3,065
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,346
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,928
- 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameterscited by 1,928
- 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,734
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
- 2025s1: Simple test-time scalingcited by 1,311
- 2025DINOv3cited by 1,297
- 2023Instruction-Following Evaluation for Large Language Modelscited by 1,143
- 2022Editing Models with Task Arithmeticcited by 1,076
- 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 851
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 795
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 408
- 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 384
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 369
- 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 302
- 2022Confident Adaptive Language Modelingcited by 297
- 2022Matryoshka Representation Learningcited by 268
- 2021Sustainable AI: Environmental Implications, Challenges and Opportunitiescited by 242
- 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 231
- 2024The Unreasonable Ineffectiveness of the Deeper Layerscited by 219
- 2019Model Fusion via Optimal Transportcited by 217
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2023ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Modelscited by 156
- 2023Concept Sliders: LoRA Adaptors for Precise Control in Diffusion Modelscited by 148
- 2024Compact Language Models via Pruning and Knowledge Distillationcited by 142
50 most cited of 61 All 61 (JSON)
Built on by
Citing papers per year: 2026: 2.
2 papers.