Boosting Graph Pooling with Persistent Homology
Not on the map. Why?
Abstract (arXiv)
Recently, there has been an emerging trend to integrate persistent homology (PH) into graph neural networks (GNNs) to enrich expressive power. However, naively plugging PH features into GNN layers always results in marginal improvement with low interpretability. In this paper, we investigate a novel mechanism for injecting global topological invariance into pooling layers using PH, motivated by the observation that filtration operation in PH naturally aligns graph pooling in a cut-off manner. In this fashion, message passing in the coarsened graph acts along persistent pooled topology, leading to improved performance. Experimentally, we apply our mechanism to a collection of graph pooling methods and observe consistent and substantial performance gain over several popular datasets, demonstrating its wide applicability and flexibility.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 36 of its 53 references that are in the map. First posted on arXiv 26 Feb 2024.
Builds on
36 of 53 references.
References · 36
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2018Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networkscited by 878
- 2018Hierarchical Graph Representation Learning with Differentiable Poolingcited by 786
- 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 718
- 2019Graph U-Netscited by 489
- 2019Self-Attention Graph Poolingcited by 421
24 more
- 2020Improving Graph Neural Network Expressivity via Subgraph Isomorphism Countingcited by 312
- 2021Identity-aware Graph Neural Networkscited by 197
- 2020Graph Clustering with Graph Neural Networkscited by 163
- 2019ASAP: Adaptive Structure Aware Pooling for Learning Hierarchical Graph Representationscited by 156
- 2019PersLay: A Neural Network Layer for Persistence Diagrams and New Graph Topological Signaturescited by 125
- 2019Topological Autoencoderscited by 124
- 2017Deep Learning with Topological Signaturescited by 113
- 2018Attentive Statistics Pooling for Deep Speaker Embeddingcited by 108
- 2018Towards Sparse Hierarchical Graph Classifierscited by 100
- 2019Graph Convolutional Networks with EigenPoolingcited by 94
- 2021Topological Graph Neural Networkscited by 86
- 2020Rethinking pooling in graph neural networkscited by 73
- 2021Understanding Pooling in Graph Neural Networkscited by 69
- 2019Graph Filtration Learningcited by 68
- 2022Structural Entropy Guided Graph Hierarchical Poolingcited by 62
- 2022Boosting the Cycle Counting Power of Graph Neural Networks with I2-GNNscited by 55
- 2019Connectivity-Optimized Representation Learning via Persistent Homologycited by 43
- 2023The expressive power of pooling in Graph Neural Networkscited by 35
- 2023Curvature Filtrations for Graph Generative Model Evaluationcited by 18
- 2023On the Expressivity of Persistent Homology in Graph Learningcited by 18
- 2022Neural Approximation of Graph Topological Featurescited by 16
- 2019A Non-Negative Factorization approach to node pooling in Graph Convolutional Neural Networkscited by 14
- 2020PersGNN: Applying Topological Data Analysis and Geometric Deep Learning to Structure-Based Protein Function Predictioncited by 7
- 2023DeSCo: Towards Generalizable and Scalable Deep Subgraph Countingcited by 4
Built on by
Citing papers per year: 2024: 2; 2025: 4; 2026: 3.
9 papers.
- 2025Geometry-Aware Edge Pooling for Graph Neural Networkscited by 5
- 2025Persistent Homology-induced Graph Ensembles for Time Series Regressionscited by 3
- 2025Neural Graduated Assignment for Maximum Common Edge Subgraphscited by 3
- 2024PHLP: Sole Persistent Homology for Link Prediction - Interpretable Feature Extractioncited by 2
- 2024ReMAP: Neural Reparameterization for Scalable MAP Inference in Arbitrary-Order Markov Random Fieldscited by 0
- 2025UM3: Unsupervised Map to Map Matchingcited by 0
- 2026Contraction and Hourglass Persistence for Learning on Graphs, Simplices, and Cellscited by 0
- 2026AbstainGNN: Teaching Graph Neural Networks to Abstain for Graph Classificationcited by 0
- 2026Global to Local: Topology-Preserving Adaptive Graph Pooling via Granular-Ballcited by 0
- 2026Global to Local: Topology-Preserving Adaptive Graph Pooling via Granular-Ball4 Sep 2026
- 2026AbstainGNN: Teaching Graph Neural Networks to Abstain for Graph Classification29 May 2026
- 2026Contraction and Hourglass Persistence for Learning on Graphs, Simplices, and Cells19 Apr 2026
- 2025UM3: Unsupervised Map to Map Matching23 Aug 2025
- 2025Geometry-Aware Edge Pooling for Graph Neural Networks13 Jun 2025
- 2025Neural Graduated Assignment for Maximum Common Edge Subgraphs18 May 2025
- 2025Persistent Homology-induced Graph Ensembles for Time Series Regressions18 Mar 2025
- 2024ReMAP: Neural Reparameterization for Scalable MAP Inference in Arbitrary-Order Markov Random Fields28 Nov 2024
- 2024PHLP: Sole Persistent Homology for Link Prediction - Interpretable Feature Extraction23 Apr 2024