Question Decomposition Improves the Faithfulness of Model-Generated Reasoning

Ansh Radhakrishnan, Karina Nguyen, Anna Chen, Carol Chen, Carson Denison +19 more
7/17/2023
cs.CLcs.AIcs.LG

No official code found. Best implementation: anthropics/DecompositionFaithfulnessPaper (31 stars, last commit 2023-07-17).

Abstract

As large language models (LLMs) perform more difficult tasks, it becomes harder to verify the correctness and safety of their behavior. One approach to help with this issue is to prompt LLMs to externalize their reasoning, e.g., by having them generate step-by-step reasoning as they answer a question (Chain-of-Thought; CoT). The reasoning may enable us to check the process that models use to perform tasks. However, this approach relies on the stated reasoning faithfully reflecting the model's actual reasoning, which is not always the case. To improve over the faithfulness of CoT reasoning, we have models generate reasoning by decomposing questions into subquestions. Decomposition-based methods achieve strong performance on question-answering tasks, sometimes approaching that of CoT while improving the faithfulness of the model's stated reasoning on several recently-proposed metrics. By forcing the model to answer simpler subquestions in separate contexts, we greatly increase the faithfulness of model-generated reasoning over CoT, while still achieving some of the performance gains of CoT. Our results show it is possible to improve the faithfulness of model-generated reasoning; continued improvements may lead to reasoning that enables us to verify the correctness and safety of LLM behavior.

View on arXivView PDF

Code Implementations(1)

318PythonJul 10, 20233 years ago

Similar Papers

Cite this paper

@article{radhakrishnan2023question,
  title  = {Question Decomposition Improves the Faithfulness of Model-Generated Reasoning},
  author = {Ansh Radhakrishnan and Karina Nguyen and Anna Chen and Carol Chen and Carson Denison and Danny Hernandez and Esin Durmus and Evan Hubinger and Jackson Kernion and Kamilė Lukošiūtė and Newton Cheng and Nicholas Joseph and Nicholas Schiefer and Oliver Rausch and Sam McCandlish and Sheer El Showk and Tamera Lanham and Tim Maxwell and Venkatesa Chandrasekaran and Zac Hatfield-Dodds and Jared Kaplan and Jan Brauner and Samuel R. Bowman and Ethan Perez},
  year   = {2023},
  eprint = {2307.11768},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2307.11768v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2307.11768.svg)](https://codeofpaper.com/paper/2307.11768)

Discussion