arXiv:2607. 13763v1 Announce Type: cross Abstract: Single-task fine-tuning of graph neural networks (GNNs) for power grid problems exhibits a systematic failure mode: models that achieve the lowest in-distribution error degrade the most under topology shift.
By Charilaos Papaioannou, Ioannis Tsantilas, Dimitris Giannakakos, Vasilis Michalakopoulos, Sotiris Pelekis, Vangelis Marinakis, Arsam Aryandoust, Antonello Monti, Ricardo J. Bessa, Perdo P. Vergara, Jochen Cremer, Elissaios Sarmas
arXiv:2602. 01553v3 Announce Type: replace-cross Abstract: Link prediction is a core challenge in graph machine learning, demanding models that capture rich and complex topological dependencies.
By Quang Truong, Yu Song, Donald Loveland, Mingxuan Ju, Tong Zhao, Neil Shah, Jiliang Tang
Single-task fine-tuning of graph neural networks (GNNs) for power grid problems exhibits a systematic failure mode: models that achieve the lowest in-distribution error degrade the most under topology shift. We term this topology overfitting: the tendency of task-specific gradient signals to encode relational structure particular to the training topologies rather than the underlying physics, causing models to fail on unseen grids despite strong in-distribution performance.
The paper introduces RGC‑Net, a Reservoir‑Based Graph Convolutional Network that combines fixed‑random reservoir dynamics with a structured convolutional framework for graph learning. It addresses limitations of existing reservoir‑based GNNs by adding a leaky integrator for better feature retention and a robust, adaptable architecture for graph classification and generation. Experiments demonstrate state‑of‑the‑art performance on classification and generative tasks, including dynamic brain connectivity, with faster convergence and reduced over‑smoothing.
By Mayssa Soussia, Gita Ayu Salsabila, Mohamed Ali Mahjoub, Islem Rekik
arXiv:2609.16738v1 Announce Type: cross
Abstract: Power Flow (PF), Optimal Power Flow (OPF), and State Estimation (SE) are fundamental problems in power system analysis, but solving them is computati...
By Ferran Bohigas-Daranas, Hamid Latif-Mart\'inez, Eduardo Prieto-Araujo, Oriol Gomis-Bellmunt, Pere Barlet-Ros
arXiv:2603. 06952v2 Announce Type: replace Abstract: As graphs scale to billions of nodes and edges, graph Machine Learning workloads are constrained by the cost of multi-hop traversals over exponentially growing neighborhoods.
By Yuhang Song, Naima Abrar Shami, Romaric Duvignau, Vasiliki Kalavri