Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2601.07212 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912817656889344 |
|---|---|
| author | Zhang, Hao Zhang, Zhibin Wu, Guangxin Chen, He Guo, Jiafeng Cheng, Xueqi |
| author_facet | Zhang, Hao Zhang, Zhibin Wu, Guangxin Chen, He Guo, Jiafeng Cheng, Xueqi |
| contents | Large Language Models (LLMs) have become indispensable across various domains, but this comes at the cost of substantial computational and memory resources. Model pruning addresses this by removing redundant components from models. In particular, block pruning can achieve significant compression and inference acceleration. However, existing block pruning methods are often unstable and struggle to attain globally optimal solutions. In this paper, we propose a mutual information based pruning method MI-PRUN for LLMs. Specifically, we leverages mutual information to identify redundant blocks by evaluating transitions in hidden states. Additionally, we incorporate the Data Processing Inequality (DPI) to reveal the relationship between the importance of entire contiguous blocks and that of individual blocks. Moreover, we develop the Fast-Block-Select algorithm, which iteratively updates block combinations to achieve a globally optimal solution while significantly improving the efficiency. Extensive experiments across various models and datasets demonstrate the stability and effectiveness of our method. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_07212 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | MI-PRUN: Optimize Large Language Model Pruning via Mutual Information Zhang, Hao Zhang, Zhibin Wu, Guangxin Chen, He Guo, Jiafeng Cheng, Xueqi Computation and Language Large Language Models (LLMs) have become indispensable across various domains, but this comes at the cost of substantial computational and memory resources. Model pruning addresses this by removing redundant components from models. In particular, block pruning can achieve significant compression and inference acceleration. However, existing block pruning methods are often unstable and struggle to attain globally optimal solutions. In this paper, we propose a mutual information based pruning method MI-PRUN for LLMs. Specifically, we leverages mutual information to identify redundant blocks by evaluating transitions in hidden states. Additionally, we incorporate the Data Processing Inequality (DPI) to reveal the relationship between the importance of entire contiguous blocks and that of individual blocks. Moreover, we develop the Fast-Block-Select algorithm, which iteratively updates block combinations to achieve a globally optimal solution while significantly improving the efficiency. Extensive experiments across various models and datasets demonstrate the stability and effectiveness of our method. |
| title | MI-PRUN: Optimize Large Language Model Pruning via Mutual Information |
| topic | Computation and Language |
| url | https://arxiv.org/abs/2601.07212 |