Copyright Notice:

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Publications of SPCL

M. Besta, F. Scheidl, L. Gianinazzi, S. Klaiman, J. Müller, T. Hoefler:

 Demystifying Higher-Order Graph Neural Networks

(arXiv:2406.12841. Jun. 2024)

Abstract

Higher-order graph neural networks (HOGNNs) are an important class of GNN models that harness polyadic relations between vertices beyond plain edges. They have been used to eliminate issues such as over-smoothing or over-squashing, to significantly enhance the accuracy of GNN predictions, to improve the expressiveness of GNN architectures, and for numerous other goals. A plethora of HOGNN models have been introduced, and they come with diverse neural architectures, and even with different notions of what the 'higher-order' means. This richness makes it very challenging to appropriately analyze and compare HOGNN models, and to decide in what scenario to use specific ones. To alleviate this, we first design an in-depth taxonomy and a blueprint for HOGNNs. This facilitates designing models that maximize performance. Then, we use our taxonomy to analyze and compare the available HOGNN models. The outcomes of our analysis are synthesized in a set of insights that help to select the most beneficial GNN model in a given scenario, and a comprehensive list of challenges and opportunities for further research into more powerful HOGNNs.

Documents

download article:
access preprint on arxiv:
 

BibTeX

@article{besta2024demystifying,
  author={Maciej Besta and Florian Scheidl and Lukas Gianinazzi and Shachar Klaiman and Jürgen Müller and Torsten Hoefler},
  title={{Demystifying Higher-Order Graph Neural Networks}},
  journal={arXiv:2406.12841},
  year={2024},
  month={06},
  doi={10.48550/arXiv.2406.12841},
}