dorsal/arxiv
View SchemaEfficient Paths and Dense Rewards: Probabilistic Flow Reasoning for Large Language Models
| Authors | Yan Liu, Feng Zhang, Zhanyu Ma, Jun Xu, Jiuchong Gao, Jinghua Hao, Renqing He, Han Liu, Yangdong Deng |
|---|---|
| Categories | |
| ArXiv ID | 2601.09260vv1 |
| URL | https://arxiv.org/abs/2601.09260 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
High-quality chain-of-thought has demonstrated strong potential for unlocking the reasoning capabilities of large language models. However, current paradigms typically treat the reasoning process as an indivisible sequence, lacking an intrinsic mechanism to quantify step-wise information gain. This granularity gap manifests in two limitations: inference inefficiency from redundant exploration without explicit guidance, and optimization difficulty due to sparse outcome supervision or costly external verifiers. In this work, we propose CoT-Flow, a framework that reconceptualizes discrete reasoning steps as a continuous probabilistic flow, quantifying the contribution of each step toward the ground-truth answer. Built on this formulation, CoT-Flow enables two complementary methodologies: flow-guided decoding, which employs a greedy flow-based decoding strategy to extract information-efficient reasoning paths, and flow-based reinforcement learning, which constructs a verifier-free dense reward function. Experiments on challenging benchmarks demonstrate that CoT-Flow achieves a superior balance between inference efficiency and reasoning performance.
{
"annotation_id": "a4881ed4-9743-430e-871f-6c5af02538f6",
"date_created": "2026-02-17T05:53:20.536000Z",
"date_modified": "2026-02-17T05:53:20.536000Z",
"file_hash": "95fd8eff68e0e1c8a7e1fdbf7d0e1a60ea460d6a447ecc936e1db540a42e5c8e",
"private": false,
"record": {
"abstract": "High-quality chain-of-thought has demonstrated strong potential for unlocking the reasoning capabilities of large language models. However, current paradigms typically treat the reasoning process as an indivisible sequence, lacking an intrinsic mechanism to quantify step-wise information gain. This granularity gap manifests in two limitations: inference inefficiency from redundant exploration without explicit guidance, and optimization difficulty due to sparse outcome supervision or costly external verifiers. In this work, we propose CoT-Flow, a framework that reconceptualizes discrete reasoning steps as a continuous probabilistic flow, quantifying the contribution of each step toward the ground-truth answer. Built on this formulation, CoT-Flow enables two complementary methodologies: flow-guided decoding, which employs a greedy flow-based decoding strategy to extract information-efficient reasoning paths, and flow-based reinforcement learning, which constructs a verifier-free dense reward function. Experiments on challenging benchmarks demonstrate that CoT-Flow achieves a superior balance between inference efficiency and reasoning performance.",
"arxiv_id": "2601.09260",
"authors": [
"Yan Liu",
"Feng Zhang",
"Zhanyu Ma",
"Jun Xu",
"Jiuchong Gao",
"Jinghua Hao",
"Renqing He",
"Han Liu",
"Yangdong Deng"
],
"categories": [
"cs.AI"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Efficient Paths and Dense Rewards: Probabilistic Flow Reasoning for Large Language Models",
"url": "https://arxiv.org/abs/2601.09260",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "0868f1a2-f9e6-4d86-8bed-6ec7f2500ae9",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}