Norm Augmented Graph AutoEncoders for Link Prediction
Yunhui Liu, Huaisong Zhang, Xinyi Gao, Liuye Guo, Zhen Tao, Tieke He

TL;DR
This paper identifies degree-related bias in Graph AutoEncoders for link prediction and proposes a norm augmentation method with self-loops to improve performance on low-degree nodes, showing significant empirical gains.
Contribution
The study reveals the impact of embedding norms on LP performance and introduces a simple, effective norm augmentation technique to mitigate degree bias in GAEs.
Findings
Norm of node embeddings varies with node degree.
Increasing embedding norms improves LP accuracy for low-degree nodes.
Norm-augmented GAEs outperform standard methods across datasets.
Abstract
Link Prediction (LP) is a crucial problem in graph-structured data. Graph Neural Networks (GNNs) have gained prominence in LP, with Graph AutoEncoders (GAEs) being a notable representation. However, our empirical findings reveal that GAEs' LP performance suffers heavily from the long-tailed node degree distribution, i.e., low-degree nodes tend to exhibit inferior LP performance compared to high-degree nodes. \emph{What causes this degree-related bias, and how can it be mitigated?} In this study, we demonstrate that the norm of node embeddings learned by GAEs exhibits variation among nodes with different degrees, underscoring its central significance in influencing the final performance of LP. Specifically, embeddings with larger norms tend to guide the decoder towards predicting higher scores for positive links and lower scores for negative links, thereby contributing to superior…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Semantic Web and Ontologies · Complex Network Analysis Techniques
