用零知识证明保护模型隐私的同时,验证机器学习公平性。
FairZK: A Scalable System to Prove Machine Learning Fairness in Zero-Knowledge
- 仅用模型参数和输入聚合信息衡量公平性,避免暴露具体数据。
- 提出更紧的公平性边界,支持逻辑回归与深度网络,提升准确性。
- 首次实现4700万参数大模型的公平性零知识证明,速度提升4个数量级。
随着机器学习技术的发展,确保其在关键应用中的决策公平性变得至关重要。然而,传统公平性评估通常需要访问完整模型参数,损害模型机密性。本文提出 FairZK,一种基于零知识证明的可扩展系统,使模型所有者能在不泄露模型细节的前提下,向公众证明模型的公平性。为突破直接对机器学习推理进行零知识证明的效率瓶颈,我们创新性地提出仅依赖模型参数和输入聚合信息即可测量公平性的方法。针对逻辑回归与深度神经网络,推导出更紧密且更准确反映公平性的新界。同时,设计高效零知识证明协议,涵盖矩阵谱范数、最大值、绝对值及定点运算等常见计算。我们完整实现了 FairZK 系统。实验表明,相比朴素方法与现有方案,其证明时间提升 3.1 倍至 1789 倍,可首次处理含 4700 万参数的大模型,在 343 秒内完成公平性证明,较现有方案快约 4 个数量级,仅支持数百至数千参数的小模型。
原文摘要 · Abstract (English)
With the rise of machine learning techniques, ensuring the fairness of decisions made by machine learning algorithms has become of great importance in critical applications. However, measuring fairness often requires full access to the model parameters, which compromises the confidentiality of the models. In this paper, we propose a solution using zero-knowledge proofs, which allows the model owner to convince the public that a machine learning model is fair while preserving the secrecy of the model. To circumvent the efficiency barrier of naively proving machine learning inferences in zero-knowledge, our key innovation is a new approach to measure fairness only with model parameters and some aggregated information of the input, but not on any specific dataset. To achieve this goal, we derive new bounds for the fairness of logistic regression and deep neural network models that are tighter and better reflecting the fairness compared to prior work. Moreover, we develop efficient zero-knowledge proof protocols for common computations involved in measuring fairness, including the spectral norm of matrices, maximum, absolute value, and fixed-point arithmetic. We have fully implemented our system, FairZK, that proves machine learning fairness in zero-knowledge. Experimental results show that FairZK is significantly faster than the naive approach and an existing scheme that use zero-knowledge inferences as a subroutine. The prover time is improved by 3.1x--1789x depending on the size of the model and the dataset. FairZK can scale to a large model with 47 million parameters for the first time, and generates a proof for its fairness in 343 seconds. This is estimated to be 4 orders of magnitude faster than existing schemes, which only scale to small models with hundreds to thousands of parameters.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。