Personalized PageRank Graph Attention Networks release_xyccmktkobf4rdvtipxpsbog6m

by Julie Choi

Released as a article .

2022  

Abstract

There has been a rising interest in graph neural networks (GNNs) for representation learning over the past few years. GNNs provide a general and efficient framework to learn from graph-structured data. However, GNNs typically only use the information of a very limited neighborhood for each node to avoid over-smoothing. A larger neighborhood would be desirable to provide the model with more information. In this work, we incorporate the limit distribution of Personalized PageRank (PPR) into graph attention networks (GATs) to reflect the larger neighbor information without introducing over-smoothing. Intuitively, message aggregation based on Personalized PageRank corresponds to infinitely many neighborhood aggregation layers. We show that our models outperform a variety of baseline models for four widely used benchmark datasets. Our implementation is publicly available online.
In text/plain format

Archived Files and Locations

application/pdf  279.3 kB
file_ttdedmhh6fazbbfy62fru7dccm
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2022-05-27
Version   v1
Language   en ?
arXiv  2205.14259v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 6f959f00-db4b-44d7-97d9-a90d09e3e79a
API URL: JSON