arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.06203cs.AIcs.LGcs.LO
收藏

基于语言模型的定理证明协同训练

Proof Artifact Co-training for Theorem Proving with Language Models

University of Pittsburgh(匹兹堡大学);OpenAI;IBM Research(IBM研究院);Google Research(谷歌研究院);Stanford University(斯坦福大学);Carnegie Mellon University(卡内基梅隆大学);CIBO Technologies(CIBO科技);University of Toronto(多伦多大学);University of Cambridge(剑桥大学)

Jesse Michael Han, Jason Rute, Yuhuai Wu, Edward W. Ayers, Stanislas Polu

摘要:

在大型形式化数学库中,用于定理证明的模仿学习的标记数据是稀缺的,因为这样的库需要人类专家多年的集中努力才能建立。当将大型Transformer语言模型应用于战术预测时,这是特别具有挑战性的,因为在数据稀缺、容易过拟合的情况下,性能相对于模型大小的缩放很快就会被破坏。我们提出了PACT({ \bf P}roof { \bf A}rtifact { \bf C}o-{ \bf T}raining),这是一种从内核级证明项中提取丰富的自监督数据的通用方法,用于与通常的战术预测目标一起进行协同训练。我们将这种方法应用于精益,一个交互式的证明助手,它拥有一些迄今为止最复杂的形式化数学。我们仪器精益与神经定理证明器驱动的Transformer语言模型,并表明PACT提高定理证明成功率从32%到48%的测试定理。

英文摘要:

Labeled data for imitation learning of theorem proving in large libraries of formalized mathematics is scarce as such libraries require years of concentrated effort by human specialists to be built. This is particularly challenging when applying large Transformer language models to tactic prediction, because the scaling of performance with respect to model size is quickly disrupted in the data-scarce, easily-overfitted regime. We propose PACT ({\bf P}roof {\bf A}rtifact {\bf C}o-{\bf T}raining), a general methodology for extracting abundant self-supervised data from kernel-level proof terms for co-training alongside the usual tactic prediction objective. We apply this methodology to Lean, an interactive proof assistant which hosts some of the most sophisticated formalized mathematics to date. We instrument Lean with a neural theorem prover driven by a Transformer language model and show that PACT improves theorem proving success rate on a held-out suite of test theorems from 32\% to 48\%.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑