dorsal/arxiv
View SchemaMI-PRUN: Optimize Large Language Model Pruning via Mutual Information
| Authors | Hao Zhang, Zhibin Zhang, Guangxin Wu, He Chen, Jiafeng Guo, Xueqi Cheng |
|---|---|
| Categories | |
| ArXiv ID | 2601.07212vv1 |
| URL | https://arxiv.org/abs/2601.07212 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
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.
{
"annotation_id": "f3c28a21-8c3c-473f-a3ce-070a8e786556",
"date_created": "2026-02-17T05:53:11.760000Z",
"date_modified": "2026-02-17T05:53:11.760000Z",
"file_hash": "7ab6c86969e1fcb3c151d7fa5abae29d2bf344d83d0358d9bc21d35274c70ae3",
"private": false,
"record": {
"abstract": "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.",
"arxiv_id": "2601.07212",
"authors": [
"Hao Zhang",
"Zhibin Zhang",
"Guangxin Wu",
"He Chen",
"Jiafeng Guo",
"Xueqi Cheng"
],
"categories": [
"cs.CL"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "MI-PRUN: Optimize Large Language Model Pruning via Mutual Information",
"url": "https://arxiv.org/abs/2601.07212",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "716d21d7-182e-420b-995b-2220a96f99f1",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}