Graph Ordering Attention Networks

Graph Neural Networks (GNNs) have been successfully used in many problems involving graph-structured data, achieving state-of-the-art performance. GNNs typically employ a message-passing scheme, in which every node aggregates information from its neighbors using a permutation-invariant aggregation function. Standard well-examined choices such as the mean or sum aggregation functions have limited capabilities, as they are not able to capture interactions among neighbors. In this work, we formalize these interactions using an information-theoretic framework that notably includes synergistic information. Driven by this definition, we introduce the Graph Ordering Attention (GOAT) layer, a novel GNN component that captures interactions between nodes in a neighborhood. This is achieved by learning local node orderings via an attention mechanism and processing the ordered representations using a recurrent neural network aggregator. This design allows us to make use of a permutation-sensitive aggregator while maintaining the permutation-equivariance of the proposed GOAT layer. The GOAT model demonstrates its increased performance in modeling graph metrics that capture complex information, such as the betweenness centrality and the effective size of a node. In practical use-cases, its superior modeling capability is confirmed through its success in several real-world node classification benchmarks.

Authors

• Michail Chatzianastasis Laboratoire d’Informatique (LIX), École Polytechnique, Institut Polytechnique de Paris, Palaiseau, France
• Johannes Lutzeyer Ecole Polytechnique
• George Dasoulas Ecole Polytechnique Harvard University
• Michalis Vazirgiannis Ecole Polytechnique KTH Royal Institute of Technology

Keywords

• ML: Deep Neural Architectures
• ML: Graph-based Machine Learning