Many computer vision and machine learning problems are modelled as learning
tasks on heterogeneous graphs, featuring a wide array of relations from diverse
types of nodes and edges. Heterogeneous graph neural networks (HGNNs) stand out
as a promising neural model class designed for heterogeneous graphs. Built on
traditional GNNs, existing HGNNs employ different parameter spaces to model the
varied relationships. However, the practical effectiveness of existing HGNNs is
often limited to simple heterogeneous graphs with few relation types. This
paper first highlights and demonstrates that the standard approach employed by
existing HGNNs inevitably leads to parameter explosion and relation collapse,
making HGNNs less effective or impractical for complex heterogeneous graphs
with numerous relation types. To overcome this issue, we introduce a novel
framework, Blend&Grind-HGNN (BG-HGNN), which effectively tackles the challenges
by carefully integrating different relations into a unified feature space
manageable by a single set of parameters. This results in a refined HGNN method
that is more efficient and effective in learning from heterogeneous graphs,
especially when the number of relations grows. Our empirical studies illustrate
that BG-HGNN significantly surpasses existing HGNNs in terms of parameter
efficiency (up to 28.96 $\times$), training throughput (up to 8.12 $\times$),
and accuracy (up to 1.07 $\times$).

本文介绍了一种新的框架，Blend&Grind-HGNN（BG-HGNN），该框架有效地解决了现有 HGNN 在处理不同关系类型复杂异构图时所面临的问题，其通过将不同关系融合到一个统一的特征空间中，在参数可管理的单一参数集的帮助下，得到了一个更高效、更有效地从异构图中学习的 HGNN 方法。实证研究表明，BG-HGNN 在参数效率（高达 28.96 倍）、训练吞吐量（高达 8.12 倍）和准确性（高达 1.07 倍）方面显著超过了现有的 HGNN。

BG-HGNN: 面向可扩展和高效的异构图神经网络

BG-HGNN: Toward Scalable and Efficient Heterogeneous Graph Neural  Network

Previous works on knowledge-to-text generation take as input a few RDF
triples or key-value pairs conveying the knowledge of some entities to generate
a natural language description. Existing datasets, such as WIKIBIO, WebNLG, and
E2E, basically have a good alignment between an input triple/pair set and its
output text. However, in practice, the input knowledge could be more than
enough, since the output description may only cover the most significant
knowledge. In this paper, we introduce a large-scale and challenging dataset to
facilitate the study of such a practical scenario in KG-to-text. Our dataset
involves retrieving abundant knowledge of various types of main entities from a
large knowledge graph (KG), which makes the current graph-to-sequence models
severely suffer from the problems of information loss and parameter explosion
while generating the descriptions. We address these challenges by proposing a
multi-graph structure that is able to represent the original graph information
more comprehensively. Furthermore, we also incorporate aggregation methods that
learn to extract the rich graph information. Extensive experiments demonstrate
the effectiveness of our model architecture.

本文介绍了一个大规模、有挑战性的数据集，以促进知识图谱到文本分类的实际场景研究，同时提出了一种多图结构和聚合方法，以更全面地代表原始图信息，并成功解决信息丢失和参数爆炸的问题。