Neural Relational Inference with Efficient Message Passing Mechanisms

被引:0
|
作者
Chen, Siyuan [1 ]
Wang, Jiahai [1 ]
Li, Guoqing [1 ]
机构
[1] Sun Yat Sen Univ, Sch Comp Sci & Engn, Guangzhou, Peoples R China
来源
THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE | 2021年 / 35卷
基金
国家重点研发计划; 中国国家自然科学基金;
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Many complex processes can be viewed as dynamical systems of interacting agents. In many cases, only the state sequences of individual agents are observed, while the interacting relations and the dynamical rules are unknown. The neural relational inference (NRI) model adopts graph neural networks that pass messages over a latent graph to jointly learn the relations and the dynamics based on the observed data. However, NRI infers the relations independently and suffers from error accumulation in multi-step prediction at dynamics learning procedure. Besides, relation reconstruction without prior knowledge becomes more difficult in more complex systems. This paper introduces efficient message passing mechanisms to the graph neural networks with structural prior knowledge to address these problems. A relation interaction mechanism is proposed to capture the coexistence of all relations, and a spatio-temporal message passing mechanism is proposed to use historical information to alleviate error accumulation. Additionally, the structural prior knowledge, symmetry as a special case, is introduced for better relation prediction in more complex systems. The experimental results on simulated physics systems show that the proposed method outperforms existing state-of-the-art methods.
引用
收藏
页码:7055 / 7063
页数:9
相关论文
共 50 条
  • [41] Message Passing-based Inference in Switching Autoregressive Models
    Podusenko, Albert
    van Erp, Ban
    Bagaev, Dmitry
    Senoz, Ismail
    de Vries, Bert
    2022 30TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO 2022), 2022, : 1497 - 1501
  • [42] Extended Variational Message Passing for Automated Approximate Bayesian Inference
    Akbayrak, Semih
    Bocharov, Ivan
    de Vries, Bert
    ENTROPY, 2021, 23 (07)
  • [43] Efficient message passing for cascade size distributions
    Rebekka Burkholz
    Scientific Reports, 9
  • [44] Efficient message passing for cascade size distributions
    Burkholz, Rebekka
    SCIENTIFIC REPORTS, 2019, 9 (1)
  • [45] Accelerated Message Passing for Entropy-Regularized MAP Inference
    Lee, Jonathan N.
    Pacchiano, Aldo
    Bartlett, Peter
    Jordan, Michael, I
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 119, 2020, 119
  • [46] An efficient and reliable message passing by mobile agent
    Jung, IY
    Yeom, HY
    15TH INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING, PROCEEDINGS, 2001, : 900 - 905
  • [47] Efficient Sequential Clamping for Lifted Message Passing
    Hadiji, Fabian
    Ahmadi, Babak
    Kersting, Kristian
    KI 2011: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2011, 7006 : 122 - 133
  • [48] Relational message passing with mutual information maximization for inductive link prediction
    Liang, Xinyu
    Si, Guannan
    Li, Jianxin
    Tian, Pengxin
    An, Zhaoliang
    Zhou, Fengyu
    JOURNAL OF SUPERCOMPUTING, 2025, 81 (01):
  • [49] FORMAL SPECIFICATION OF BASIC MECHANISMS OF A MESSAGE PASSING KERNEL
    GORSKI, J
    NAPIATEK, HJ
    MICROPROCESSING AND MICROPROGRAMMING, 1987, 21 (1-5): : 213 - 221
  • [50] Transformations for early reply and forward message passing mechanisms
    Olsson, Ronald A.
    Keen, Aaron W.
    Williamson, Todd
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2015, 27 (17): : 4645 - 4658