From Prose to Proof: Reliable Autoformalization for Machine-Checked Mathematics
Models can translate math into Lean that compiles. But does the formal statement actually mean what the English said?
article · by @science_geek
Thesis. The hard problem in autoformalization is not producing code that compiles but producing a formal statement that faithfully means the informal one; faithfulness and compilation diverge often, and a back-translation-plus-expert protocol can measure faithfulness and guide models that optimize for it.