arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2405.14432cs.LG

面向鲁棒联邦学习的自适应梯度裁剪

Adaptive Gradient Clipping for Robust Federated Learning

EPFL(苏黎世联邦理工学院);University of Copenhagen(哥本哈根大学)

Youssef Allouah, Rachid Guerraoui, Nirupam Gupta, Ahmed Jellouli, Geovani Rizk, John Stephan

AI总结:

针对联邦学习中静态梯度裁剪对不同攻击鲁棒性不一致的问题,本文提出自适应鲁棒裁剪方法ARC,动态调整裁剪阈值,在保持理论鲁棒性保证的同时改善收敛性,并通过图像分类实验验证其在异构对抗环境下的有效性。

摘要:

鲁棒联邦学习旨在即使存在对抗性或行为异常的参与方时,也能保持可靠的性能。尽管最先进的鲁棒分布式梯度下降方法在理论上已被证明是最优的,但其实际成功往往依赖于聚合前的梯度裁剪。然而,现有的静态裁剪策略产生的结果并不一致:对某些攻击能增强鲁棒性,但对其他攻击则无效甚至有害。为了解决这一局限性,我们提出了一种有原则的自适应裁剪策略,称为自适应鲁棒裁剪(ARC),它根据输入梯度动态调整裁剪阈值。我们证明,ARC不仅保留了最先进鲁棒分布式梯度下降方法的理论鲁棒性保证,而且在模型初始化良好时可证明地改善渐近收敛性。在基准图像分类任务上的大量实验证实了这些理论见解,表明ARC显著增强了鲁棒性,尤其是在高度异构和对抗性环境中。

英文摘要:

Robust federated learning aims to maintain reliable performance despite the presence of adversarial or misbehaving workers. While state-of-the-art (SOTA) robust distributed gradient descent (Robust-DGD) methods were proven theoretically optimal, their empirical success has often relied on pre-aggregation gradient clipping. However, existing static clipping strategies yield inconsistent results: enhancing robustness against some attacks while being ineffective or even detrimental against others. To address this limitation, we propose a principled adaptive clipping strategy, Adaptive Robust Clipping (ARC), which dynamically adjusts clipping thresholds based on the input gradients. We prove that ARC not only preserves the theoretical robustness guarantees of SOTA Robust-DGD methods but also provably improves asymptotic convergence when the model is well-initialized. Extensive experiments on benchmark image classification tasks confirm these theoretical insights, demonstrating that ARC significantly enhances robustness, particularly in highly heterogeneous and adversarial settings.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑