arXiv:2409.19560cs.LGcs.RO2024-09被引 28

针对自动驾驶跨城数据差异,提出快速收敛且通信更少的联邦学习方法

Fast-Convergent and Communication-Alleviated Heterogeneous Hierarchical Federated Learning in Autonomous Driving

论文配图:Fast-Convergent and Communication-Alleviated Heterogeneous Hierarchical Federated Learning in Autonomous Driving
图 1 · 摘自论文原文
  • 用高斯分布建模图像和数据集统计特性,优化聚合权重
  • 相比现有最优方法,收敛速度提升35.5%~40.6%,通信开销减少29.65%
  • 适合需要跨区域部署模型且资源受限的自动驾驶系统

道路场景语义理解(TriSU)是自动驾驶中的复杂任务。由于不同城市间数据存在分布差异,单一地区训练的模型在其他地区泛化性能差。分层联邦学习(HFL)通过分布式数据协作训练可缓解此问题,但因数据统计差异大导致收敛慢。本文提出高斯异构联邦学习算法(FedGau),将单张RGB图像及整个数据集建模为高斯分布,用于设计聚合权重,不仅区分图像个体统计特征,还融合各城市数据集统计信息与数据量。该方法使收敛速度比现有SOTA HFL方法提升35.5%~40.6%。为进一步降低通信开销,引入性能感知自适应资源调度策略(AdapRS),动态调整不同层级的模型聚合次数,避免冗余通信。实验表明,相比传统静态调度策略,通信开销减少29.65%且性能几乎不变。

原文摘要 · Abstract (English)

Street Scene Semantic Understanding (denoted as TriSU) is a complex task for autonomous driving (AD). However, inference model trained from data in a particular geographical region faces poor generalization when applied in other regions due to inter-city data domain-shift. Hierarchical Federated Learning (HFL) offers a potential solution for improving TriSU model generalization by collaborative privacy-preserving training over distributed datasets from different cities. Unfortunately, it suffers from slow convergence because data from different cities are with disparate statistical properties. Going beyond existing HFL methods, we propose a Gaussian heterogeneous HFL algorithm (FedGau) to address inter-city data heterogeneity so that convergence can be accelerated. In the proposed FedGau algorithm, both single RGB image and RGB dataset are modelled as Gaussian distributions for aggregation weight design. This approach not only differentiates each RGB image by respective statistical distribution, but also exploits the statistics of dataset from each city in addition to the conventionally considered data volume. With the proposed approach, the convergence is accelerated by 35.5\%-40.6\% compared to existing state-of-the-art (SOTA) HFL methods. On the other hand, to reduce the involved communication resource, we further introduce a novel performance-aware adaptive resource scheduling (AdapRS) policy. Unlike the traditional static resource scheduling policy that exchanges a fixed number of models between two adjacent aggregations, AdapRS adjusts the number of model aggregation at different levels of HFL so that unnecessary communications are minimized. Extensive experiments demonstrate that AdapRS saves 29.65\% communication overhead compared to conventional static resource scheduling policy while maintaining almost the same performance.

联邦学习自动驾驶高效通信跨域泛化

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