English

MathAtlas: A Benchmark for Autoformalization in the Wild

Artificial Intelligence 2026-05-15 v1 Machine Learning

Abstract

Current autoformalization benchmarks are largely focused on olympiad or undergraduate mathematics, while graduate and research-level mathematics remains underexplored. In this paper, we introduce MathAtlas, the first large-scale autoformalization benchmark of in the wild graduate-level mathematics, containing ~52k theorems, definitions, exercises, examples, and proofs extracted from 103 graduate mathematics textbooks. MathAtlas is enriched with a mathematical dependency graph containing ~178k relations, and is the first autoformalization benchmark to include such relations, facilitating evaluation and development of dependency-aware autoformalization systems. Our extensive experiments show that MathAtlas is high quality but extremely challenging: strong baselines achieve at most 9.8% correctness on theorem statements and 16.7% on definitions. Furthermore, we find performance of state-of-the-art models degrades substantially with dependency depth: on MA-Hard, a subset of 700 entities with the deepest dependency trees, the best model achieves only 2.6% correctness for autoformalization on this challenging dataset. We release MathAtlas to the community as a benchmark set for large-scale autoformalization of graduate-level mathematics in the wild.

Keywords

Cite

@article{arxiv.2605.14061,
  title  = {MathAtlas: A Benchmark for Autoformalization in the Wild},
  author = {Nilay Patel and Noah Arias and Davit Babayan and Victoria Cochran and Timothy Libman and Hafsah Mahmood and Liam McCarty and Soli Munoz and Laurel Willey and Jeffrey Flanigan},
  journal= {arXiv preprint arXiv:2605.14061},
  year   = {2026}
}

Comments

In submission at NeurIPS 2026

R2 v1 2026-07-22T07:11:05.629Z