Beyond Gold Standards: Epistemic Ensemble of LLM Judges for Formal Mathematical Reasoning
Lan Zhang, Marco Valentino, Jordan Meadows, Andre Freitas
cs.CL
Submitted: 2026-08-21
Updated: 2026-08-24
Code: https://github.com/deepseek-ai/DeepSeek-Prover-V1.5
License: http://creativecommons.org/licenses/by/4.0/
The gist: Statement autoformalization plays a crucial role in formal mathematical reasoning by enabling the automatic translation of natural language statements into formal languages.
Terminology
Abstract
Statement autoformalization plays a crucial role in formal mathematical reasoning by enabling the automatic translation of natural language statements into formal languages. While recent advances using large language models (LLMs) have shown promising capability of autoformalization, methods for automatically evaluating autoformalization remain underexplored. LLM-as-a-judge presents a promising approach for automating such evaluation, however, existing methods typically employ coarse-grained and generic evaluation criteria, which limit their effectiveness for advanced formal mathematical reasoning, where quality hinges on nuanced, multi-granular dimensions. In this work, we take a step toward addressing this gap by introducing a systematic, automatic method to evaluate autoformalization tasks. The proposed method is based on an epistemically and formally grounded ensemble (EFG) of LLM judges, defined on criteria encompassing logical preservation (LP), mathematical consistency (MC), formal quality (FQ), and formal validity (FV), resulting in a transparent assessment that accounts for different contributing factors. We validate the proposed framework to serve as a proxy for autoformalization assessment within the domain of formal mathematics. Overall, our experiments demonstrate that the EFG ensemble of LLM judges is a more suitable emerging proxy for evaluation than a coarse-grained model. These findings suggest that LLM-as-judges, especially when guided by a well-defined set of atomic properties, could offer a scalable, interpretable, and reliable support for evaluating formal mathematical reasoning.
Sources
- Goedel-Prover: A Frontier Model for Open-Source Automated Theorem Proving
- FormalMATH: Benchmarking Formal Mathematical Reasoning of Large Language Models
- Formal Mathematical Reasoning: A New Frontier in AI
- Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations
- GPT-4 Technical Report
- DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models
- Qwen2.5 Technical Report
- LeanDojo: Theorem Proving with Retrieval-Augmented Language Models
- ATLAS: Autoformalizing Theorems through Lifting, Augmentation, and Synthesis of Data
- Reliable Evaluation and Benchmarks for Statement Autoformalization
- FormalAlign: Automated Alignment Evaluation for Autoformalization
- Self-Taught Evaluators
- J1: Incentivizing Thinking in LLM-as-a-Judge via Reinforcement Learning
- LLMs instead of Human Judges? A Large Scale Empirical Study across 20 NLP Evaluation Tasks
- A Survey on LLM-as-a-Judge
- Assessing Judging Bias in Large Reasoning Models: An Empirical Study
- DeepTheorem: Advancing LLM Reasoning for Theorem Proving Through Natural Language and Reinforcement Learning
Related papers
- Exploring Solution Divergence and Its Effect on Large Language Model Problem Solving
- Ishigaki-IDS-Bench: A Benchmark for Generating Information Delivery Specification from BIM Information Requirements
- Subliminal Steering: Stronger Encoding of Hidden Signals
- MedStruct-S: A Benchmark for Key Discovery, Key-Conditioned QA and Semi-Structured Extraction from OCR Clinical Reports
- The End of Transformers? On Challenging Attention and the Rise of Sub-Quadratic Architectures
- Untangling the Mechanisms of Misleading Context in Medical Question Answering