On Learning Verifiers and Implications to Chain-of-Thought Reasoning
On the map: LLM reasoning → Prompting and chain-of-thought reasoning
Abstract (arXiv)
Chain-of-Thought reasoning has emerged as a powerful approach for solving complex mathematical and logical problems. However, it can often veer off track through incorrect or unsubstantiated inferences. Formal mathematical reasoning, which can be checked with a formal verifier, is one approach to addressing this issue. However, currently LLMs are simply not good enough to solve complex problems in a formal way, and even just formalizing an informal problem statement can be challenging. Motivated by this fact, in this work we consider the problem of learning reliable verifiers for natural language Chain-of-Thought reasoning. That is, given a problem statement and step-by-step solution in natural language, the aim of the verifier is to output [Yes] if the reasoning steps in the solution are all valid, and [No] otherwise. In this work we give a formal PAC-learning framework for studying this problem. We propose and analyze several natural verification goals, at different levels of strength, in this framework. We provide sample complexity upper-bounds for learning verifiers satisfying these goals, as well as lower-bound and impossibility results for learning other natural verification objectives without additional assumptions.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Placed in Prompting and chain-of-thought reasoning, one of 17 directions in LLM reasoning. Builds on 63 of its 104 references that are in the map. First posted on arXiv 28 May 2025.
Builds on
63 of 104 references.
Closest ancestors · 7
Same direction, newest first
- 2025PENCIL: Long Thoughts with Short Memory18 Mar
- 2025A Theory of Learning with Autoregressive Chain of Thought11 Mar
- 2024Chain of Thoughtlessness? An Analysis of CoT in Planning8 May
- 2024Chain of Thought Empowers Transformers to Solve Inherently Serial Problems20 Feb
- 2022Automatic Chain of Thought Prompting in Large Language Models7 Oct
- 2022Self-Consistency Improves Chain of Thought Reasoning in Language Models21 Mar
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Models28 Jan
Other references · 56
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2023Let's Verify Step by Stepcited by 3,598
- 2023Tree of Thoughts: Deliberate Problem Solving with Large Language Modelscited by 3,155
- 2021WebGPT: Browser-assisted question-answering with human feedbackcited by 1,722
- 2023Reasoning with Language Model is Planning with World Modelcited by 846
- 2019On Exact Computation with an Infinitely Wide Neural Netcited by 572
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 562
- 2023Sophia: A Scalable Stochastic Second-order Optimizer for Language Model Pre-trainingcited by 260
- 2025Reasoning with Latent Thoughts: On the Power of Looped Transformerscited by 223
- 2020Towards Resolving the Implicit Bias of Gradient Descent for Matrix Factorization: Greedy Low-Rank Learningcited by 148
- 2018Towards Understanding the Role of Over-Parametrization in Generalization of Neural Networkscited by 140
- 2022Understanding Gradient Descent on Edge of Stability in Deep Learningcited by 126
38 more
- 2023Deductive Verification of Chain-of-Thought Reasoningcited by 122
- 2019An Exponential Learning Rate Schedule for Deep Learningcited by 121
- 2021What Happens after SGD Reaches Zero Loss? --A Mathematical Frameworkcited by 106
- 2019Harnessing the Power of Infinitely Wide Deep Nets on Small-data Taskscited by 87
- 2022Understanding the Generalization Benefit of Normalization Layers: Sharpness Reductioncited by 86
- 2022Same Pre-training Loss, Better Downstream: Implicit Bias Matters for Language Modelscited by 84
- 2021Gradient Descent on Two-layer Nets: Margin Maximization and Simplicity Biascited by 82
- 2019Enhanced Convolutional Neural Tangent Kernelscited by 76
- 2023Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokkingcited by 76
- 2024Understanding Warmup-Stable-Decay Learning Rates: A River Valley Loss Landscape Perspectivecited by 75
- 2021On the Validity of Modeling SGD with Stochastic Differential Equations (SDEs)cited by 73
- 2015The Optimal Sample Complexity of PAC Learningcited by 72
- 2022A Characterization of Multiclass Learnabilitycited by 66
- 2018Theoretical Analysis of Auto Rate-Tuning by Batch Normalizationcited by 65
- 2023Auto-Regressive Next-Token Predictors are Universal Learnerscited by 65
- 2022How Does Sharpness-Aware Minimization Minimize Sharpness?cited by 64
- 2019Explaining Landscape Connectivity of Low-cost Solutions for Multilayer Netscited by 63
- 2020Reconciling Modern Deep Learning with Traditional Optimization Analyses: The Intrinsic Learning Ratecited by 59
- 2024Implicit Bias of AdamW: ℓ_∞ Norm Constrained Optimizationcited by 54
- 2024Don't Trust: Verify -- Grounding LLM Quantitative Reasoning with Autoformalizationcited by 53
- 2021Risk Bounds and Rademacher Complexity in Batch Reinforcement Learningcited by 42
- 2023Understanding Incremental Learning of Gradient Descent: A Fine-grained Analysis of Matrix Sensingcited by 40
- 2023Sharpness Minimization Algorithms Do Not Only Minimize Sharpness To Achieve Better Generalizationcited by 39
- 2022Implicit Bias of Gradient Descent on Reparametrized Models: On Equivalence to Mirror Descentcited by 38
- 2024Why Do You Grok? A Theoretical Analysis of Grokking Modular Additioncited by 34
- 2020Why Are Convolutional Nets More Sample-Efficient than Fully-Connected Nets?cited by 32
- 2022Chain of Thought Imitation with Procedure Cloningcited by 30
- 2025Structured Preconditioners in Adaptive Optimization: A Unified Analysiscited by 30
- 2022Robust Training of Neural Networks Using Scale Invariant Architecturescited by 29
- 2019Implicit Regularization and Convergence for Weight Normalizationcited by 20
- 2024Adam Exploits ℓ_∞-geometry of Loss Landscape via Coordinate-wise Adaptivitycited by 20
- 2022Robustly-reliable learners under poisoning attackscited by 19
- 2023Multiclass Online Learning and Uniform Convergencecited by 19
- 2023The Marginal Value of Momentum for Small Learning Rate SGDcited by 16
- 2025Weak-to-Strong Generalization Even in Random Feature Networks, Provablycited by 13
- 2018Online Improper Learning with an Approximation Oraclecited by 11
- 2025On the Query Complexity of Verifier-Assisted Language Generationcited by 10
- 2023Reliable learning in challenging environmentscited by 9
50 most cited of 56 All 56 (JSON)
Built on by
Citing papers per year: 2025: 3; 2026: 3.
6 papers.
- 2025Unlocking the Power of Multi-Agent LLM for Reasoning: From Lazy Agents to Deliberationcited by 11
- 2026Sample Complexity of Autoregressive Reasoning: Chain-of-Thought vs. End-to-Endcited by 2
- 2026Adaptive Generate-Rank-Verify: Inference-Time Search with Costly Verificationcited by 1
- 2026A Theoretical Framework for Self-Play Theorem Proving Algorithmscited by 1
- 2025If generative AI is the answer, what is the question?cited by 0
- 2025Prior Knowledge Makes It Possible: From Sublinear Graph Algorithms to LLM Test-Time Methodscited by 0
- 2026A Theoretical Framework for Self-Play Theorem Proving Algorithms1 Jun 2026
- 2026Adaptive Generate-Rank-Verify: Inference-Time Search with Costly Verification17 May 2026
- 2026Sample Complexity of Autoregressive Reasoning: Chain-of-Thought vs. End-to-End13 Apr 2026
- 2025Unlocking the Power of Multi-Agent LLM for Reasoning: From Lazy Agents to Deliberation4 Nov 2025
- 2025Prior Knowledge Makes It Possible: From Sublinear Graph Algorithms to LLM Test-Time Methods18 Oct 2025
- 2025If generative AI is the answer, what is the question?7 Sep 2025
Similar, not cited
Close in wording, no citation either way
- 2026Verify to Amplify: Improving Reasoning via Learned Chain-of-Thought Verification
- 2024A Chain-of-Thought Is as Strong as Its Weakest Link: A Benchmark for Verifiers of Reasoning Chains
- 2025VeriThinker: Learning to Verify Makes Reasoning Model Efficient
- 2024General Purpose Verification for Chain of Thought Prompting
- 2025Improving Chain-of-Thought Reasoning via Quasi-Symbolic Abstractions
- 2025Safe: Enhancing Mathematical Reasoning in Large Language Models via Retrospective Step-aware Formal Verification
- 2025From Reasoning to Super-Intelligence: A Search-Theoretic Perspective
- 2025VeriCoT: Neuro-symbolic Chain-of-Thought Validation via Logical Consistency Checks