The Role of Node Features in Graph Pooling

Jan von Pichowski; Alžbeta Hrabošová; Ingo Scholtes; Christopher Blöcker

cs.LGMay 7, 2026

The Role of Node Features in Graph Pooling

Authors: Jan von Pichowski, Alžbeta Hrabošová, Ingo Scholtes, Christopher Blöcker

Abstract

Graph pooling is commonly applied in graph classification, yet its empirical gains over standard WL-1 expressive GNNs are often marginal or inconsistent. We study this gap by analysing the interaction between node features and graph topology and their effect on pooling objectives. Our analysis reveals that pooling operators require node features that are well-aligned with the graph's topology -- a condition often overlooked and not guaranteed in empirical networks. We formalise fundamental requirements for node features to enable effective pooling, and introduce a quantitative measure of feature quality. Our empirical evaluation shows that, when these requirements are satisfied, pooling can be beneficial and improve performance on appropriate datasets.

Explore similar work

Geometric Flow enhanced Graph Coarsening
Sep 14, 2026Chaoqun Fei, Guoxuan Li, Tinglve Zhou +2Graph Neural Networks Riemannian Manifolds
Gaussian Sheaf Neural Networks
May 20, 2026André Ribeiro, Ana Luiza Tenório, Tiago da Silva +1Graph Neural Networks Graph Representation Learning
Closed-Form Node Classification with Exact Graph Unlearning
May 25, 2026Aditya Gaur, Charu SharmaGraph Neural Networks Propagation

Sep 14, 2026 · cs.AIJ/K move · Enter open · S save

Geometric Flow enhanced Graph Coarsening

Chaoqun Fei, Guoxuan Li, Tinglve Zhou, Chuanqing Wang+1

Recently, researchers have proposed a graph pooling operation, akin to the pooling process in conventional convolutional neural networks (CNN), aimed at reducing the computation cost of Graph convolutional neural networks (GCNNs). While most GCNN-based methods treat graph pooling as a node clustering problem and propose learning a cluster assignment matrix, existing clustering-based pooling methods tend to focus solely on the rough topology information of graphs, neglecting the exploitation of higher-order mutual connections among neighbors. In terms of message passing on graph, the ease of information passing on edges reflects the closeness between neighboring nodes, which significantly relies on the interconnectivity among neighbors. In this study, we address this gap by considering such local connection information and introducing a novel graph pooling method named RicciPool. We introduce discrete graph curvature, particularly Ollivier-Ricci curvature, as a measure of higher-order connectivity around an edge. Subsequently, we construct an Ollivier-Ricci flow formula to reweigh edge weights, leveraging the crucial information provided by Ricci curvature, particularly vital for extracting clusters in graphs. Building upon this foundation, we utilize the spectral clustering technique to learn a new cluster assignment matrix. Experimental results on multiple bioinformatics protein datasets and social networks underscore the effectiveness of our proposed method.

Graph Neural Networks Riemannian Manifolds Curvature

Open paper Ask about it PDF

Abstract

Explore similar work

Geometric Flow enhanced Graph Coarsening

Gaussian Sheaf Neural Networks

Closed-Form Node Classification with Exact Graph Unlearning