1 citations · 1 across the 5 of their papers we have counts for
5 papers · 1 filter
EDiS: Edge Disjoint Subgraph Sparsification Framework for Graph Neural Networks
Sai Karthik Navuluru, Siddhartha Shankar Das, Franck Dernoncourt +7
Sparse GNN training reduces computation, but deciding which edges to keep can be costly. Reusing one sparse graph is cheap, but locks training to a fixed topology, while varying it…
Scaffold: Support Graph Theory Based Sparsification for Graph Neural Networks
Siddhartha Shankar Das, Sai Karthik Navuluru, S M Ferdous +7
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…
Unifying Graph Neural Networks Through a Common Layer Equation
Sai Karthik Navuluru, Siddhartha Shankar Das, Bo Ni +9
Graph neural networks are commonly described through family-specific equations whose notation obscures shared computations and structural differences. We introduce a common layer e…
Forward Learning of Graph Neural Networks
Namyong Park, Xing Wang, Antoine Simoulin +5
Graph neural networks (GNNs) have achieved remarkable success across a wide range of applications, such as recommendation, drug discovery, and question answering. Behind the succes…
GLEMOS: Benchmark for Instantaneous Graph Learning Model Selection
Namyong Park, Ryan Rossi, Xing Wang +3
The choice of a graph learning (GL) model (i.e., a GL algorithm and its hyperparameter settings) has a significant impact on the performance of downstream tasks. However, selecting…