Graph Neural Networks (Scarselli et al., 2009) exploit an iterative diffusion procedure to compute the node states as the fixed point of the trainable state transition function. In this paper, we show how to cast this scheme as a constrained optimization problem, thus avoiding the unfolding procedure required for the computation of the fixed point. This is done by searching for saddle points of the Lagrangian function in the space of the weights, state variables and Lagrange multipliers. The proposed approach shows state-of-the-art performance in multiple standard benchmarks in graph domains.
Recommended citation: Matteo Tiezzi, Giuseppe Marra, Stefano Melacci and Marco Maggini (2020). “Deep Lagrangian Propagation in Graph Neural Networks” ICML20 - GRL+ Workshop.