Pith. sign in

REVIEW 1 cited by

Ensemble Multi-Relational Graph Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2205.12076 v1 pith:UEUQXAZG submitted 2022-05-24 cs.LG cs.SI

classification cs.LGcs.SI
keywords gnnsmulti-relationalobjectiveoptimizationensemblegraphwellable
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

It is well established that graph neural networks (GNNs) can be interpreted and designed from the perspective of optimization objective. With this clear optimization objective, the deduced GNNs architecture has sound theoretical foundation, which is able to flexibly remedy the weakness of GNNs. However, this optimization objective is only proved for GNNs with single-relational graph. Can we infer a new type of GNNs for multi-relational graphs by extending this optimization objective, so as to simultaneously solve the issues in previous multi-relational GNNs, e.g., over-parameterization? In this paper, we propose a novel ensemble multi-relational GNNs by designing an ensemble multi-relational (EMR) optimization objective. This EMR optimization objective is able to derive an iterative updating rule, which can be formalized as an ensemble message passing (EnMP) layer with multi-relations. We further analyze the nice properties of EnMP layer, e.g., the relationship with multi-relational personalized PageRank. Finally, a new multi-relational GNNs which well alleviate the over-smoothing and over-parameterization issues are proposed. Extensive experiments conducted on four benchmark datasets well demonstrate the effectiveness of the proposed model.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. HeTa: Relation-wise Heterogeneous Graph Foundation Attack Model

    cs.AI 2025-06 conditional novelty 5.0 of 10

    HeTa learns relational importance weights on a surrogate HGNN, then attacks relations one by one with injected nodes and gradient-selected edges to transfer across target HGNNs.

Pith tools