在联邦学习中高效安全地计算分类器的ROC与PR曲线
Federated Computation of ROC and PR Curves
- 通过分布式差分隐私估计预测得分分布分位数来近似曲线
- 实测在低通信开销下保持高精度,面积误差可控
- 适合需要隐私保护的医疗、金融等联邦模型评估场景
受试者工作特征(ROC)和精确率-召回率(PR)曲线是评估机器学习分类器的核心工具,能揭示真正例率与假正例率(ROC)或精确率与召回率(PR)之间的权衡关系。然而,在联邦学习中,数据分散于多个客户端,由于隐私和通信限制,难以计算这些曲线——服务器无法获取原始预测得分和标签。本文提出一种新方法,在联邦设置下通过分布式差分隐私估计预测得分分布的分位数,以近似实现ROC和PR曲线。我们给出了真实曲线与估计曲线间面积误差(AE)的理论边界,揭示了近似精度、隐私水平与通信成本之间的权衡。在真实数据集上的实验表明,该方法仅需极少通信即可达到高精度,并提供强隐私保障,适用于隐私保护的联邦系统模型评估。
原文摘要 · Abstract (English)
Receiver Operating Characteristic (ROC) and Precision-Recall (PR) curves are fundamental tools for evaluating machine learning classifiers, offering detailed insights into the trade-offs between true positive rate vs. false positive rate (ROC) or precision vs. recall (PR). However, in Federated Learning (FL) scenarios, where data is distributed across multiple clients, computing these curves is challenging due to privacy and communication constraints. Specifically, the server cannot access raw prediction scores and class labels, which are used to compute the ROC and PR curves in a centralized setting. In this paper, we propose a novel method for approximating ROC and PR curves in a federated setting by estimating quantiles of the prediction score distribution under distributed differential privacy. We provide theoretical bounds on the Area Error (AE) between the true and estimated curves, demonstrating the trade-offs between approximation accuracy, privacy, and communication cost. Empirical results on real-world datasets demonstrate that our method achieves high approximation accuracy with minimal communication and strong privacy guarantees, making it practical for privacy-preserving model evaluation in federated systems.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。