StepFun-Formalizer: Unlocking the Autoformalization Potential of LLMs Through Knowledge-Reasoning Fusion
Yutong Wu, Di Huang, Ruosi Wan, Yue Peng, Shijie Shang, Chenrui Cao, Lei Qi, Rui Zhang, Xishan Zhang, Zidong Du, Jie Yang, Xing Hu
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper7
- Aria: an Agent for Retrieval and Iterative Auto-Formalization via Dependency GraphHanyu Wang, Ruohan Xie, Yutong Wang, Guoxiong Gao 等ICLR 2026 · 被引用 21 次
- ProofFlow: A Dependency Graph Approach to Faithful Proof AutoformalizationRafael Cabral, Tuan Manh Do, Xuejun Yu, Wai Ming Tai 等ICLR 2026 · 被引用 21 次
- ProofBridge: Auto-Formalization of Natural Language Proofs in Lean via Joint EmbeddingsPrithwish Jana, Kaan Kale, Ahmet Ege Tanriverdi, Cruise Song 等ICLR 2026 · 被引用 19 次
- ASSESS: A Semantic and Structural Evaluation Framework for Statement SimilarityXiaoyang Liu, Tao Zhu, Zineng Dong, Yuntian Liu 等ICLR 2026 · 被引用 9 次
- DRIFT: Decompose, Retrieve, Illustrate, then Formalize TheoremsMeiru Zhang, Philipp Borchert, Milan Gritta, Gerasimos LampourasICLR 2026 · 被引用 8 次
它引用的顶会 Paper11
- Language Models are Few-Shot LearnersTom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah 等NeurIPS 2020 · 被引用 64,255 次
- Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code GenerationJiawei Liu, Chunqiu Steven Xia, Yuyao Wang, Lingming ZhangNeurIPS 2023 · 被引用 2,317 次
- Self-Consistency Improves Chain of Thought Reasoning in Language ModelsXuezhi Wang, Jason Wei, Dale Schuurmans, Quoc V. Le 等ICLR 2023 · 被引用 681 次
- Autoformalization with Large Language ModelsYuhuai Wu, Albert Qiaochu Jiang, Wenda Li, Markus N. Rabe 等NeurIPS 2022 · 被引用 364 次
- miniF2F: a cross-system benchmark for formal Olympiad-level mathematicsKunhao Zheng, Jesse Michael Han, Stanislas PoluICLR 2022 · 被引用 342 次
相关 Paper
- Autoformalize Mathematical Statements by Symbolic Equivalence and Semantic ConsistencyZenan Li, Yifan Wu, Zhaoyu Li, Xinming Wei 等NeurIPS 2024 · 被引用 48 次
- ReForm: Reflective Autoformalization with Prospective Bounded Sequence OptimizationGuoxin Chen, Jing Wu, Xinjie Chen, Xin Zhao 等ICLR 2026 · 被引用 22 次
- Mathesis: Towards Formal Theorem Proving from Natural LanguagesXuejun Yu, Jianyuan Zhong, Zijin Feng, Pengyi Zhai 等ICLR 2026 · 被引用 15 次
- miniF2F-Lean Revisited: Reviewing Limitations and Charting a Path ForwardAzim Ospanov, Farzan Farnia, Roozbeh MohitNeurIPS 2025 · 被引用 14 次
- Theorem Prover as a Judge for Synthetic Data GenerationJoshua Ong Jun Leang, Giwon Hong, Wenda Li, Shay B. CohenACL 2025
