GRANOLA: Adaptive Normalization for Graph Neural Networks

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Eliasof, Moshe, Bevilacqua, Beatrice, Schönlieb, Carola-Bibiane, Maron, Haggai
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866910679626153984
author Eliasof, Moshe
Bevilacqua, Beatrice
Schönlieb, Carola-Bibiane
Maron, Haggai
author_facet Eliasof, Moshe
Bevilacqua, Beatrice
Schönlieb, Carola-Bibiane
Maron, Haggai
contents In recent years, significant efforts have been made to refine the design of Graph Neural Network (GNN) layers, aiming to overcome diverse challenges, such as limited expressive power and oversmoothing. Despite their widespread adoption, the incorporation of off-the-shelf normalization layers like BatchNorm or InstanceNorm within a GNN architecture may not effectively capture the unique characteristics of graph-structured data, potentially reducing the expressive power of the overall architecture. Moreover, existing graph-specific normalization layers often struggle to offer substantial and consistent benefits. In this paper, we propose GRANOLA, a novel graph-adaptive normalization layer. Unlike existing normalization layers, GRANOLA normalizes node features by adapting to the specific characteristics of the graph, particularly by generating expressive representations of its neighborhood structure, obtained by leveraging the propagation of Random Node Features (RNF) in the graph. We present theoretical results that support our design choices. Our extensive empirical evaluation of various graph benchmarks underscores the superior performance of GRANOLA over existing normalization techniques. Furthermore, GRANOLA emerges as the top-performing method among all baselines within the same time complexity of Message Passing Neural Networks (MPNNs).
format Preprint
id arxiv_https___arxiv_org_abs_2404_13344
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle GRANOLA: Adaptive Normalization for Graph Neural Networks
Eliasof, Moshe
Bevilacqua, Beatrice
Schönlieb, Carola-Bibiane
Maron, Haggai
Machine Learning
Artificial Intelligence
In recent years, significant efforts have been made to refine the design of Graph Neural Network (GNN) layers, aiming to overcome diverse challenges, such as limited expressive power and oversmoothing. Despite their widespread adoption, the incorporation of off-the-shelf normalization layers like BatchNorm or InstanceNorm within a GNN architecture may not effectively capture the unique characteristics of graph-structured data, potentially reducing the expressive power of the overall architecture. Moreover, existing graph-specific normalization layers often struggle to offer substantial and consistent benefits. In this paper, we propose GRANOLA, a novel graph-adaptive normalization layer. Unlike existing normalization layers, GRANOLA normalizes node features by adapting to the specific characteristics of the graph, particularly by generating expressive representations of its neighborhood structure, obtained by leveraging the propagation of Random Node Features (RNF) in the graph. We present theoretical results that support our design choices. Our extensive empirical evaluation of various graph benchmarks underscores the superior performance of GRANOLA over existing normalization techniques. Furthermore, GRANOLA emerges as the top-performing method among all baselines within the same time complexity of Message Passing Neural Networks (MPNNs).
title GRANOLA: Adaptive Normalization for Graph Neural Networks
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2404.13344