Improving Graph Neural Networks with Heterophily-based Filtration and Filtration Learning
topological machine learning;graph neural networks;heterophily;homophily;filtration;hierarchical graph learning;filtration learning
I have read and agree with the venue's withdrawal policy on behalf of myself and my co-authors.
Two novel topological machine learning approaches using heterophily based topological filtration and filtration learning for multi-scale gnns
@misc{
leventhal2024improving,
title={Improving Graph Neural Networks with Heterophily-based Filtration and Filtration Learning},
author={Samuel Leventhal and Valerio Pascucci and Mark Heimann},
year={2024},
url={https://openreview.net/forum?id=FzFnG7zW22}
}
Graph neural networks (GNNs) are a powerful method of learning representations of graph-structured data. While they excel at learning class-discriminative representations of nodes in homophilous graphs, where connecting nodes tend to belong to the same class, many GNNs struggle with heterophilous graphs whose inter-class connections can muddy the message passing.  Inspired by this finding, we propose a topological filtration scheme, treating graphs as 1-dimensional simplicial complexes N  with a filter function based on estimated edge heterophily, and introduce two methodologies that use a backbone GNN to learn from the resulting graph filtration. The first trains a GNN on each graph in the filtration sequence consecutively for a portion of the total training time, using embeddings from previous graphs to initialize node embeddings in subsequent graphs. The second approach uses a novel message passing scheme to pass messages jointly within each and between graph levels in the filtration sequence with common nodes. Both methods enhance the influence of early birth adjacent nodes in homophilous subgraphs, yet allow for the model to learn from the full range of heterophilous and homophilous connections in the graph. We further extend our approach to learn a graph filtration sequence of graphs through a learnable node filter function. Experiments show that our heterophily-filtered GNNs achieve superior node classification accuracy on heterophilous and homophilous networks alike.
I certify that there is no URL (e.g., github page) that could be used to find authors’ identity.
~Samuel_Leventhal1 ~Valerio_Pascucci2 ~Mark_Heimann1
Samuel Leventhal Valerio Pascucci Mark Heimann
I acknowledge that I and all co-authors of this work have read and commit to adhering to the ICLR Code of Ethics.
topological machine learning graph neural networks heterophily homophily filtration hierarchical graph learning filtration learning
I certify that there is no acknowledgement section in this submission for double blind review.
leventhal|improving_graph_neural_networks_with_heterophilybased_filtration_and_filtration_learning
/pdf/0936728a1280322ed091273969165d6022740009.pdf
unsupervised, self-supervised, semi-supervised, and supervised representation learning
I understand the reciprocal reviewing requirement as described on https://iclr.cc/Conferences/2025/CallForPapers. If none of the authors are registered as a reviewer, it may result in a desk rejection at the discretion of the program chairs. To request an exception, please complete this form at https://forms.gle/Huojr6VjkFxiQsUp6.
No
I certify that this submission complies with the submission instructions as described on https://iclr.cc/Conferences/2025/AuthorGuide.
Improving Graph Neural Networks with Heterophily-based Filtration and Filtration Learning
ICLR 2025 Conference Withdrawn Submission
ICLR.cc/2025/Conference/Withdrawn_Submission