arXiv:2504.01839math.OCcs.LG2025-04中稿 · the 64th IEEE Conf…

解决联邦学习中的客户端异构问题,无需依赖传统假设。

A Randomized Zeroth-Order Hierarchical Framework for Heterogeneous Federated Learning

  • 将异构联邦学习建模为分层优化问题,实现个性化训练。
  • 提出零阶方法ZO-HFL,具有非渐近收敛性保证。
  • 适合异构数据分布强、无梯度一致性假设的场景。

联邦学习中的异构性是影响模型性能与收敛的关键挑战。本文将异构联邦学习建模为分层优化问题,通过双层框架同时捕捉本地与全局训练过程。该框架支持:(i) 基于个性化学习应对客户端异构;(ii) 捕捉服务器端预训练过程;(iii) 采用非标准聚合更新全局模型;(iv) 允许非相同本地迭代步数;(v) 考虑客户端局部约束。设计并分析了一种隐式零阶联邦学习方法ZO-HFL,对服务器代理和各客户端代理均提供非渐近收敛性保证,且在几乎必然意义下具备渐近收敛性。显著之处在于不依赖异构联邦学习中的标准假设,如有界梯度差异条件。在图像分类任务上实现并对比多种异构设置下的方法表现。

原文摘要 · Abstract (English)

Heterogeneity in federated learning (FL) is a critical and challenging aspect that significantly impacts model performance and convergence. In this paper, we propose a novel framework by formulating heterogeneous FL as a hierarchical optimization problem. This new framework captures both local and global training processes through a bilevel formulation and is capable of the following: (i) addressing client heterogeneity through a personalized learning framework; (ii) capturing the pre-training process on the server side; (iii) updating the global model through nonstandard aggregation; (iv) allowing for nonidentical local steps; and (v) capturing clients' local constraints. We design and analyze an implicit zeroth-order FL method (ZO-HFL), equipped with nonasymptotic convergence guarantees for both the server-agent and the individual client-agents, and asymptotic guarantees for both the server-agent and client-agents in an almost sure sense. Notably, our method does not rely on standard assumptions in heterogeneous FL, such as the bounded gradient dissimilarity condition. We implement our method on image classification tasks and compare with other methods under different heterogeneous settings.

联邦学习异构性零阶优化

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