Deductive Verification of Chain-of-Thought ReasoningThanks: Qualcomm AI Research is an initiative of Qualcomm Technologies, Inc
Zhan Ling Thanks: Equal contribution Yunhao Fang Xuanlin Li Zhiao Huang Mingu Lee Affiliation: UC San Diego, Qualcomm AI Research Roland Memisevic Hao Su Affiliation: UC San Diego, Qualcomm AI Research
Abstract
Large Language Models (LLMs) significantly benefit from Chain-of-Thought (CoT) prompting in performing various reasoning tasks. While CoT allows models to produce more comprehensive reasoning processes, its emphasis on intermediate reasoning steps can inadvertently introduce hallucinations and accumulated errors, thereby limiting models’ ability to solve complex reasoning tasks. Inspired by how humans engage in careful and meticulous deductive logical reasoning processes to solve tasks, we seek to enable language models to perform explicit and rigorous deductive reasoning, and also ensure the trustworthiness of their reasoning process through self-verification. However, directly verifying the validity of an entire deductive reasoning process is challenging, even with advanced models like ChatGPT. In light of this, we propose to decompose a reasoning verification process into a series of step-by-step subprocesses, each only receiving their necessary context and premises. To facilitate this procedure, we propose Natural Program, a natural language-based deductive reasoning format. Our approach enables models to generate precise reasoning steps where subsequent steps are more rigorous
原文 arXiv:2306.03872;中英对照 + 大白话阅读 https://aha.fim.ai/paper/2306.03872v3