Covariant Compositional Networks For Learning Graphs

By Risi Kondor, H. Son, Horace Pan, Brandon M. Anderson, Shubhendu Trivedi. 2018

168 citations recorded by the source corpus.

Most existing neural networks for learning graphs address permutation invariance by conceiving of the network as a message passing scheme, where each node sums the feature vectors coming from its neighbors. We argue that this imposes a limitation on their representation power, and instead propose a new general architecture for representing objects consisting of a hierarchy of parts, which we call Covariant Compositional Networks (CCNs). Here, covariance means that the activation of each neuron must transform in a specific way under permutations, similarly to steerability in CNNs. We achieve covariance by making each activation transform according to a tensor representation of the permutation group, and derive the corresponding tensor aggregation rules that each neuron must implement. Experiments show that CCNs can outperform competing methods on standard graph learning benchmarks.

Subfields: Artificial Intelligence, Model Architectures, Graph Learning

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Yoshua Bengio
  2. Sergey Levine
  3. Ruslan Salakhutdinov
  4. Quoc V. Le
  5. Percy Liang
  6. Mohit Bansal
  7. Jianfeng Gao
  8. Kyunghyun Cho

In Model Architectures

  1. Maurice Weiler
  2. Max Welling
  3. Yoshua Bengio
  4. Erik J. Bekkers
  5. Regina Barzilay
  6. Tommi S. Jaakkola
  7. Risi Kondor
  8. Taco Cohen

In Graph Learning

  1. William L. Hamilton
  2. Jure Leskovec
  3. Stephan Günnemann
  4. Michael M. Bronstein
  5. Tommi S. Jaakkola
  6. Max Welling
  7. Johannes Klicpera
  8. Regina Barzilay

Citations in the corpus