no code implementations • ICLR 2019 • Haggai Maron, Heli Ben-Hamu, Nadav Shamir, Yaron Lipman
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.