“That's one of the future direction we're pursuing! We hope to utilize the power of autoformalization (http://arxiv.org/abs/2205.12615) and provably verify the solution with formal systems. As I wrote in my tweet, in the long run, I am expecting a great synergy between a strong natural language math model and an autoformalizer to tackle challenging mathem…”
Autoformalization with Large Language Models
Autoformalization is the process of automatically translating from natural language mathematics to formal specifications and proofs. A successful autoformalization system could advance the fields of formal verification, program synthesis, and artificial intelligence. While the long-term goal of autoformalization seemed elusive for a long time, we show large language models provide new prospects towards this goal. We make the surprising observation that LLMs can correctly translate a significant portion ($25.3\%$) of mathematical competition problems perfectly to formal specifications in Isabelle/HOL. We demonstrate the usefulness of this process by improving a previously introduced neural theorem prover via training on these autoformalized theorems. Our methodology results in a new state-of-the-art result on the MiniF2F theorem proving benchmark, improving the proof rate from $29.6\%$ to $35.2\%$.
候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。
HN 书评
推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及“"Brute force" = going through all combinations indiscriminately. Using heuristics, beam search, etc, = "not brute force". Calling something smart "brute force" is wrong. > We shouldn't expect an AlphaCategoryTheory or AlphaNumberTheory anytime soon. There's already a number of papers demonstrating use of LLMs for math in general: "Autoformalization w…”