Early-Exit Graph Neural Networks
Andrea Giuseppe Di Francesco, Maria Sofia Bucarelli, Franco Maria Nardini, Raffaele Perego, Nicola Tonellotto, Fabrizio Silvestri

TL;DR
This paper introduces Early-Exit GNNs with symmetry-based inductive biases that enable adaptive inference, reducing computation on simple graphs while maintaining accuracy on complex ones, thus improving efficiency in graph learning tasks.
Contribution
We propose Symmetric-Anti-Symmetric GNNs and attach confidence-aware exit heads to create adaptive Early-Exit GNNs that optimize inference efficiency and accuracy.
Findings
EEGNNs learn task-driven exit strategies.
Achieve favorable accuracy-efficiency trade-offs.
Perform well on heterophilic and long-range graph tasks.
Abstract
Early-exit mechanisms allow deep neural networks to stop inference once prediction confidence is high, reducing latency and energy on easy inputs while retaining full-depth accuracy on harder ones. Similarly, adding early exit mechanisms to Graph Neural Networks (GNNs), the go-to models for graph-structured data, allows for dynamic trading depth for confidence on simple graphs while maintaining full-depth accuracy on harder ones to capture intricate relationships. Yet, their potential in deep GNNs, where over-smoothing, over-squashing or more generally vanishing gradients prevent these model to properly learn, remains largely unexplored. To address this, we introduce Symmetric-Anti-Symmetric GNNs (SAS-GNN), whose symmetry-based inductive biases yield stable intermediate representations that support safe early exits. Building on this backbone, we propose Early-Exit GNNs (EEGNNs), which…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
