P2 Law: Scaling Law for Post-Training After Model Pruning
Not on the map. Why?
Abstract (arXiv)
Pruning has become a widely adopted technique for reducing the hardware requirements of large language models (LLMs). To recover model performance after pruning, post-training is commonly employed to mitigate the resulting performance degradation. While post-training benefits from larger datasets, once the dataset size is already substantial, increasing the training data provides only limited performance gains. To balance post-training cost and model performance, it is necessary to explore the optimal amount of post-training data.Through extensive experiments on the Llama-3 and Qwen-2.5 series models, pruned using various common pruning methods, we uncover the scaling Law for Post-training after model Pruning, referred to as the P2 Law.This law identifies four key factors for predicting the pruned model's post-training loss: the model size before pruning, the number of post-training tokens, the pruning rate, and the model's loss before pruning. Moreover, P2 Law can generalize to larger dataset sizes, larger model sizes, and higher pruning rates, offering valuable insights for the post-training of pruned LLMs.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 10 of its 19 references that are in the map. First posted on arXiv 15 Nov 2024.
Builds on
10 of 19 references.
References · 10
- 2017Attention Is All You Needcited by 60,361
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 385
- 2018An Empirical Model of Large-Batch Trainingcited by 281
- 2021Accelerating Sparse Deep Neural Networkscited by 223
- 2024LaCo: Large Language Model Pruning via Layer Collapsecited by 126
- 2024SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blockscited by 97
Built on by
Citing papers per year: 2026: 2.
2 papers.
- 2026Small LLMs: Pruning vs. Training from Scratchcited by 1
- 2026Capability Scaling-Down Laws for LLM Compressioncited by 0
- 2026Capability Scaling-Down Laws for LLM Compression1 Oct 2026
- 2026Small LLMs: Pruning vs. Training from Scratch12 Jun 2026