Efficient Paths and Dense Rewards: Probabilistic Flow Reasoning for Large Language Models
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908763998388224 |
|---|---|
| author | Liu, Yan Zhang, Feng Ma, Zhanyu Xu, Jun Gao, Jiuchong Hao, Jinghua He, Renqing Liu, Han Deng, Yangdong |
| author_facet | Liu, Yan Zhang, Feng Ma, Zhanyu Xu, Jun Gao, Jiuchong Hao, Jinghua He, Renqing Liu, Han Deng, Yangdong |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_09260 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Efficient Paths and Dense Rewards: Probabilistic Flow Reasoning for Large Language Models Liu, Yan Zhang, Feng Ma, Zhanyu Xu, Jun Gao, Jiuchong Hao, Jinghua He, Renqing Liu, Han Deng, Yangdong Artificial Intelligence 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. |
| title | Efficient Paths and Dense Rewards: Probabilistic Flow Reasoning for Large Language Models |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2601.09260 |