The Role of Node Features in Graph Pooling

• URL: http://arxiv.org/abs/2605.06250v1
• Date: Thu, 07 May 2026 13:27:48 GMT
• Title: The Role of Node Features in Graph Pooling
• Abstract summary: Graph pooling is commonly applied in graph classification, but its empirical gains are often marginal or inconsistent.<n>Our analysis reveals that pooling operators require node features that are well-aligned with the graph's topology.<n>Our empirical evaluation shows that, when these requirements are satisfied, pooling can be beneficial and improve performance on appropriate datasets.
• Score: 4.450668516995356
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Geometry-Aware Edge Pooling for Graph Neural Networks [23.216349399814643]
  Graph Neural Networks (GNNs) have shown significant success for graph-based tasks.<n>Motivated by the prevalence of large datasets in real-world applications, pooling layers are crucial components of GNNs.<n>We propose novel graph pooling layers for structure-aware pooling via edge collapses.
  arXiv  Detail & Related papers  (2025-06-13T12:01:46Z)
• Graph Attention for Heterogeneous Graphs with Positional Encoding [0.0]
  Graph Neural Networks (GNNs) have emerged as the de facto standard for modeling graph data.<n>This work benchmarks various GNN architectures to identify the most effective methods for heterogeneous graphs.<n>Our findings reveal that graph attention networks excel in these tasks.
  arXiv  Detail & Related papers  (2025-04-03T18:00:02Z)
• Revisiting Graph Neural Networks on Graph-level Tasks: Comprehensive Experiments, Analysis, and Improvements [54.006506479865344]
  We propose a unified evaluation framework for graph-level Graph Neural Networks (GNNs)<n>This framework provides a standardized setting to evaluate GNNs across diverse datasets.<n>We also propose a novel GNN model with enhanced expressivity and generalization capabilities.
  arXiv  Detail & Related papers  (2025-01-01T08:48:53Z)
• DEGREE: Decomposition Based Explanation For Graph Neural Networks [55.38873296761104]
  We propose DEGREE to provide a faithful explanation for GNN predictions. By decomposing the information generation and aggregation mechanism of GNNs, DEGREE allows tracking the contributions of specific components of the input graph to the final prediction. We also design a subgraph level interpretation algorithm to reveal complex interactions between graph nodes that are overlooked by previous methods.
  arXiv  Detail & Related papers  (2023-05-22T10:29:52Z)
• The expressive power of pooling in Graph Neural Networks [6.5268245109828005]
  We study how graph pooling affects the expressiveness of a Graph Neural Networks (GNNs) We derive sufficient conditions for a pooling operator to fully preserve the expressive power of the MP layers before it. We introduce an experimental setup to verify empirically the expressive power of a GNN equipped with pooling layers.
  arXiv  Detail & Related papers  (2023-04-04T07:03:08Z)
• When Do We Need Graph Neural Networks for Node Classification? [38.68793097833027]
  Graph Neural Networks (GNNs) extend basic Neural Networks (NNs) In some cases, GNNs have little performance gain or even underperform graph-agnostic NNs.
  arXiv  Detail & Related papers  (2022-10-30T23:10:23Z)
• Higher-order Clustering and Pooling for Graph Neural Networks [77.47617360812023]
  Graph Neural Networks achieve state-of-the-art performance on a plethora of graph classification tasks. HoscPool is a clustering-based graph pooling operator that captures higher-order information hierarchically. We evaluate HoscPool on graph classification tasks and its clustering component on graphs with ground-truth community structure.
  arXiv  Detail & Related papers  (2022-09-02T09:17:10Z)
• Explicit Pairwise Factorized Graph Neural Network for Semi-Supervised Node Classification [59.06717774425588]
  We propose the Explicit Pairwise Factorized Graph Neural Network (EPFGNN), which models the whole graph as a partially observed Markov Random Field. It contains explicit pairwise factors to model output-output relations and uses a GNN backbone to model input-output relations. We conduct experiments on various datasets, which shows that our model can effectively improve the performance for semi-supervised node classification on graphs.
  arXiv  Detail & Related papers  (2021-07-27T19:47:53Z)
• Node Similarity Preserving Graph Convolutional Networks [51.520749924844054]
  Graph Neural Networks (GNNs) explore the graph structure and node features by aggregating and transforming information within node neighborhoods. We propose SimP-GCN that can effectively and efficiently preserve node similarity while exploiting graph structure. We validate the effectiveness of SimP-GCN on seven benchmark datasets including three assortative and four disassorative graphs.
  arXiv  Detail & Related papers  (2020-11-19T04:18:01Z)
• Learning to Drop: Robust Graph Neural Network via Topological Denoising [50.81722989898142]
  We propose PTDNet, a parameterized topological denoising network, to improve the robustness and generalization performance of Graph Neural Networks (GNNs) PTDNet prunes task-irrelevant edges by penalizing the number of edges in the sparsified graph with parameterized networks. We show that PTDNet can improve the performance of GNNs significantly and the performance gain becomes larger for more noisy datasets.
  arXiv  Detail & Related papers  (2020-11-13T18:53:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.