Pangu Light: Weight Re-Initialization for Pruning and Accelerating LLMs
Not on the map. Why?
Abstract (arXiv)
Large Language Models (LLMs) deliver state-of-the-art capabilities across numerous tasks, but their immense size and inference costs pose significant computational challenges for practical deployment. While structured pruning offers a promising avenue for model compression, existing methods often struggle with the detrimental effects of aggressive, simultaneous width and depth reductions, leading to substantial performance degradation. This paper argues that a critical, often overlooked, aspect in making such aggressive joint pruning viable is the strategic re-initialization and adjustment of remaining weights to improve the model post-pruning training accuracies. We introduce Pangu Light, a framework for LLM acceleration centered around structured pruning coupled with novel weight re-initialization techniques designed to address this ``missing piece''. Our framework systematically targets multiple axes, including model width, depth, attention heads, and RMSNorm, with its effectiveness rooted in novel re-initialization methods like Cross-Layer Attention Pruning (CLAP) and Stabilized LayerNorm Pruning (SLNP) that mitigate performance drops by providing the network a better training starting point. Further enhancing efficiency, Pangu Light incorporates specialized optimizations such as absorbing Post-RMSNorm computations and tailors its strategies to Ascend NPU characteristics. The Pangu Light models consistently exhibit a superior accuracy-efficiency trade-off, outperforming prominent baseline pruning methods like Nemotron and established LLMs like Qwen3 series. For instance, on Ascend NPUs, Pangu Light-32B's 81.6 average score and 2585 tokens/s throughput exceed Qwen3-32B's 80.9 average score and 2225 tokens/s.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 26 of its 27 references that are in the map. First posted on arXiv 26 May 2025.
Builds on
26 of 27 references.
References · 26
- 2023GPT-4 Technical Reportcited by 18,396
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2025Qwen3 Technical Reportcited by 8,820
- 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
- 2016Layer Normalizationcited by 5,669
- 2019Root Mean Square Layer Normalizationcited by 1,480
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 415
14 more
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 385
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 383
- 2024Compact Language Models via Pruning and Knowledge Distillationcited by 148
- 2024LaCo: Large Language Model Pruning via Layer Collapsecited by 126
- 2023Fluctuation-based Adaptive Structured Pruning for Large Language Modelscited by 111
- 2024Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methodscited by 82
- 2021bert2BERT: Towards Reusable Pretrained Language Modelscited by 70
- 2025Transformers without Normalizationcited by 70
- 2024SlimGPT: Layer-wise Structured Pruning for Large Language Modelscited by 44
- 2024Puzzle: Distillation-Based NAS for Inference-Optimized LLMscited by 17
- 2025Pangu Ultra: Pushing the Limits of Dense Large Language Models on Ascend NPUscited by 13
- 2024LoRAP: Transformer Sub-Layers Deserve Differentiated Structured Compression for Large Language Modelscited by 12
- 2024FastAttention: Extend FlashAttention2 to NPUs and Low-resource GPUscited by 3
- 2024From Pruning to Grafting: Dynamic Knowledge Redistribution via Learnable Layer Fusioncited by 2
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.