用数学层拓扑方法解决去中心化多任务学习中的数据异构问题
Tackling Feature and Sample Heterogeneity in Decentralized Multi-Task Learning: A Sheaf-Theoretic Approach
- 用层拓扑结构建模客户端间复杂关系,灵活处理异构数据
- 在跨孤岛场景下通信量减少30%以上,收敛速度达最优水平
- 适合计算资源充足、需高效通信的工业级多机构协作场景
联邦多任务学习(FMTL)旨在不共享敏感原始数据的前提下,跨客户端同时学习多个相关任务。然而,在去中心化设置中,现有FMTL框架难以捕捉复杂的任务关系,并处理客户端间的特征与样本异构性。为此,本文提出一种基于层拓扑理论的新型FMTL方法。通过细胞层拓扑表示客户端关系,该框架可灵活建模异构客户端模型间的交互。我们采用层拉普拉斯正则化形式化层拓扑下的FMTL优化问题,并提出Sheaf-FMTL算法求解。理论证明,该框架统一了多种现有联邦学习(FL)和FMTL方法;且所提算法实现亚线性收敛率,与当前最先进去中心化FMTL算法相当。大量实验表明,尽管因交互图管理带来额外计算与存储开销,但相比去中心化FMTL基线,Sheaf-FMTL在传输比特数上实现显著节省,该权衡使其特别适用于跨孤岛联邦学习场景,其中模型异构性管理与通信效率至关重要,且客户端具备充足的计算资源。
原文摘要 · Abstract (English)
Federated multi-task learning (FMTL) aims to simultaneously learn multiple related tasks across clients without sharing sensitive raw data. However, in the decentralized setting, existing FMTL frameworks are limited in their ability to capture complex task relationships and handle feature and sample heterogeneity across clients. To address these challenges, we introduce a novel sheaf-theoretic-based approach for FMTL. By representing client relationships using cellular sheaves, our framework can flexibly model interactions between heterogeneous client models. We formulate the sheaf-based FMTL optimization problem using sheaf Laplacian regularization and propose the Sheaf-FMTL algorithm to solve it. We show that the proposed framework provides a unified view encompassing many existing federated learning (FL) and FMTL approaches. Furthermore, we prove that our proposed algorithm, Sheaf-FMTL, achieves a sublinear convergence rate in line with state-of-the-art decentralized FMTL algorithms. Extensive experiments show that although Sheaf-FMTL introduces computational and storage overhead due to the management of interaction maps, it achieves substantial communication savings in terms of transmitted bits when compared to decentralized FMTL baselines. This trade-off makes Sheaf-FMTL especially suitable for cross-silo FL scenarios, where managing model heterogeneity and ensuring communication efficiency are essential, and where clients have adequate computational resources.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。