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 predictiv...
Siddhartha Shankar Das, S. Navuluru, S. M. Ferdous et al.· 0 citations
We propose SGS-GNN, a supervised graph sparsifier for Graph Neural Networks (GNNs) to improve predictive performance and reduce the cost of message passing by removing task-irrelevant edges. Existing unsupervised sparsifiers are not task-aware, while existing supervised sparsifiers suffer from significant memory overhe...
Siddhartha Shankar Das, Naheed Anjum Arafat, Muftiqur Rahman et al.· Proceedings of the 32nd ACM...· 1 citation
SGS-GNN improves F1-scores by 4% relative to full training and up to 30% on heterophilic graphs and outperforms state-of-the-art methods by 4–7% at similar sparsity levels while reducing peak memory usage by up to 3.9×.
Siddhartha Shankar Das, Naheed Anjum Arafat, Muftiqur Rahman et al.· Proceedings of the 32nd ACM...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.