动态剪枝降低交通预测通信开销,提升对突发路况的响应能力。
Adaptive Graph Pruning with Sudden-Events Evaluation for Traffic Prediction using Online Semi-Decentralized ST-GNNs
- 根据模型表现自适应剪枝邻居特征,减少冗余传输。
- 在两个数据集上验证,通信量显著下降而精度保持稳定。
- 新指标SEPA能更好捕捉交通突变事件,适合边缘实时预测场景。
时空图神经网络(ST-GNNs)适用于智能交通系统中来自地理分布传感器的高频数据流处理。然而,在分布式计算节点(云盒)上部署时,因相邻云盒间重复传输重叠节点特征,造成巨大通信开销。为此,我们提出一种自适应剪枝算法,动态过滤冗余邻域特征,同时保留对预测最有信息量的空间上下文。该算法根据近期模型性能调整剪枝率,使每个云盒聚焦于发生交通变化的区域,而不牺牲准确性。此外,我们引入突发事件预测准确率(SEPA),一种面向事件的新指标,用于衡量对交通减速与恢复的响应能力,这常被标准误差指标忽略。我们在在线半去中心化设置下,使用传统联邦学习、无服务器联邦学习和八卦学习,在两个大规模交通数据集PeMS-BAY和PeMSD7-M上,评估了短、中、长期预测任务。实验表明,与标准指标相比,SEPA揭示了空间连通性在预测动态且不规则交通中的真实价值。我们的自适应剪枝算法在所有在线半去中心化设置中均保持预测精度的同时显著降低通信成本,证明通信可压缩而不影响对关键交通事件的响应能力。
原文摘要 · Abstract (English)
Spatio-Temporal Graph Neural Networks (ST-GNNs) are well-suited for processing high-frequency data streams from geographically distributed sensors in smart mobility systems. However, their deployment at the edge across distributed compute nodes (cloudlets) createssubstantial communication overhead due to repeated transmission of overlapping node features between neighbouring cloudlets. To address this, we propose an adaptive pruning algorithm that dynamically filters redundant neighbour features while preserving the most informative spatial context for prediction. The algorithm adjusts pruning rates based on recent model performance, allowing each cloudlet to focus on regions experiencing traffic changes without compromising accuracy. Additionally, we introduce the Sudden Event Prediction Accuracy (SEPA), a novel event-focused metric designed to measure responsiveness to traffic slowdowns and recoveries, which are often missed by standard error metrics. We evaluate our approach in an online semi-decentralized setting with traditional FL, server-free FL, and Gossip Learning on two large-scale traffic datasets, PeMS-BAY and PeMSD7-M, across short-, mid-, and long-term prediction horizons. Experiments show that, in contrast to standard metrics, SEPA exposes the true value of spatial connectivity in predicting dynamic and irregular traffic. Our adaptive pruning algorithm maintains prediction accuracy while significantly lowering communication cost in all online semi-decentralized settings, demonstrating that communication can be reduced without compromising responsiveness to critical traffic events.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。