提出分层联邦域泛化方法,解决跨设备数据分布差异问题
HFedATM: Hierarchical Federated Domain Generalization via Optimal Transport and Regularized Mean Aggregation
- 通过最优传输对齐各层级模型卷积核,再用正则化均值聚合
- 在多个数据集上显著提升现有联邦域泛化方法性能
- 兼顾计算效率与鲁棒性,适合大规模分布式学习场景
联邦学习(FL)是一种去中心化方法,允许多个客户端在不共享原始数据的情况下协作训练全局模型。尽管有效,传统FL在参与设备增多时面临严重计算与通信瓶颈,集中式服务器成为性能瓶颈。分层联邦学习(HFL)通过将模型聚合任务分散至中间节点(站点),提升了系统可扩展性与容错能力。然而,HFL仍存在一个被忽视的关键问题:域偏移——不同客户端和站点间数据分布差异大,导致模型在未见目标域上表现下降。虽已有联邦域泛化(FedDG)方法提升对域偏移的鲁棒性,但其在HFL框架中的整合仍鲜有研究。本文首次正式提出分层联邦域泛化(HFedDG)新范式,并提出HFedATM方法:先通过逐滤波器最优传输对齐各站点模型,再采用考虑收缩效应的正则化均值聚合。大量实验表明,HFedATM显著提升现有FedDG基线在多个数据集上的性能,同时保持高效计算与通信开销。理论分析进一步证明,相较于标准分层平均,HFedATM能获得更紧的泛化误差界,实现更快收敛与稳定训练。
原文摘要 · Abstract (English)
Federated Learning (FL) is a decentralized approach where multiple clients collaboratively train a shared global model without sharing their raw data. Despite its effectiveness, conventional FL faces scalability challenges due to excessive computational and communication demands placed on a single central server as the number of participating devices grows. Hierarchical Federated Learning (HFL) addresses these issues by distributing model aggregation tasks across intermediate nodes (stations), thereby enhancing system scalability and robustness against single points of failure. However, HFL still suffers from a critical yet often overlooked limitation: domain shift, where data distributions vary significantly across different clients and stations, reducing model performance on unseen target domains. While Federated Domain Generalization (FedDG) methods have emerged to improve robustness to domain shifts, their integration into HFL frameworks remains largely unexplored. In this paper, we formally introduce Hierarchical Federated Domain Generalization (HFedDG), a novel scenario designed to investigate domain shift within hierarchical architectures. Specifically, we propose HFedATM, a hierarchical aggregation method that first aligns the convolutional filters of models from different stations through Filter-wise Optimal Transport Alignment and subsequently merges aligned models using a Shrinkage-aware Regularized Mean Aggregation. Our extensive experimental evaluations demonstrate that HFedATM significantly boosts the performance of existing FedDG baselines across multiple datasets and maintains computational and communication efficiency. Moreover, theoretical analyses indicate that HFedATM achieves tighter generalization error bounds compared to standard hierarchical averaging, resulting in faster convergence and stable training behavior.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。