arXiv:2608.15256cs.AIcs.LG2026-08中稿 · IEEE Transactions …

解决异构多任务语义通信中的负迁移问题,提升分布式学习效果。

Decentralized Federated Learning for Heterogeneous Multi-Task Semantic Communication

论文配图:Decentralized Federated Learning for Heterogeneous Multi-Task Semantic Communication
图 1 · 摘自论文原文
  • 通过路径路由分离任务特征与共享表示,保护本地数据特性。
  • 设计通信-聚合同步协议,按任务亲和性校准共识矩阵,阻断不匹配更新。
  • 理论揭示拓扑混合深度的最优解,在NYU-v2上提升4.77%性能。

分布式语义通信网络中的协同训练通常依赖去中心化联邦学习(DFL)。然而,将与拓扑无关的聚合引入异构多任务环境,会引发根本性瓶颈:导致负迁移和过度共识偏差(OCB)。本文提出一种个性化的DSC框架,切断跨任务干扰。节点层面采用策略驱动的多路径路由机制,将任务特定特征与共享表示分离,以保持本地保真度。网络层面部署“通信-聚合”同步协议,利用任务亲和性校准列随机共识矩阵,仅允许互补知识吸收,主动阻断不匹配参数更新。为保证收敛,我们推导了统一的李雅普诺夫漂移分析,揭示严格倒U型权衡:更深的拓扑混合降低方差但放大结构性OCB。解决该张力后,获得最优聚合深度的闭式表达。在NYU-v2数据集上评估显示,存在不足聚合与过度拓扑混合之间的明确权衡。在理论推导的最优聚合深度下,本方法相较无聚合基线实现4.77%的全局相对提升,并优于去中心化FedAvg、FedAMP及启发式最大聚合。进一步在Taskonomy和非理想无线链路下评估,考察网络规模变化与链路可靠性的影响。

原文摘要 · Abstract (English)

Collaborative training in distributed semantic communication (DSC) networks typically relies on decentralized federated learning (DFL). However, pushing topology-agnostic aggregation into heterogeneous, multi-task environments creates a fundamental bottleneck: it drives negative transfer and overconsensus bias (OCB). This paper introduces a personalized DSC framework that cuts off this cross-task interference. At the node level, a policy-driven multi-path routing mechanism separates task-specific features from shared representations to preserve local fidelity. Across the network, we deploy a "communicationwhile- aggregation" protocol. It calibrates a column-stochastic consensus matrix using task affinities. This limits the system to absorbing complementary knowledge while actively blocking mismatched parameter updates. To bound the convergence, we derive a unified Lyapunov drift analysis. We reveal a strict Ushaped trade-off: deeper topological mixing reduces variance but amplifies structural OCB. Resolving this tension yields a closed-form expression for the optimal aggregation depth. We evaluate the proposed framework on NYU-v2, where the results reveal a clear trade-off between insufficient aggregation and excessive topological mixing. At the analytically derived optimal aggregation depth, our method achieves a 4.77% global relative improvement over the no-aggregation baseline and outperforms decentralized FedAvg, FedAMP, and heuristic max aggregation. We further evaluate the framework on Taskonomy and imperfect wireless links to examine the effects of network-size variation and wireless-link reliability.

联邦学习语义通信异构任务去中心化

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