Gumbel-MPNN: Graph Rewiring with Gumbel-Softmax

Marcel Hoffmann, Lukas Galke, Ansgar Scherp
8/24/2025
cs.LG

No confident code implementation found for this paper.

Abstract

Graph homophily has been considered an essential property for message-passing neural networks (MPNN) in node classification. Recent findings suggest that performance is more closely tied to the consistency of neighborhood class distributions. We demonstrate that the MPNN performance depends on the number of components of the overall neighborhood distribution within a class. By breaking down the classes into their neighborhood distribution components, we increase measures of neighborhood distribution informativeness but do not observe an improvement in MPNN performance. We propose a Gumbel-Softmax-based rewiring method that reduces deviations in neighborhood distributions. Our results show that our new method enhances neighborhood informativeness, handles long-range dependencies, mitigates oversquashing, and increases the classification performance of the MPNN. The code is available at https://github.com/Bobowner/Gumbel-Softmax-MPNN.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{hoffmann2025gumbelmpnn,
  title  = {Gumbel-MPNN: Graph Rewiring with Gumbel-Softmax},
  author = {Marcel Hoffmann and Lukas Galke and Ansgar Scherp},
  year   = {2025},
  eprint = {2508.17531},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.17531v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2508.17531.svg)](https://codeofpaper.com/paper/2508.17531)

Discussion