5,446,782 AI resources indexedWorking toward the world’s largest AI resource index.

PDF

StepFun-Formalizer: Unlocking the Autoformalization Potential of LLMs through Knowledge-Reasoning Fusion

Research paper by Yutong Wu and collaborators. Published 2025-08-06. Topics: LLMs, autoformalization, formal-language domain knowledge, natural language problem understanding, informal-formal alignment.

Resource information

Authors
Yutong Wu, Di Huang, Ruosi Wan, Yue Peng, Shijie Shang, Chenrui Cao, Lei Qi, Rui Zhang, Zidong Du, Jie Yan, Xing Hu
Research area
Language technology
Application domain
General AI research
AI methods
Large language models
Research topics
cs.CL, cs.AI, cs.LG
arXiv record date
2025-12-26
Publication date
2025-08-06
Publication
arXiv
Upstream last modified
Dec 29, 2025
License
CC BY-SA 4.0
Last record update
Nov 3, 2026

Abstract

Autoformalization aims to translate natural-language mathematical statements into a formal language. While LLMs have accelerated progress in this area, existing methods still suffer from low accuracy. We identify two key abilities for effective autoformalization: comprehensive mastery of formal-language domain knowledge, and reasoning capability of natural language problem understanding and informal-formal alignment. Without the former, a model cannot identify the correct formal objects; without the latter, it struggles to interpret real-world contexts and map them precisely into formal expressions. To address these gaps, we introduce ThinkingF, a data synthesis and training pipeline that improves both abilities. First, we construct two datasets: one by distilling and selecting large-scale examples rich in formal knowledge, and another by generating informal-to-formal reasoning trajectories guided by expert-designed templates. We then apply SFT and RLVR with these datasets to further fuse and refine the two abilities. The resulting 7B and 32B models exhibit both comprehensive formal knowledge and strong informal-to-formal reasoning. Notably, StepFun-Formalizer-32B achieves SOTA BEq@1 scores of 40.5% on FormalMATH-Lite and 26.7% on ProverBench, surpassing all prior general-purpose and specialized models.