DRPruning: Efficient Large Language Model Pruning through Distributionally Robust Optimization

Hexuan Deng, Wenxiang Jiao, Xuebo Liu, Jing Li, Min Zhang +1 more
11/21/2024
cs.CL

Official code: hexuandeng/DRPruning (8 stars, MIT, last commit 2026-02-04).

Abstract

Large language models (LLMs) deliver impressive results but face challenges from increasing model sizes and computational costs. Structured pruning reduces model size and speeds up inference but often causes uneven degradation across domains, leading to biased performance. To address this, we propose DRPruning, a method that dynamically adjusts the data distribution during training to restore balanced performance across heterogeneous and multi-tasking data. Experiments in monolingual and multilingual settings show that DRPruning surpasses similarly sized models in both pruning and continued pretraining over perplexity, downstream tasks, and instruction tuning. Further analysis demonstrates the robustness of DRPruning towards various domains and distribution shifts. Furthermore, DRPruning can determine optimal reference losses and data ratios automatically, suggesting potential for broader applications. Code and scripts are available at https://github.com/hexuandeng/DRPruning.

View on arXivView PDF

Code Implementations(1)

MIT

Implementation for our paper “DRPruning: Efficient Large Language Model Pruning through Distributionally Robust Optimization,” accepted to the Main Conference of ACL 2025. 🎉

80Shell, PythonOct 15, 20248 months agoMIT
data-centricdroefficiencyllamallm+4 more

Similar Papers

Cite this paper

@article{deng2024drpruning,
  title  = {DRPruning: Efficient Large Language Model Pruning through Distributionally Robust Optimization},
  author = {Hexuan Deng and Wenxiang Jiao and Xuebo Liu and Jing Li and Min Zhang and Zhaopeng Tu},
  year   = {2024},
  eprint = {2411.14055},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2411.14055v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2411.14055.svg)](https://codeofpaper.com/paper/2411.14055)

Discussion