GRANOLA: Adaptive Normalization for Graph Neural Networks

Despite the widespread adoption of Graph Neural Networks (GNNs), these models often incorporate off-the-shelf normalization layers like BatchNorm or InstanceNorm, which were not originally designed for GNNs. Consequently, these normalization layers may not effectively capture the unique characteristics of graph-structured data, potentially even weakening the expressive power of the overall architecture. While existing graph-specific normalization layers have been proposed, they 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 nodes, obtained by leveraging Random Node Features (RNF) in the graph. We provide theoretical results that support our design choices as well as an extensive empirical evaluation demonstrating the superior performance of Granola\ over existing normalization techniques. Furthermore, Granola\ emerges as the top-performing method among all baselines in the same time complexity class of Message Passing Neural Networks (MPNNs).