常识推理
计算机科学
人工智能
推论
稳健性
因果推理
修剪
因果推理
结果(博弈论)
推理系统
自动推理
机器学习
机会主义推理
非单调逻辑
定性推理
基于模型的推理
演绎推理
对偶(语法数字)
推理规则
语言模型
因果模型
分析推理
安全性令牌
封面(代数)
自然语言
可达性
因果关系(物理学)
答疑
部分可观测马尔可夫决策过程
借记
秩(图论)
抽象
归纳推理
排名(信息检索)
自然语言处理
基于案例的推理
工作(物理)
适应性推理
干预(咨询)
质量(理念)
作者
Yu, Xiangning,Wang, Zhuohan,Yang, Linyi,Li, Haoxuan,Liu, Anjie,Xue, Xiao,Wang, Jun,Yang, Mengyue
出处
期刊:Cornell University - arXiv
日期:2025-06-11
标识
DOI:10.48550/arxiv.2506.09853
摘要
Chain-of-Thought (CoT) prompting plays an indispensable role in endowing large language models (LLMs) with complex reasoning capabilities. However, CoT currently faces two fundamental challenges: (1) Sufficiency, which ensures that the generated intermediate inference steps comprehensively cover and substantiate the final conclusion; and (2) Necessity, which identifies the inference steps that are truly indispensable for the soundness of the resulting answer. We propose a causal framework that characterizes CoT reasoning through the dual lenses of sufficiency and necessity. Incorporating causal Probability of Sufficiency and Necessity allows us not only to determine which steps are logically sufficient or necessary to the prediction outcome, but also to quantify their actual influence on the final reasoning outcome under different intervention scenarios, thereby enabling the automated addition of missing steps and the pruning of redundant ones. Extensive experimental results on various mathematical and commonsense reasoning benchmarks confirm substantial improvements in reasoning efficiency and reduced token usage without sacrificing accuracy. Our work provides a promising direction for improving LLM reasoning performance and cost-effectiveness.
科研通智能强力驱动
Strongly Powered by AbleSci AI