arXiv:2410.22307cs.LGcs.AI2024-10被引 10

让用户能快速验证云服务是否用真大模型,防偷偷换小模型。

SVIP: Towards Verifiable Inference of Open-source Large Language Models

  • 用隐藏表示+代理任务生成模型指纹,可识别是否换小模型
  • 验证误差低于5%假阴性、3%假阳性,每请求耗时不到0.01秒
  • 无需复杂加密,适合个人和小团队在去中心化平台使用

开源大模型规模不断增大,个人用户难以本地部署。去中心化计算成为低成本解决方案,利用闲置算力为用户提供推理服务。但计算提供方可能未经同意,私自替换为更小的低性能模型以节省成本。为此,我们提出SVIP——一种基于密钥的可验证大模型推理协议。不同于依赖密码学或博弈论的方法,本方案计算高效且无需强假设。协议要求计算方返回生成文本及模型处理后的隐藏状态,我们在此基础上训练代理任务,将隐藏状态转化为唯一模型标识。用户可据此可靠验证计算方是否诚实。通过集成秘密机制增强安全性。我们在多种强适应性对抗场景下进行深入分析,实验表明SVIP具备高精度、强泛化性、低延迟与抗攻击能力:虚假否定率低于5%,虚假肯定率低于3%,单次提示查询验证时间不足0.01秒。

原文摘要 · Abstract (English)

The ever-increasing size of open-source Large Language Models (LLMs) renders local deployment impractical for individual users. Decentralized computing has emerged as a cost-effective solution, allowing individuals and small companies to perform LLM inference for users using surplus computational power. However, a computing provider may stealthily substitute the requested LLM with a smaller, less capable model without consent from users, thereby benefiting from cost savings. We introduce SVIP, a secret-based verifiable LLM inference protocol. Unlike existing solutions based on cryptographic or game-theoretic techniques, our method is computationally effective and does not rest on strong assumptions. Our protocol requires the computing provider to return both the generated text and processed hidden representations from LLMs. We then train a proxy task on these representations, effectively transforming them into a unique model identifier. With our protocol, users can reliably verify whether the computing provider is acting honestly. A carefully integrated secret mechanism further strengthens its security. We thoroughly analyze our protocol under multiple strong and adaptive adversarial scenarios. Our extensive experiments demonstrate that SVIP is accurate, generalizable, computationally efficient, and resistant to various attacks. Notably, SVIP achieves false negative rates below 5% and false positive rates below 3%, while requiring less than 0.01 seconds per prompt query for verification.

大模型安全可验证推理去中心化模型指纹

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