Invariant and Equivariant Graph Networks
Haggai Maron, Heli Ben-Hamu, Nadav Shamir, Yaron Lipman

TL;DR
This paper characterizes all permutation invariant and equivariant linear layers for graph data, providing bases and dimensions, and demonstrates their effectiveness and generality in graph neural networks.
Contribution
It offers a complete characterization of invariant and equivariant linear layers for graphs, including bases and dimensions, unifying recent advances and enhancing expressivity.
Findings
Dimension of invariant layers is 2 for edge-value graphs.
Dimension of equivariant layers is 15 for edge-value graphs.
Networks using these layers achieve competitive results and improved expressivity.
Abstract
Invariant and equivariant networks have been successfully used for learning images, sets, point clouds, and graphs. A basic challenge in developing such networks is finding the maximal collection of invariant and equivariant linear layers. Although this question is answered for the first three examples (for popular transformations, at-least), a full characterization of invariant and equivariant linear layers for graphs is not known. In this paper we provide a characterization of all permutation invariant and equivariant linear layers for (hyper-)graph data, and show that their dimension, in case of edge-value graph data, is 2 and 15, respectively. More generally, for graph data defined on k-tuples of nodes, the dimension is the k-th and 2k-th Bell numbers. Orthogonal bases for the layers are computed, including generalization to multi-graph data. The constant number of basis elements…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Epigenetics and DNA Methylation · Data Quality and Management
