Testing the General Deductive Reasoning Capacity of Large Language Models Using OOD Examples
Abulhair Saparov, Richard Yuanzhe Pang, Vishakh Padmakumar, Nitish Joshi, Seyed Mehran Kazemi, Najoung Kim, He He
TL;DR
The study tackles whether large language models can generalize general deductive reasoning beyond their in-context demonstrations by introducing PrOntoQA-OOD, a programmable dataset that controls deduction rules, proof depth, width, and compositional structure. Across four LLMs and 8-shot chain-of-thought prompting, the results show propensity for compositional generalization but notable difficulty with longer proofs and certain hypothetical subproofs that require explicit demonstrations. The work reveals that diverse, simple, and sometimes rule-specific demonstrations can improve OOD generalization, and distractors can aid robust reasoning, highlighting distinctions between in-context learning and supervised training. Overall, the paper provides a rigorous framework for evaluating OOD deductive reasoning in LLMs and points to directions for improving ICL mechanisms and data design to better capture general reasoning capabilities.
Abstract
Given the intractably large size of the space of proofs, any model that is capable of general deductive reasoning must generalize to proofs of greater complexity. Recent studies have shown that large language models (LLMs) possess some abstract deductive reasoning ability given chain-of-thought prompts. However, they have primarily been tested on proofs using modus ponens or of a specific size, and from the same distribution as the in-context examples. To measure the general deductive reasoning ability of LLMs, we test on a broad set of deduction rules and measure their ability to generalize to more complex proofs from simpler demonstrations from multiple angles: depth-, width-, and compositional generalization. To facilitate systematic exploration, we construct a new synthetic and programmable reasoning dataset that enables control over deduction rules and proof complexity. Our experiments on four LLMs of various sizes and training objectives show that they are able to generalize to compositional proofs. However, they have difficulty generalizing to longer proofs, and they require explicit demonstrations to produce hypothetical subproofs, specifically in proof by cases and proof by contradiction.
