Curvature-based Pooling within Graph Neural Networks
Over-squashing and over-smoothing are two critical issues, that limit the capabilities of graph neural networks (GNNs). While over-smoothing eliminates the differences between nodes making them indistinguishable, over-squashing refers to the inability of GNNs to propagate information over long distances, as exponentially many node states are squashed into fixed-size representations. Both phenomena share similar causes, as both are largely induced by the graph topology. To mitigate these problems in graph classification tasks, we propose CurvPool, a novel pooling method. CurvPool exploits the notion of curvature of a graph to adaptively identify structures responsible for both over-smoothing and over-squashing. By clustering nodes based on the Balanced Forman curvature, CurvPool constructs a graph with a more suitable structure, allowing deeper models and the combination of distant information. We compare it to other state-of-the-art pooling approaches and establish its competitiveness in terms of classification accuracy, computational complexity, and flexibility. CurvPool outperforms several comparable methods across all considered tasks. The most consistent results are achieved by pooling densely connected clusters using the sum aggregation, as this allows additional information about the size of each pool.
- Published in:
Workshop on Mining and Learning with Graphs at European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases - Type:
Inproceedings - Authors:
Sanders, Cedric; Roth, Andreas; Liebig, Thomas - Year:
2023
Citation information
Sanders, Cedric; Roth, Andreas; Liebig, Thomas: Curvature-based Pooling within Graph Neural Networks, Workshop on Mining and Learning with Graphs at European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2023, https://arxiv.org/abs/2308.16516, Sanders.etal.2023a,
@Inproceedings{Sanders.etal.2023a,
author={Sanders, Cedric; Roth, Andreas; Liebig, Thomas},
title={Curvature-based Pooling within Graph Neural Networks},
booktitle={Workshop on Mining and Learning with Graphs at European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
url={https://arxiv.org/abs/2308.16516},
year={2023},
abstract={Over-squashing and over-smoothing are two critical issues, that limit the capabilities of graph neural networks (GNNs). While over-smoothing eliminates the differences between nodes making them indistinguishable, over-squashing refers to the inability of GNNs to propagate information over long distances, as exponentially many node states are squashed into fixed-size representations. Both...}}