Mean-field theory of graph neural networks in graph partitioning

By Tatsuro Kawamoto, Masashi Tsubaki, Tomoyuki Obuchi. 2018

61 citations recorded by the source corpus.

A theoretical performance analysis of the graph neural network (GNN) is presented. For classification tasks, the neural network approach has the advantage in terms of flexibility that it can be employed in a data-driven manner, whereas Bayesian inference requires the assumption of a specific model. A fundamental question is then whether GNN has a high accuracy in addition to this flexibility. Moreover, whether the achieved performance is predominately a result of the backpropagation or the architecture itself is a matter of considerable interest. To gain a better insight into these questions, a mean-field theory of a minimal GNN architecture is developed for the graph partitioning problem. This demonstrates a good agreement with numerical experiments.

Subfields: Artificial Intelligence, Statistical and Nonlinear Physics

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. Zhiyuan Liu
  2. Maosong Sun
  3. Stephan Günnemann
  4. Aleksandar Bojchevski
  5. Jie Zhou
  6. Johannes Klicpera
  7. Zhengyan Zhang
  8. Cheng Yang

In Statistical and Nonlinear Physics

  1. Stephan Günnemann
  2. Johannes Klicpera
  3. Aleksandar Bojchevski
  4. Zhiyuan Liu
  5. Hoang NT
  6. Maosong Sun
  7. Takanori Maehara
  8. Cheng Yang

Citations in the corpus