cs.LGNov 16, 2026

LINK: Lightweight and Inductive Node-to-Node Propagation Rule Learning for Traffic Kriging

Authors: You Shang, Yu-Kwan Ching, Weifeng Su, Guanyao Li, Ruiyuan Li, Gary Shueng-Han Chan

Organizations: Beijing Normal-Hong Kong Baptist University, Zhuhai, China · Hong Kong Baptist University, Hong Kong SAR, China · The Hong Kong University of Science and Technology, Hong Kong SAR, China · Chongqing University, Chongqing, China

Abstract

Spatio-temporal traffic kriging aims to reconstruct traffic time series at unobserved locations with no historical traffic observations by leveraging spatial and temporal dependencies across the road network. Existing Graph Neural Network (GNN)-based approaches primarily rely on neighborhood aggregation to capture spatial dependencies, thereby modeling traffic interactions implicitly and making it difficult to accurately recover traffic magnitudes at locations without historical observations. To address this limitation, we propose LINK, a Lightweight and Inductive Node-to-node propagation rule learning paradigm for traffic Kriging. LINK introduces three key designs: 1) a propagation-centric traffic kriging paradigm that explicitly learns a shared node-to-node transition rule; 2) a context-aware Spectral Propagation Network that performs traffic-state propagation in both the spectral and time domains; and 3) TraffiKrig, a realistic traffic kriging benchmark that preserves heterogeneous road-segment characteristics and road-specific metadata while enabling systematic comparison of representative kriging methods under a unified metadata-enhanced setting. Extensive experiments demonstrate that LINK achieves strong reconstruction accuracy and computational efficiency. Compared with the strongest baseline on each subset, LINK achieves an average MAE reduction of 54.7% over original baselines. LINK also achieves substantial efficiency improvements, reducing training time by 66.5% and inference time by 86.6% compared with the fastest competing methods. Zero-shot experiments further demonstrate the transferability of the learned propagation rule across regions.

Figures & tables

Explore similar work

Apr 10, 2025

Efficient Traffic State Prediction With Dynamic Joint Spatio-Temporal Relation Inference

Traffic prediction is difficult due to the complex interplay of temporal evolution, spatial interactions, and delayed spatio-temporal propagation over road networks. Existing methods either model spatial and temporal dependencies separately or employ unified spatio-temporal structures, but they often insufficiently characterize how neighboring sensors at historical timestamps influence a target node, while complex joint models may incur high computation. This paper proposes STEI-PCN, an efficient pure convolutional network based on spatio-temporal encoding and relation inference. It first builds a local causal joint spatio-temporal graph to restrict candidate interactions, then uses absolute position and relative distance encodings to infer dynamic edge weights. A single-layer graph convolution with a position-aware gated activation unit captures local joint dependencies, and temporal dilated causal convolutions complement long-range temporal patterns. A multi-view prediction module fuses raw, local propagation, and long-range temporal representations for direct multi-step forecasting. Experiments on PeMS03, PeMS04, PeMS07, PeMS08, and PeMS-Bay under multiple horizons show that STEI-PCN achieves competitive accuracy with moderate parameters and low training and inference costs. Ablation and fluctuation analyses further verify the contributions of the main components and empirically analyze the effects of the training-stage constraints under sharp speed changes. Our code is available at a GitHub link https://github.com/Jessez2/STEI-PCN.
Oct 18, 2026

Spectral Adaptive Graph Transformer for Efficient and Scalable Traffic Forecasting

Traffic forecasting models based on spectral graph convolution offer an interpretable account of how information is mixed between sensors, but they rely on an eigendecomposition of the graph Laplacian. It costs cubic time, is fixed by the road network, and provides a symmetric operator that cannot represent the directed propagation of traffic congestion. Attention-based spatio-temporal transformers remove these limitations but generate a dense sensor-by-sensor attention map at each layer and time step, so memory, rather than accuracy, becomes the binding constraint on large networks. We introduce the spectral adaptive graph transformer, whose spatial operator is learned rather than derived from the Laplacian, directed rather than symmetric, and conditioned on the current traffic state rather than a static state, at a cost linear in the number of sensors. A sparse road graph diffusion branch provides the strictly local propagation that a low-rank operator cannot express, and a zero-initialized gate learns the balance between the two. Before spatial mixing, a unit-mean-gain frequency-bin attention module reweights each sensor's short-term periodicities according to its identity and current context. Across six public benchmarks spanning 170 to 1843 sensors, evaluated over three random seeds, the proposed model attains the lowest error of any single end-to-end model on one benchmark and remains competitive with the strongest current attention models on the others, while using about a quarter of their memory and training about twice as fast.
May 28, 2026

Graph-Conditioned Mixture of Graph Neural Network Experts for Traffic Forecasting

Spatio-temporal forecasting on sensor graphs is commonly tackled with a single backbone architecture applied uniformly across all nodes, although graph regions can exhibit different dynamics. Road segments differ in functional class, structure, and traffic behavior, suggesting that node-wise expert specialization can be useful. We propose GC-MoE, a graph-conditioned mixture of experts framework that assigns each node a personalized combination of frozen forecasting experts based on graph topology and the recent traffic input window. GC-MoE combines frozen pretrained spatio-temporal GNN experts with an input-aware, spatially contextualized router while training only a lightweight routing module. We also study a bounded graph-conditioned output refinement layer as an optional extension and include node-adaptive ST-LoRA adapters only as an ablation diagnostic. Across four standard benchmarks (PEMS04, PEMS07, METR-LA, and PEMS-BAY), GC-MoE improves MAE over a zero-parameter ensemble baseline, with competitive RMSE and MAPE, while training only ~17K parameters on top of 1.5M frozen expert weights. The implementation is available at https://github.com/Ahghaffari/gc_moe.