Pith. sign in

REVIEW 2 cited by

r-GAT: Relational Graph Attention Network for Multi-Relational Graphs

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 2109.05922 v1 pith:YFJG6LV7 submitted 2021-09-13 cs.AI cs.CLcs.LG

classification cs.AIcs.CLcs.LG
keywords graphsattentiongraphmulti-relationalentitynetworkr-gatrelational
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Graph Attention Network (GAT) focuses on modelling simple undirected and single relational graph data only. This limits its ability to deal with more general and complex multi-relational graphs that contain entities with directed links of different labels (e.g., knowledge graphs). Therefore, directly applying GAT on multi-relational graphs leads to sub-optimal solutions. To tackle this issue, we propose r-GAT, a relational graph attention network to learn multi-channel entity representations. Specifically, each channel corresponds to a latent semantic aspect of an entity. This enables us to aggregate neighborhood information for the current aspect using relation features. We further propose a query-aware attention mechanism for subsequent tasks to select useful aspects. Extensive experiments on link prediction and entity classification tasks show that our r-GAT can model multi-relational graphs effectively. Also, we show the interpretability of our approach by case study.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Minos: Systematically Classifying Performance and Power Characteristics of GPU Workloads on HPC Clusters

    cs.DC 2026-04 conditional novelty 6.0 of 10

    Minos groups GPU apps by power-spike histograms and SM/DRAM utilization, transferring frequency-cap behavior to unseen workloads with ~4% power and ~3% performance error while cutting profiling cost ~89%.

  2. Graph Neural Networks in Modern AI-aided Drug Discovery

    q-bio.BM 2025-06 conditional novelty 1.0 of 10

    A comprehensive model-centric review of graph neural network methods and applications in AI-aided drug discovery, from molecular representation to synthesis planning.

Pith tools