arXiv Machine Learning By Van-Truong Le

When does a spectral prior help graph learning? Connectivity-loss estimation under road-network disruptions

Read the original on arXiv Machine Learning →

The paper investigates how graph neural networks can quickly estimate the loss of algebraic connectivity after multiple road-link disruptions, comparing learned corrections to first‑order Fiedler sensitivity with analytical baselines. Experiments on synthetic failures and real OpenStreetMap data across six countries show that residual GCN and GraphSAGE models reduce mean absolute error for spatial and targeted failures, while second‑order perturbation offers minimal improvement. The study also demonstrates that sparse scaling allows the approach to scale to 20,000 nodes and that the spectral residual acts as a domain‑sensitive inductive bias for connectivity screening.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
5d ago

Scaffold: Support Graph Theory Based Sparsification for Graph Neural Networks

Scaffold is a new unsupervised graph sparsification framework for graph neural networks that uses support graph theory preconditioners to jointly control dilation and congestion, thereby preserving short communication paths while avoiding bottlenecks. It achieves superior aggregate ranking across 19 homophilic and heterophilic benchmarks, recovering or closely approaching full‑graph GNN performance with only 10%–50% of the original edges. The method reduces memory usage to less than half and cuts end‑to‑end training time, including sparsification overhead.

By Siddhartha Shankar Das, Sai Karthik Navuluru, S M Ferdous, Ryan A. Rossi, Baris Coskunuzer, Lakshman Tamil, Edoardo Serra, Alex Pothen, Robert Rallo, Mahantesh M Halappanavar