Coq的在线机器学习技术比较
Online Machine Learning Techniques for Coq: A Comparison
摘要:
我们提出了一个比较几个在线机器学习技术的战术学习和证明的Coq证明助手。这项工作建立在Tactician之上,这是Coq的一个插件,它从用户编写的证明中学习,以合成新的证明。学习以在线方式进行,这意味着每当用户在交互式证明中执行一个步骤时,Tactician的机器学习模型就会立即更新。与更多研究的离线学习系统相比,这具有重要的优势:(1)它为用户提供了与Tactician无缝交互的体验,(2)它利用了证明相似性的局部性,这意味着与当前证明相似的证明可能会在附近找到。我们实现了两种在线方法,即基于局部敏感散列森林和随机决策森林的近似k-近邻。此外,我们使用XGBoost在离线设置中使用梯度提升树进行实验。我们比较了Tactician使用这三种学习方法在Coq标准库上的相对性能。
英文摘要:
We present a comparison of several online machine learning techniques for tactical learning and proving in the Coq proof assistant. This work builds on top of Tactician, a plugin for Coq that learns from proofs written by the user to synthesize new proofs. Learning happens in an online manner, meaning that Tactician's machine learning model is updated immediately every time the user performs a step in an interactive proof. This has important advantages compared to the more studied offline learning systems: (1) it provides the user with a seamless, interactive experience with Tactician and, (2) it takes advantage of locality of proof similarity, which means that proofs similar to the current proof are likely to be found close by. We implement two online methods, namely approximate k-nearest neighbors based on locality sensitive hashing forests and random decision forests. Additionally, we conduct experiments with gradient boosted trees in an offline setting using XGBoost. We compare the relative performance of Tactician using these three learning methods on Coq's standard library.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。