arXiv:2502.19405cs.LG2025-02被引 10

让客户用可信方式验证大模型计算结果是否正确

Verde: Verification via Refereed Delegation for Machine Learning Programs

  • 引入仲裁机制,多个不可信计算方中只要一个诚实就能保证结果正确
  • 自研可复现算子库,消除不同硬件间的计算差异
  • 适合对结果可靠性要求高的大模型应用,如金融、医疗推理

机器学习程序(如大模型推理、微调和训练)常被委托给不可信的计算服务商。为保障客户端的正确性,本文将密码学中的受控仲裁委托机制引入机器学习场景。该方法使计算能力受限的客户端可将任务分发至多个不可信服务方,只要其中至少一个诚实,即可确保获得正确结果。该机制面临两大挑战:(1)当服务方输出不一致时,需高效解决争议;(2)在不同硬件上实现完全可复现的计算。针对(1),我们设计了Verde仲裁协议,能高效处理现代机器学习程序的大规模图结构计算;针对(2),我们构建了RepOps(可复现算子)库,通过统一浮点运算顺序,消除硬件导致的非确定性。实现表明,受控仲裁委托在保障客户端强可靠性的同时,对计算方开销可控。

原文摘要 · Abstract (English)

Machine learning programs, such as those performing inference, fine-tuning, and training of LLMs, are commonly delegated to untrusted compute providers. To provide correctness guarantees for the client, we propose adapting the cryptographic notion of refereed delegation to the machine learning setting. This approach enables a computationally limited client to delegate a program to multiple untrusted compute providers, with a guarantee of obtaining the correct result if at least one of them is honest. Refereed delegation of ML programs poses two technical hurdles: (1) an arbitration protocol to resolve disputes when compute providers disagree on the output, and (2) the ability to bitwise reproduce ML programs across different hardware setups, For (1), we design Verde, a dispute arbitration protocol that efficiently handles the large scale and graph-based computational model of modern ML programs. For (2), we build RepOps (Reproducible Operators), a library that eliminates hardware "non-determinism" by controlling the order of floating point operations performed on all hardware. Our implementation shows that refereed delegation achieves both strong guarantees for clients and practical overheads for compute providers.

可信计算大模型验证仲裁协议可复现计算

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。