mlsanityData to 7 Oct 2026

StochBench: A Domain-Specific Benchmark for Stochastic Processes in Lean

arXiv 2609.09264 ↗First posted 8 Sep 2026cs.CL cs.LOcited by 0

Not on the map. Why?

Abstract (arXiv)

Leading benchmarks for formal theorem proving with large language models are small collections drawn from competition math, such as the IMO and Putnam, that poorly represent field-specific applications. We introduce StochBench, a Lean 4 benchmark of 450 graduate stochastic-processes problems at varying abstraction levels, each paired with its natural-language source. Addressing a field underrepresented in Mathlib, it covers finite and countable Markov chains, renewal processes, random walks, martingales, stopping times, queues, Brownian motion, stochastic calculus, weak convergence, and Poisson and continuous-time Markov processes. Our Opus 4.8-based agent achieves a 34.9% proof rate (157/450) under a 15-minute per-problem limit. StochBench better represents domain-specific applied mathematics while remaining challenging for advanced provers.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 13 of its 43 references that are in the map. First posted on arXiv 8 Sep 2026.

Builds on

13 of 43 references.

References · 13

  1. 2023LeanDojo: Theorem Proving with Retrieval-Augmented Language Modelscited by 414
  2. 2021MiniF2F: a cross-system benchmark for formal Olympiad-level mathematicscited by 380
  3. 2025DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decompositioncited by 270
  4. 2024DeepSeek-Prover-V1.5: Harnessing Proof Assistant Feedback for Reinforcement Learning and Monte-Carlo Tree Searchcited by 189
  5. 2023ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematicscited by 180
  6. 2024PutnamBench: Evaluating Neural Theorem-Provers on the Putnam Mathematical Competitioncited by 153
  7. 2019The Lean mathematical librarycited by 127
  8. 2025FormalML: A Benchmark for Evaluating Formal Subgoal Completion in Machine Learning Theorycited by 5
  9. 2026TaoBench: Do Automated Theorem Prover LLMs Generalize Beyond MathLib?cited by 5
  10. 2026FormalProofBench: Can Models Write Graduate Level Math Proofs That Are Formally Verified?cited by 4
  11. 2022A Formalization of Doob's Martingale Convergence Theorems in mathlibcited by 2
  12. 2025A Formalization of the Ionescu-Tulcea Theorem in Mathlibcited by 2
1 more
  1. 2026MathAtlas: A Benchmark for Autoformalization in the Wildcited by 2

Built on by

Not cited yet.