dorsal/arxiv
View SchemaENTRA: Entropy-Based Redundancy Avoidance in Large Language Model Reasoning
| Authors | Ruichu Cai, Haopeng Du, Qingwen Lin, Yutong Chen, Zijian Li, Boyan Xu |
|---|---|
| Categories | |
| ArXiv ID | 2601.07123vv1 |
| URL | https://arxiv.org/abs/2601.07123 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
Large Reasoning Models (LRMs) often suffer from overthinking, generating unnecessarily long reasoning chains even for simple tasks. This leads to substantial computational overhead with limited performance gain, primarily due to redundant verification and repetitive generation. While prior work typically constrains output length or optimizes correctness, such coarse supervision fails to guide models toward concise yet accurate inference. In this paper, we propose ENTRA, an entropy-based training framework that suppresses redundant reasoning while preserving performance. ENTRA first estimates the token-level importance using a lightweight Bidirectional Importance Estimation (BIE) method, which accounts for both prediction confidence and forward influence. It then computes a redundancy reward based on the entropy of low-importance tokens, normalized by its theoretical upper bound, and optimizes this reward via reinforcement learning. Experiments on mathematical reasoning benchmarks demonstrate that ENTRA reduces output length by 37% to 53% with no loss-and in some cases, gains-in accuracy. Our approach offers a principled and efficient solution to reduce overthinking in LRMs, and provides a generalizable path toward redundancy-aware reasoning optimization.
{
"annotation_id": "16cd9c1b-58b6-41fc-978f-851175dbc267",
"date_created": "2026-02-17T05:53:11.269000Z",
"date_modified": "2026-02-17T05:53:11.269000Z",
"file_hash": "97312165684ff5bb3e9709bf47897a7ad4dc3666612cf5f640ea1ee1f2470a55",
"private": false,
"record": {
"abstract": "Large Reasoning Models (LRMs) often suffer from overthinking, generating unnecessarily long reasoning chains even for simple tasks. This leads to substantial computational overhead with limited performance gain, primarily due to redundant verification and repetitive generation. While prior work typically constrains output length or optimizes correctness, such coarse supervision fails to guide models toward concise yet accurate inference. In this paper, we propose ENTRA, an entropy-based training framework that suppresses redundant reasoning while preserving performance. ENTRA first estimates the token-level importance using a lightweight Bidirectional Importance Estimation (BIE) method, which accounts for both prediction confidence and forward influence. It then computes a redundancy reward based on the entropy of low-importance tokens, normalized by its theoretical upper bound, and optimizes this reward via reinforcement learning. Experiments on mathematical reasoning benchmarks demonstrate that ENTRA reduces output length by 37% to 53% with no loss-and in some cases, gains-in accuracy. Our approach offers a principled and efficient solution to reduce overthinking in LRMs, and provides a generalizable path toward redundancy-aware reasoning optimization.",
"arxiv_id": "2601.07123",
"authors": [
"Ruichu Cai",
"Haopeng Du",
"Qingwen Lin",
"Yutong Chen",
"Zijian Li",
"Boyan Xu"
],
"categories": [
"cs.AI"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "ENTRA: Entropy-Based Redundancy Avoidance in Large Language Model Reasoning",
"url": "https://arxiv.org/abs/2601.07123",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "b9fe4dcf-c954-4a0a-8c07-86a8839e19bc",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}