解决车联网中多模型协同训练的延迟与资源分配难题
HEART: Achieving Timely Multi-Model Training for Vehicle-Edge-Cloud-Integrated Hierarchical Federated Learning
- 采用同步异步混合聚合规则,应对车辆动态带来的训练挑战
- 提出HEART框架,显著降低全局训练延迟,提升多任务平衡性
- 适合研究车联网、联邦学习与边缘计算的工程师与研究人员
随着智能网联汽车快速发展,亟需高效机器学习方案以应对高移动性和数据分散问题。为此,车辆-边缘-云分层联邦学习(VEC-HFL)应运而生。然而,车辆常需同时执行多个机器学习任务,这一多模型训练环境带来三大挑战:不当聚合规则导致模型过时和训练延迟;车辆移动性阻碍模型回传,影响数据利用效率;不同任务间资源分配不均严重影响协同训练效果。本文首次针对动态VEC-HFL中的多模型训练问题,提出最小化全局训练延迟并保证任务平衡的目标,该问题被证明为NP-hard。为此设计了混合同步-异步聚合规则,并提出新型方法HEART。框架分两阶段运行:首先通过改进粒子群优化(PSO)与遗传算法(GA)结合的混合启发式方法实现任务均衡调度;其次采用低复杂度贪心算法确定车辆上任务的训练优先级。在真实数据集上的实验表明,HEART优于现有方法。
原文摘要 · Abstract (English)
The rapid growth of AI-enabled Internet of Vehicles (IoV) calls for efficient Machine Learning (ML) solutions that can handle high vehicular mobility and decentralized data. This has motivated the emergence of Hierarchical Federated Learning over vehicle-edge-cloud architectures (VEC-HFL). Nevertheless, one aspect which is underexplored in the literature on VEC-HFL is that vehicles often need to execute multiple ML tasks simultaneously, where this multi-model training environment introduces crucial challenges. First, improper aggregation rules can lead to model obsolescence and prolonged training times. Second, vehicular mobility may result in inefficient data utilization by preventing the vehicles from returning their models to the network edge. Third, achieving a balanced resource allocation across diverse tasks becomes of paramount importance as it majorly affects the effectiveness of collaborative training. We take one of the first steps towards addressing these challenges via proposing a framework for multi-model training in dynamic VEC-HFL with the goal of minimizing global training latency while ensuring balanced training across various tasks, a problem that turns out to be NP-hard. To facilitate timely model training, we introduce a hybrid synchronous-asynchronous aggregation rule. Building on this, we present a novel method called Hybrid Evolutionary And gReedy allocaTion (HEART). The framework operates in two stages: first, it achieves balanced task scheduling through a hybrid heuristic approach that combines improved Particle Swarm Optimization (PSO) and Genetic Algorithms (GA); second, it employs a low-complexity greedy algorithm to determine the training priority of assigned tasks on vehicles. Experiments on real-world datasets demonstrate the superiority of HEART over existing methods.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。