提升联邦推理的抗攻击能力,让多个本地模型协作更可靠。
Robust Federated Inference
- 用深度集合模型设计非线性聚合,增强对抗攻击鲁棒性。
- 在多个基准上提升4.7至22.2个百分点准确率。
- 适合关注隐私保护与模型安全的工业级部署场景。
联邦推理以单次联邦学习、边缘集成或联邦集成等形式出现,成为结合多个模型预测的吸引人方案。该范式使每个模型保持本地和私有,而中心服务器查询并聚合预测。然而,联邦推理的鲁棒性长期被忽视,易受简单攻击影响。为此,我们正式提出鲁棒联邦推理问题,并首次对该类方法进行鲁棒性分析。对基于平均的聚合器分析表明,聚合误差小当诚实响应间差异小或两类最可能类别间置信度差大时。超越线性平均,我们发现非线性聚合器的鲁棒性问题可转化为对抗机器学习问题。进而提出一种新方法:结合对抗训练与测试时鲁棒聚合,使用DeepSet聚合模型实现。该组合在多个基准上显著提升性能,较现有鲁棒聚合方法提升4.7至22.2个百分点准确率。
原文摘要 · Abstract (English)
Federated inference, in the form of one-shot federated learning, edge ensembles, or federated ensembles, has emerged as an attractive solution to combine predictions from multiple models. This paradigm enables each model to remain local and proprietary while a central server queries them and aggregates predictions. Yet, the robustness of federated inference has been largely neglected, leaving them vulnerable to even simple attacks. To address this critical gap, we formalize the problem of robust federated inference and provide the first robustness analysis of this class of methods. Our analysis of averaging-based aggregators shows that the error of the aggregator is small either when the dissimilarity between honest responses is small or the margin between the two most probable classes is large. Moving beyond linear averaging, we show that problem of robust federated inference with non-linear aggregators can be cast as an adversarial machine learning problem. We then introduce an advanced technique using the DeepSet aggregation model, proposing a novel composition of adversarial training and test-time robust aggregation to robustify non-linear aggregators. Our composition yields significant improvements, surpassing existing robust aggregation methods by 4.7 - 22.2% in accuracy points across diverse benchmarks.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。