paper-with-me

Papers

FoSR: First-order spectral rewiring for addressing oversquashing in GNNs

2022-10-21 · Kedar Karhadkar, Pradeep Kr. Banerjee, Guido Montúfar

Graph neural networks (GNNs) are able to leverage the structure of graph data by passing messages along the edges of the graph. While this allows GNNs to learn features depending on the graph structure, for certain graph topologies it leads to inefficient information propagation and a problem known as oversquashing. This has recently been linked with the curvature and spectral gap of the graph. On the other hand, adding edges to the message-passing graph can lead to increasingly similar node representations and a problem known as oversmoothing. We propose a computationally efficient algorithm that prevents oversquashing by systematically adding edges to the graph based on spectral expansion. We combine this with a relational architecture, which lets the GNN preserve the original graph structure and provably prevents oversmoothing. We find experimentally that our algorithm outperforms existing graph rewiring methods in several graph classification tasks.

📄 PDF Abstract BibTeX arXiv:2210.11790

Code (2)

kedar2/FoSR 공식 구현 pytorch
harel147/REFine pytorch

Tasks

Graph Classification

Similar Papers 제목 키워드 기반

GNNs Getting ComFy: Community and Feature Similarity Guided Rewiring

2025-02-07 · Celia Rubio-Madrigal, Adarsh Jamadandi, Rebekka Burkholz

Maximizing the spectral gap through graph rewiring has been proposed to enhance the performance of message-passing graph neural networks (GNNs) by addressing over-squashing. However, as we show, minimizing the spectral g…

Node Classification

PANDA: Expanded Width-Aware Message Passing Beyond Rewiring

2024-06-06 · Jeongwhan Choi, Sumin Park, Hyowon Wi, Sung-Bae Cho 외

Recent research in the field of graph neural network (GNN) has identified a critical issue known as "over-squashing," resulting from the bottleneck phenomenon in graph structures, which impedes the propagation of long-ra…

Graph ClassificationGraph Neural NetworkGraph RegressionNode Classification

Locality-Aware Graph-Rewiring in GNNs

2023-10-02 · Federico Barbero, Ameya Velingker, Amin Saberi, Michael Bronstein 외

Graph Neural Networks (GNNs) are popular models for machine learning on graphs that typically follow the message-passing paradigm, whereby the feature of a node is updated recursively upon aggregating information over it…

Inductive Bias

On higher order computations, rewiring the connectome, and non-von Neumann computer architecture

2016-03-07 · Stanislaw Ambroszkiewicz

Structural plasticity in the brain (i.e. rewiring the connectome) may be viewed as mechanisms for dynamic reconfiguration of neural circuits. First order computations in the brain are done by static neural circuits, wher…

Leave Graphs Alone: Addressing Over-Squashing without Rewiring

2022-12-13 · Domenico Tortorella, Alessio Micheli

Recent works have investigated the role of graph bottlenecks in preventing long-range information propagation in message-passing graph neural networks, causing the so-called `over-squashing' phenomenon. As a remedy, grap…

Node Classification