Recurrent Graph Neural Networks and Arithmetic Circuits
Timon Barlag, Vivian Holzapfel, Laura Strieker, Jonni Virtema, Heribert Vollmer

TL;DR
This paper establishes a precise equivalence between the computational power of recurrent graph neural networks and recurrent arithmetic circuits over real numbers, linking neural network expressivity with circuit complexity theory.
Contribution
It introduces recurrent arithmetic circuits as a new model and proves their computational equivalence with recurrent GNNs, expanding understanding of neural network capabilities.
Findings
Recurrent GNNs can simulate recurrent arithmetic circuits.
Recurrent arithmetic circuits encode labelled graphs as real-valued tuples.
The paper deepens the theoretical understanding of neural network expressivity.
Abstract
We characterise the computational power of recurrent graph neural networks (GNNs) in terms of arithmetic circuits over the real numbers. Our networks are not restricted to aggregate-combine GNNs or other particular types. Generalising similar notions from the literature, we introduce the model of recurrent arithmetic circuits, which can be seen as arithmetic analogues of sequential or logical circuits. These circuits utilise so-called memory gates which are used to store data between iterations of the recurrent circuit. While (recurrent) GNNs work on labelled graphs, we construct arithmetic circuits that obtain encoded labelled graphs as real valued tuples and then compute the same function. For the other direction we construct recurrent GNNs which are able to simulate the computations of recurrent circuits. These GNNs are given the circuit-input as initial feature vectors and then,…
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.
