Table of Contents
Fetching ...

Next Level Message-Passing with Hierarchical Support Graphs

Carlos Vonessen, Florian Grötschla, Roger Wattenhofer

TL;DR

This work tackles the limited receptive field of traditional MPNNs by introducing Hierarchical Support Graphs (HSGs), a flexible, multi-level augmentation created via recursive graph coarsening. HSGs integrate with existing MPNN architectures without modifying core message-passing modules, and are wired back to the original graph through vertical connections, forming a comprehensive graph $G^H$ with levels $H^{(i)}$. Theoretical bounds on the growth and connectivity of HSG-augmented graphs are complemented by extensive experiments showing state-of-the-art performance across several benchmarks, often surpassing virtual-node and certain graph-transformer baselines while maintaining scalable computation. Ablation studies reveal how coarsening choices, feature imputation, and adaptation of the prediction head influence performance, providing practical guidance for employing HSGs in diverse graph-learning tasks. Overall, HSGs offer a robust, scalable approach to enhance information flow in graphs, improving long-range communication with modest overhead and broad compatibility with standard GNN pipelines.

Abstract

Message-Passing Neural Networks (MPNNs) are extensively employed in graph learning tasks but suffer from limitations such as the restricted scope of information exchange, by being confined to neighboring nodes during each round of message passing. Various strategies have been proposed to address these limitations, including incorporating virtual nodes to facilitate global information exchange. In this study, we introduce the Hierarchical Support Graph (HSG), an extension of the virtual node concept created through recursive coarsening of the original graph. This approach provides a flexible framework for enhancing information flow in graphs, independent of the specific MPNN layers utilized. We present a theoretical analysis of HSGs, investigate their empirical performance, and demonstrate that HSGs can surpass other methods augmented with virtual nodes, achieving state-of-the-art results across multiple datasets.

Next Level Message-Passing with Hierarchical Support Graphs

TL;DR

This work tackles the limited receptive field of traditional MPNNs by introducing Hierarchical Support Graphs (HSGs), a flexible, multi-level augmentation created via recursive graph coarsening. HSGs integrate with existing MPNN architectures without modifying core message-passing modules, and are wired back to the original graph through vertical connections, forming a comprehensive graph with levels . Theoretical bounds on the growth and connectivity of HSG-augmented graphs are complemented by extensive experiments showing state-of-the-art performance across several benchmarks, often surpassing virtual-node and certain graph-transformer baselines while maintaining scalable computation. Ablation studies reveal how coarsening choices, feature imputation, and adaptation of the prediction head influence performance, providing practical guidance for employing HSGs in diverse graph-learning tasks. Overall, HSGs offer a robust, scalable approach to enhance information flow in graphs, improving long-range communication with modest overhead and broad compatibility with standard GNN pipelines.

Abstract

Message-Passing Neural Networks (MPNNs) are extensively employed in graph learning tasks but suffer from limitations such as the restricted scope of information exchange, by being confined to neighboring nodes during each round of message passing. Various strategies have been proposed to address these limitations, including incorporating virtual nodes to facilitate global information exchange. In this study, we introduce the Hierarchical Support Graph (HSG), an extension of the virtual node concept created through recursive coarsening of the original graph. This approach provides a flexible framework for enhancing information flow in graphs, independent of the specific MPNN layers utilized. We present a theoretical analysis of HSGs, investigate their empirical performance, and demonstrate that HSGs can surpass other methods augmented with virtual nodes, achieving state-of-the-art results across multiple datasets.
Paper Structure (28 sections, 6 theorems, 18 equations, 1 figure, 7 tables)

This paper contains 28 sections, 6 theorems, 18 equations, 1 figure, 7 tables.

Key Result

theorem thmcountertheorem

Given a graph $G$, let $D \in \mathbb{R}^{|V|\times|V|}$ be the diagonal matrix containing the node degrees and $A\in \mathbb{R}^{|V|\times|V|}$ be the adjacency matrix. Then $L=D-A$ defines the graph Laplacian. Furthermore, $L^+$ denotes the Moore-Penrose pseudoinverse of $L$ and $\mathbf{e}_x$ the

Figures (1)

  • Figure 1: Visualization of the graph coarsening procedure. First, the input graph $G$ is recursively coarsened by clustering nodes in the same layer. Consequently, each node corresponds to a super-node representing the cluster. Finally, the super-nodes and edges are integrated as regular nodes into the graph.

Theorems & Definitions (17)

  • definition thmcounterdefinition
  • definition thmcounterdefinition: Message-Passing Layer
  • theorem thmcountertheorem: Effective Resistance
  • definition thmcounterdefinition: Hitting Time
  • theorem thmcountertheorem: Resistance and Commute Time chandra1989electrical
  • definition thmcounterdefinition: Node Connectivity
  • definition thmcounterdefinition: Graph Coarsening
  • definition thmcounterdefinition: HSG Augmentation
  • theorem thmcountertheorem: Appendix \ref{['sec:proof-basic-props']}
  • definition thmcounterdefinition: Cumulative Coarsening
  • ...and 7 more