Inferring the interaction rules of complex systems with graph neural networks and approximate Bayesian computation

J R Soc Interface. 2023 Jan;20(198):20220676. doi: 10.1098/rsif.2022.0676. Epub 2023 Jan 4.

Abstract

Inferring the underlying processes that drive collective behaviour in biological and social systems is a significant statistical and computational challenge. While simulation models have been successful in qualitatively capturing many of the phenomena observed in these systems in a variety of domains, formally fitting these models to data remains intractable. Recently, approximate Bayesian computation (ABC) has been shown to be an effective approach to inference if the likelihood function for a model is unavailable. However, a key difficulty in successfully implementing ABC lies with the design, selection and weighting of appropriate summary statistics, a challenge that is especially acute when modelling high dimensional complex systems. In this work, we combine a Gaussian process accelerated ABC method with the automatic learning of summary statistics via graph neural networks. Our approach bypasses the need to design a model-specific set of summary statistics for inference. Instead, we encode relational inductive biases into a neural network using a graph embedding and then extract summary statistics automatically from simulation data. To evaluate our framework, we use a model of collective animal movement as a test bed and compare our method to a standard summary statistics approach and a linear regression-based algorithm.

Keywords: Bayesian inference; Gaussian processes; collective movement; emergent properties; machine learning.

Publication types

  • Research Support, Non-U.S. Gov't

MeSH terms

  • Algorithms*
  • Bayes Theorem
  • Computer Simulation
  • Linear Models
  • Neural Networks, Computer*

Associated data

  • figshare/10.6084/m9.figshare.c.6363753