paper-with-me

Papers

FATE: A Formal Benchmark Series for Frontier Algebra of Multiple Difficulty Levels

2025-11-04 · Jiedong Jiang, Wanyi He, Yuefeng Wang, Guoxiong Gao, Yongle Hu, Jingting Wang, Nailin Guan, Peihao Wu, Chunbo Dai, Liang Xiao, Bin Dong arxiv

Recent advances in large language models (LLMs) have demonstrated impressive capabilities in formal theorem proving, particularly on contest-based mathematical benchmarks like the IMO. However, these contests do not reflect the depth, breadth, and abstraction of modern mathematical research. To bridge this gap, we introduce FATE (Formal Algebra Theorem Evaluation), a new benchmark series in formal algebra designed to chart a course toward advanced mathematical reasoning. We present two new components, FATE-H and FATE-X, each with 100 problems in abstract and commutative algebra. The FATE series spans a difficulty spectrum from undergraduate exercises to problems exceeding PhD qualifying exams. Notably, FATE-X is the first formal benchmark to surpass both PhD-level exam difficulty and the coverage of the Mathlib library. Our evaluations of state-of-the-art LLM provers on this new benchmark reveal a stark performance gap compared to contest math: the best model achieves only 3% (pass@64) accuracy on FATE-H and 0% on FATE-X. Our two-stage evaluation reveals that models' natural-language reasoning is notably more accurate than their ability to formalize this reasoning. We systematically classify the common errors that arise during this formalization process. Furthermore, a comparative study shows that a specialized prover can exhibit less effective reflection than general-purpose models, reducing its accuracy at the natural-language stage. We believe FATE provides a robust and challenging benchmark that establishes essential checkpoints on the path toward research-level formal mathematical reasoning.

📄 PDF Abstract BibTeX arXiv:2511.02872

Code (0)

등록된 구현이 없습니다.

Tasks

Mathematical Reasoning

Similar Papers 제목 키워드 기반

FormalProofBench: Can Models Write Graduate Level Math Proofs That Are Formally Verified?

2026-03-27 · Nikil Ravi, Kexing Ying, Vasilii Nesterov, Rayan Krishnan 외 arxiv

We present FormalProofBench, a private benchmark designed to evaluate whether AI models can produce formally verified mathematical proofs at the graduate level. Each task pairs a natural-language problem with a Lean~4 fo…

Aria: An Agent For Retrieval and Iterative Auto-Formalization via Dependency Graph

2025-10-06 · Hanyu Wang, Ruohan Xie, Yutong Wang, Guoxiong Gao 외 arxiv

Accurate auto-formalization of theorem statements is essential for advancing automated discovery and verification of research-level mathematics, yet remains a major bottleneck for LLMs due to hallucinations, semantic mis…

REAL-Prover: Retrieval Augmented Lean Prover for Mathematical Reasoning

2025-05-27 · Ziju Shen, Naohao Huang, Fanyi Yang, Yutong Wang 외

Nowadays, formal theorem provers have made monumental progress on high-school and competition-level mathematics, but few of them generalize to more advanced mathematics. In this paper, we present REAL-Prover, a new open-…

Language ModelingLanguage ModellingLarge Language ModelMath+2

Forecasting Anomaly Precursors via Uncertainty-Aware Time-Series Ensembles

2026-02-19 · Hyeongwon Kang, Jinwoo Park, Seunghun Han, Pilsung Kang arxiv

Detecting anomalies in time-series data is critical in domains such as industrial operations, finance, and cybersecurity, where early identification of abnormal patterns is essential for ensuring system reliability and e…

Formal Power Series Approach to Nonlinear Systems with Additive Static Feedback

2021-10-19 · G. S. Venkatesh, W. Steven Gray

The goal of this paper is to compute the generating series of a closed-loop system when the plant is described in terms of a Chen-Fliess series and an additive static output feedback is applied. The first step is to cons…