.png){kind=icon}
返回
Multi-relational graph convolutional networks: Generalization guarantees and experiments
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2023.01.044.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The class of multi-relational graph convolutional networks (MRGCNs) is a recent extension of stan-dard graph convolutional networks (GCNs) to handle heterogenous graphs with multiple types of relationships. MRGCNs have been shown to yield results superior than traditional GCNs in various machine learning tasks. The key idea is to introduce a new kind of convolution operated on tensors that can effectively exploit correlations exhibited in multiple relationships. The main objective of this paper is to analyze the algorithmic stability and generalization guarantees of MRGCNs to confirm the usefulness of MRGCNs. Our contributions are of three folds. First, we develop a matrix representation of various tensor operations underneath MRGCNs to simplify the analysis significantly. Next, we prove the uniform stability of MRGCNs and deduce the convergence of the generalization gap to support the usefulness of MRGCNs. The analysis sheds lights on the design of MRGCNs, for instance, how the data should be scaled to achieve the uniform stability of the learning process. Finally, we provide experimental results to demonstrate the stability results. (c) 2023 Elsevier Ltd. All rights reserved.
Keyword:
Multi -relational data
Graph convolutional networks
Algorithmic stability
Generalization guarantees
期刊
IF:
6.3
论文数:
8.2K
被引数:
3.0W
机构
引用论文
.png){kind=icon}
Removal and recovery of mercury from chlor-alkali petrochemical wastes using γ-Fe2O3 nanoparticles使用 γ-Fe2O3纳米颗粒从氯碱石化废物中去除和回收汞
OAAI
OAAI分享收藏 没有更多内容
没有更多内容