כתבה
arXiv cs.LG ·
Scaffold: Support Graph Theory Based Sparsification for Graph Neural Networks
תקציר מקורי באנגליתarXiv:2609.31466v1 Announce Type: new Abstract: Graph neural networks (GNNs) rely on message passing over graph edges, making their computational and memory costs strongly dependent on graph density. Graph sparsification offers a natural way to reduce these costs, but removing edges indiscriminately can distort important communication structure and degrade predictive performance. We introduce Scaffold, a topology-based, unsupervised graph sparsification framework derived from support graph theory preconditioners. Scaffold explicitly controls two complementary structural quantities: dilation, which measures the length of rerouting paths induced by removed edges, and congestion, which measures how strongly these rerouted paths concentrate on the retained support. By jointly controlling dilat
קרא במקור המקורי
arxiv.org
פתח כתבה מקורית