Transcription of Formal Mathematics Statement Curriculum Learning
{{id}} {{{paragraph}}}
Formal Mathematics Statement Curriculum LearningStanislas Polu1 Jesse Michael Han1 Kunhao Zheng2 Mantas Baksys3 Igor Babuschkin1 Ilya Sutskever1 AbstractWe explore the use of expert iteration in the con-text of language modeling applied to Formal math-ematics. We show that at same compute bud-get, expert iteration, by which we mean proofsearch interleaved with Learning , dramatically out-performs proof search only. We also observe thatwhen applied to a collection of Formal statementsof sufficiently varied difficulty, expert iteration iscapable of finding and solving a Curriculum of in-creasingly difficult problems, without the need forassociated ground-truth proofs. Finally, by apply-ing this expert iteration to a manually curated setof problem statements, we achieve state-of-the-arton theminiF2 Fbenchmark, automatically solvingmultiple challenging problems drawn from highschool IntroductionDeep Learning has enjoyed spectacular success in many do-mains, including language (Brown et al.)
more automation (such as more domain-specific statements generator or even informal to formal machine translation). 1.1. miniF2F benchmark In this work, we target the miniF2F (Zheng et al.,2021) benchmark, which consists of 244 validation and 244 test formalized statements of mathematical problems from var-ious competitions.
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}