dorsal/arxiv
View SchemaMatchTIR: Fine-Grained Supervision for Tool-Integrated Reasoning via Bipartite Matching
| Authors | Changle Qu, Sunhao Dai, Hengyi Cai, Jun Xu, Shuaiqiang Wang, Dawei Yin |
|---|---|
| Categories | |
| ArXiv ID | 2601.10712vv1 |
| URL | https://arxiv.org/abs/2601.10712 |
| License | http://creativecommons.org/licenses/by-nc-nd/4.0/ |
Abstract
Tool-Integrated Reasoning (TIR) empowers large language models (LLMs) to tackle complex tasks by interleaving reasoning steps with external tool interactions. However, existing reinforcement learning methods typically rely on outcome- or trajectory-level rewards, assigning uniform advantages to all steps within a trajectory. This coarse-grained credit assignment fails to distinguish effective tool calls from redundant or erroneous ones, particularly in long-horizon multi-turn scenarios. To address this, we propose MatchTIR, a framework that introduces fine-grained supervision via bipartite matching-based turn-level reward assignment and dual-level advantage estimation. Specifically, we formulate credit assignment as a bipartite matching problem between predicted and ground-truth traces, utilizing two assignment strategies to derive dense turn-level rewards. Furthermore, to balance local step precision with global task success, we introduce a dual-level advantage estimation scheme that integrates turn-level and trajectory-level signals, assigning distinct advantage values to individual interaction turns. Extensive experiments on three benchmarks demonstrate the superiority of MatchTIR. Notably, our 4B model surpasses the majority of 8B competitors, particularly in long-horizon and multi-turn tasks. Our codes are available at https://github.com/quchangle1/MatchTIR.
{
"annotation_id": "6a913b03-2c7d-4de0-9667-9649e6a5cfee",
"date_created": "2026-02-17T05:53:26.459000Z",
"date_modified": "2026-02-17T05:53:26.459000Z",
"file_hash": "70204aa6fa6d11b78a3ed8210091a3cffb9ad93d1ee03f0167d24fba071a7b6a",
"private": false,
"record": {
"abstract": "Tool-Integrated Reasoning (TIR) empowers large language models (LLMs) to tackle complex tasks by interleaving reasoning steps with external tool interactions. However, existing reinforcement learning methods typically rely on outcome- or trajectory-level rewards, assigning uniform advantages to all steps within a trajectory. This coarse-grained credit assignment fails to distinguish effective tool calls from redundant or erroneous ones, particularly in long-horizon multi-turn scenarios. To address this, we propose MatchTIR, a framework that introduces fine-grained supervision via bipartite matching-based turn-level reward assignment and dual-level advantage estimation. Specifically, we formulate credit assignment as a bipartite matching problem between predicted and ground-truth traces, utilizing two assignment strategies to derive dense turn-level rewards. Furthermore, to balance local step precision with global task success, we introduce a dual-level advantage estimation scheme that integrates turn-level and trajectory-level signals, assigning distinct advantage values to individual interaction turns. Extensive experiments on three benchmarks demonstrate the superiority of MatchTIR. Notably, our 4B model surpasses the majority of 8B competitors, particularly in long-horizon and multi-turn tasks. Our codes are available at https://github.com/quchangle1/MatchTIR.",
"arxiv_id": "2601.10712",
"authors": [
"Changle Qu",
"Sunhao Dai",
"Hengyi Cai",
"Jun Xu",
"Shuaiqiang Wang",
"Dawei Yin"
],
"categories": [
"cs.CL",
"cs.AI"
],
"license": "http://creativecommons.org/licenses/by-nc-nd/4.0/",
"title": "MatchTIR: Fine-Grained Supervision for Tool-Integrated Reasoning via Bipartite Matching",
"url": "https://arxiv.org/abs/2601.10712",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "7c7aff3f-e7b1-423d-a758-d2302698251a",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}