Where to Begin: Efficient Pretraining via Subnetwork Selection and Distillation
Not on the map. Why?
Abstract (arXiv)
Small Language models (SLMs) offer an efficient and accessible alternative to Large Language Models (LLMs), delivering strong performance while using far fewer resources. We introduce a simple and effective framework for pretraining SLMs that brings together three complementary ideas. First, we identify structurally sparse sub-network initializations that consistently outperform randomly initialized models of similar size under the same compute budget. Second, we use evolutionary search to automatically discover high-quality sub-network initializations, providing better starting points for pretraining. Third, we apply knowledge distillation from larger teacher models to speed up training and improve generalization. Together, these components make SLM pretraining substantially more efficient: our best model, discovered using evolutionary search and initialized with LLM weights, matches the validation perplexity of a comparable Pythia SLM while requiring 5.16x and 1.26x fewer floating point operations for token budgets of 10B and 100B, respectively. We release all code publicly, offering a practical and reproducible path toward cost-efficient small language model development at scale.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 48 of its 56 references that are in the map. First posted on arXiv 8 Oct 2025.
Builds on
48 of 56 references.
References · 48
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 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
- 2018DARTS: Differentiable Architecture Searchcited by 1,782
- 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,734
- 2025Gemma 3 Technical Reportcited by 1,686
- 2014FitNets: Hints for Thin Deep Netscited by 1,619
- 2016Neural Architecture Search with Reinforcement Learningcited by 1,489
36 more
- 2020MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformerscited by 1,414
- 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 778
- 2016Sequence-Level Knowledge Distillationcited by 761
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2019Importance Estimation for Neural Network Pruningcited by 531
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 408
- 2025SmolLM2: When Smol Goes Big -- Data-Centric Training of a Small Language Modelcited by 307
- 2024A Survey on Knowledge Distillation of Large Language Modelscited by 276
- 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
- 2019Searching for A Robust Neural Architecture in Four GPU Hourscited by 258
- 2020Proving the Lottery Ticket Hypothesis: Pruning is All You Needcited by 200
- 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 177
- 2019Understanding and Robustifying Differentiable Architecture Searchcited by 176
- 2019BANANAS: Bayesian Optimization with Neural Architectures for Neural Architecture Searchcited by 175
- 2024Nemotron-CC: Transforming Common Crawl into a Refined Long-Horizon Pretraining Datasetcited by 153
- 2018Efficient Multi-objective Neural Architecture Search via Lamarckian Evolutioncited by 151
- 2024Compact Language Models via Pruning and Knowledge Distillationcited by 142
- 2020HAT: Hardware-Aware Transformers for Efficient Natural Language Processingcited by 136
- 2023Neural Architecture Search: Insights from 1000 Paperscited by 136
- 2020When BERT Plays the Lottery, All Tickets Are Winningcited by 114
- 2023Fluctuation-based Adaptive Structured Pruning for Large Language Modelscited by 110
- 2019One ticket to win them all: generalizing lottery ticket initializations across datasets and optimizerscited by 102
- 2021HW-NAS-Bench:Hardware-Aware Neural Architecture Search Benchmarkcited by 83
- 2020NSGANetV2: Evolutionary Multi-Objective Surrogate-Assisted Neural Architecture Searchcited by 75
- 2019BayesNAS: A Bayesian Approach for Neural Architecture Searchcited by 67
- 2021Super Tickets in Pre-Trained Language Models: From Model Compression to Improving Generalizationcited by 56
- 2019Evaluating Lottery Tickets Under Distributional Shiftscited by 23
- 2021ProxyBO: Accelerating Neural Architecture Search via Bayesian Optimization with Zero-cost Proxiescited by 20
- 2021HELP: Hardware-Adaptive Efficient Latency Prediction for NAS via Meta-Learningcited by 16
- 2024HW-GPT-Bench: Hardware-Aware Architecture Benchmark for Language Modelscited by 10
- 2022Construction of Hierarchical Neural Architecture Search Spaces based on Context-free Grammarscited by 9
- 2024Structural Pruning of Pre-trained Language Models via Neural Architecture Searchcited by 5
- 2024DRPruning: Efficient Large Language Model Pruning through Distributionally Robust Optimizationcited by 5
Built on by
Citing papers per year: 2026: 1.
1 paper.