Skip to yearly menu bar Skip to main content


Graph Element Networks: adaptive, structured computation and memory

Ferran Alet · Adarsh Keshav Jeewajee · Maria Bauza Villalonga · Alberto Rodriguez · Tomas Lozano-Perez · Leslie Kaelbling

Pacific Ballroom #16

Keywords: [ Transfer and Multitask Learning ] [ Other Applications ] [ Networks and Relational Learning ] [ Architectures ] [ Algorithms ]


We explore the use of graph neural networks (GNNs) to model spatial processes in which there is no a priori graphical structure. Similar to finite element analysis, we assign nodes of a GNN to spatial locations and use a computational process defined on the graph to model the relationship between an initial function defined over a space and a resulting function in the same space. We use GNNs as a computational substrate, and show that the locations of the nodes in space as well as their connectivity can be optimized to focus on the most complex parts of the space. Moreover, this representational strategy allows the learned input-output relationship to generalize over the size of the underlying space and run the same model at different levels of precision, trading computation for accuracy. We demonstrate this method on a traditional PDE problem, a physical prediction problem from robotics, and learning to predict scene images from novel viewpoints.

Live content is unavailable. Log in and register to view live content