arXiv Machine Learning By Clara Alvarez-Rodriguez, Steve Azzolin, Vincenzo Marco De Luca, Filippo Maria Bianchi, Andrea Passerini, Antonio Longa

Graph Additive Models disentangling feature, topology, and interactions

Read the original on arXiv Machine Learning →

Graph Additive Models (AMIGA) address three key limitations of Graph Neural Additive Networks (GNANs): they prevent irrelevant nodes from inheriting spurious relevance, represent topology via mined motifs instead of only shortest‑path distances, and separate feature, structure, and interaction effects into distinct additive channels. AMIGA’s decomposition is centered around a graph‑balanced training baseline, ensuring a unique and well‑defined representation for each node. Across ten graph classification and regression benchmarks, AMIGA outperforms GNAN on most datasets and narrows the performance gap with standard black‑box GNNs, while providing node‑local explanations that exactly reconstruct the model output.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Aug 27

DeltaGNN: Graph Neural Network with Information Flow Control

DeltaGNN introduces an information flow control mechanism that uses a new connectivity measure, the information flow score, to mitigate over‑smoothing and over‑squashing in Graph Neural Networks. This approach enables linear computational and memory overhead while effectively capturing both short‑range and long‑range node interactions. Experiments on ten diverse real‑world datasets demonstrate superior performance with limited computational complexity.

By Kevin Mancini, Islem Rekik