Pith. sign in

REVIEW 4 cited by

Phenomenal Yet Puzzling: Testing Inductive Reasoning Capabilities of Language Models with Hypothesis Refinement

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.08559 v4 pith:ZAS3BS3G submitted 2023-10-12 cs.CL cs.AI

classification cs.CLcs.AI
keywords inductivereasoningruleshypothesishumanrefinementablebenchmarks
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The ability to derive underlying principles from a handful of observations and then generalize to novel situations -- known as inductive reasoning -- is central to human intelligence. Prior work suggests that language models (LMs) often fall short on inductive reasoning, despite achieving impressive success on research benchmarks. In this work, we conduct a systematic study of the inductive reasoning capabilities of LMs through iterative hypothesis refinement, a technique that more closely mirrors the human inductive process than standard input-output prompting. Iterative hypothesis refinement employs a three-step process: proposing, selecting, and refining hypotheses in the form of textual rules. By examining the intermediate rules, we observe that LMs are phenomenal hypothesis proposers (i.e., generating candidate rules), and when coupled with a (task-specific) symbolic interpreter that is able to systematically filter the proposed set of rules, this hybrid approach achieves strong results across inductive reasoning benchmarks that require inducing causal relations, language-like instructions, and symbolic concepts. However, they also behave as puzzling inductive reasoners, showing notable performance gaps between rule induction (i.e., identifying plausible rules) and rule application (i.e., applying proposed rules to instances), suggesting that LMs are proposing hypotheses without being able to actually apply the rules. Through empirical and human analyses, we further reveal several discrepancies between the inductive reasoning processes of LMs and humans, shedding light on both the potentials and limitations of using LMs in inductive reasoning tasks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer

    cs.AI 2026-08 conditional novelty 7.0 of 10

    Solver-aware training of a PBE decomposer with a frozen synthesizer's loss outperforms supervised imitation of ground-truth subgoals, solving tasks that a ground-truth decomposition oracle fails.

  2. MARCO: Meta-Reflection with Cross-Referencing for Code Reasoning

    cs.CL 2025-05 conditional novelty 6.0 of 10

    MARCO combines cross-problem knowledge accumulation with cross-agent lesson sharing to improve LLM code reasoning at inference time.

  3. Legal Rule Induction: Towards Generalizable Principle Discovery from Analogous Judicial Precedents

    cs.CL 2025-05 conditional novelty 6.0 of 10

    The authors present LRI, a task and benchmark for inducing legal rules from analogous Chinese judicial precedents, and show that fine-tuning improves LLM performance significantly.

  4. RLIE: Rule Generation with Logistic Regression, Iterative Refinement, and Evaluation for Large Language Models

    cs.AI 2025-10 conditional novelty 5.0 of 10

    Logistic regression over LLM-generated natural-language rules outperformed letting the LLM reason with those rules on six binary text tasks.

Pith tools