arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.07684cs.LGstat.ML
收藏

图神经网络中信息传播的拉格朗日方法

A Lagrangian Approach to Information Propagation in Graph Neural Networks

University of Siena(锡耶纳大学);University of Florence(佛罗伦萨大学)

Matteo Tiezzi, Giuseppe Marra, Stefano Melacci, Marco Maggini, Marco Gori

摘要:

在许多现实世界的应用程序中,数据的特征是复杂的结构,可以自然地编码为图。在过去的几年里,深度学习技术的流行重新引起了人们对能够处理复杂模式的神经模型的兴趣。特别地,受图神经网络(GNN)模型的启发,已经提出了不同的架构来扩展原始GNN方案。GNN利用一组状态变量,每个变量分配给一个图节点,以及相邻节点之间的状态扩散机制,来实现迭代过程以计算(可学习的)状态转移函数的不动点。在本文中,我们提出了一种新的方法的状态计算和学习算法的GNNs,基于约束优化任务解决拉格朗日框架。状态收敛过程由约束满足机制隐式地表示,并且不需要针对学习过程的每个时期的单独的迭代阶段。实际上,计算结构是基于在由权重、神经输出(节点状态)和拉格朗日乘子组成的伴随空间中搜索拉格朗日的鞍点。所提出的方法进行了比较实验与其他流行的模型处理图形。

英文摘要:

In many real world applications, data are characterized by a complex structure, that can be naturally encoded as a graph. In the last years, the popularity of deep learning techniques has renewed the interest in neural models able to process complex patterns. In particular, inspired by the Graph Neural Network (GNN) model, different architectures have been proposed to extend the original GNN scheme. GNNs exploit a set of state variables, each assigned to a graph node, and a diffusion mechanism of the states among neighbor nodes, to implement an iterative procedure to compute the fixed point of the (learnable) state transition function. In this paper, we propose a novel approach to the state computation and the learning algorithm for GNNs, based on a constraint optimisation task solved in the Lagrangian framework. The state convergence procedure is implicitly expressed by the constraint satisfaction mechanism and does not require a separate iterative phase for each epoch of the learning procedure. In fact, the computational structure is based on the search for saddle points of the Lagrangian in the adjoint space composed of weights, neural outputs (node states), and Lagrange multipliers. The proposed approach is compared experimentally with other popular models for processing graphs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑