arXiv Machine Learning

Traffic Engineering in Large-scale Networks with Generalizable Graph Neural Networks

The paper introduces TELGEN, a traffic engineering algorithm that uses graph neural networks to predict an optimal TE algorithm rather than a direct solution. TELGEN generalizes across diverse network topologies and traffic patterns, achieving less than a 3% optimality gap on networks up to 5,000 nodes and 3.6 million links, while reducing solving time by up to 84% and training time by up to 79.6% compared to existing methods.

arXiv Machine Learning
Aug 20

Online Learning for Dynamic Constellation Topologies

The paper proposes an online learning framework for configuring dynamic constellation topologies in satellite networks, addressing the challenges posed by continuous orbital movement and node maneuvering. It does not rely on predefined orbital plane structures, making it robust to changes caused by satellite maneuvers. Experiments show that the method performs comparably to state‑of‑the‑art offline techniques and can be adapted to constrained online learning, balancing per‑iteration computational cost against convergence speed.

By Jo\~ao Norberto, Ricardo Ferreira, Cl\'audia Soares
arXiv Machine Learning
Jun 9

Efficient Traffic Prediction at Scale: A Systematic Study of STGCN Architectural Depth

arXiv:2606. 09539v1 Announce Type: new Abstract: Spatio-temporal graph neural networks (STGNNs) have become the dominant approach for traffic prediction, yet their computational requirements pose challenges for practical deployment in intelligent transportation systems (ITS).

By Soban Nasir Lone, Mohamed Abouelela, Taeyoung Yu, Jiwon Kim, Constantinos Antoniou
arXiv AI
Jun 12

Lightweight and Interpretable Transformer via Mixed Graph Algorithm Unrolling for Traffic Forecast

arXiv:2505. 13102v4 Announce Type: replace-cross Abstract: Unlike conventional "black-box" transformers with classical self-attention mechanism, we build a lightweight and interpretable transformer-like neural net by unrolling a mixed-graph-based optimization algorithm to forecast traffic with spatial and temporal dimensions.

By Ji Qi, Tam Thuc Do, Mingxiao Liu, Zhuoshi Pan, Yuzhe Li, Gene Cheung, H. Vicky Zhao
arXiv Machine Learning
Jul 17

Low-Latency Relay Selection in NR-V2X Vehicular Communications via Graph Isomorphism Networks with Edge Features

arXiv:2607. 14176v1 Announce Type: new Abstract: Reliable, low-latency uplink connectivity is a key requirement for C-V2X networks in dense urban environments, where fast channel variations and blockages often degrade direct vehicle-to-infrastructure links.

By Giambattista Amati, Federica Mangiatordi, Emiliano Pallotti, Simone Angelini, Pierpaolo Salvo, Paola Vocca
Hugging Face Trending Papers
Jul 29

Neural Architecture Search for Traffic Prediction: A Survey of Methods, Challenges, and Future Directions

Traffic prediction is a core task in intelligent transportation systems, supporting applications such as adaptive signal control, route guidance, and ride-hailing dispatch. Deep learning models, including graph convolutional networks, recurrent networks, and Transformers, achieve strong results on standard benchmarks, but their architectures are designed by hand, requiring significant expert effort and producing models that often generalize poorly across cities and datasets.

arXiv AI
5d ago

AI-Driven Real-Time Relay Optimisation in Smart Urban NR-V2X Networks via Learning-to-Optimise Graph Neural Networks

The paper introduces an AI-driven Learning-to-Optimise framework that uses Graph Neural Networks to select real‑time multi‑hop relays in NR‑V2X networks for smart cities. By modelling the vehicular network as a graph and training a GINE model with MILP‑derived optimal decisions, the method achieves near‑optimal connectivity, improving connectivity by up to 11.3% and speeding up computation by up to 100×. This enables scalable, real‑time network control suitable for Industry 4.0 and smart‑city deployments.

By Giambattista Amati, Federica Mangiatordi, Emiliano Pallotti, Simone Angelini