Beyond Homophily with Graph Echo State Networks
arXiv:2210.15731 · doi:10.14428/esann/2022.ES2022-58
Abstract
Graph Echo State Networks (GESN) have already demonstrated their efficacy and efficiency in graph classification tasks. However, semi-supervised node classification brought out the problem of over-smoothing in end-to-end trained deep models, which causes a bias towards high homophily graphs. We evaluate for the first time GESN on node classification tasks with different degrees of homophily, analyzing also the impact of the reservoir radius. Our experiments show that reservoir models are able to achieve better or comparable accuracy with respect to fully trained deep models that implement ad hoc variations in the architectural bias, with a gain in terms of efficiency.
arXiv commentAccepted for oral presentation at ESANN 2022
References in corpus (8)
- Semi-Supervised Classification with Graph Convolutional Networks
- Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering
- Representation Learning on Graphs with Jumping Knowledge Networks
- Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learning
- A Gentle Introduction to Deep Learning for Graphs
- Diffusion Improves Graph Learning
- Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs
- Understanding over-squashing and bottlenecks on graphs via curvature