arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2412.08897cs.AIcs.LG
收藏

神经交互式证明

Neural Interactive Proofs

University of Oxford(牛津大学)

Lewis Hammond, Sam Adam-Day

AI总结:

本文提出神经交互式证明的统一博弈框架与多种新协议,并通过图同构和基于LLM的代码验证实验,为可信受限验证者与不可信强证明者的安全交互奠定基础。

摘要:

我们考虑这样一个问题:一个可信但计算能力有限的智能体(“验证者”)如何学会与一个或多个强大但不可信的智能体(“证明者”)交互,以完成给定任务。更具体地说,我们研究智能体由神经网络表示的情形,并将该问题的解决方案称为神经交互式证明。首先,我们提出一个基于证明者—验证者博弈的统一框架,该框架推广了此前提出的交互协议。随后,我们描述了若干用于生成神经交互式证明的新协议,并对新方法与现有方法进行了理论比较。最后,我们通过两个领域的实验为该理论提供支持:一个是用于阐明核心思想的玩具图同构问题,另一个是使用大型语言模型的代码验证任务。通过这些工作,我们旨在为未来关于神经交互式证明及其在构建更安全AI系统中的应用研究奠定基础。

英文摘要:

We consider the problem of how a trusted, but computationally bounded agent (a 'verifier') can learn to interact with one or more powerful but untrusted agents ('provers') in order to solve a given task. More specifically, we study the case in which agents are represented using neural networks and refer to solutions of this problem as neural interactive proofs. First we introduce a unifying framework based on prover-verifier games, which generalises previously proposed interaction protocols. We then describe several new protocols for generating neural interactive proofs, and provide a theoretical comparison of both new and existing approaches. Finally, we support this theory with experiments in two domains: a toy graph isomorphism problem that illustrates the key ideas, and a code validation task using large language models. In so doing, we aim to create a foundation for future work on neural interactive proofs and their application in building safer AI systems.

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

↑