Pith. sign in

REVIEW 2 cited by

Graph Attention MLP with Reliable Label Utilization

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 2108.10097 v3 pith:ALRRBOB7 submitted 2021-08-23 cs.LG

classification cs.LG
keywords gamlpgraphattentionfieldscalabilitydifferentefficiencyflexible
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Graph neural networks (GNNs) have recently achieved state-of-the-art performance in many graph-based applications. Despite the high expressive power, they typically need to perform an expensive recursive neighborhood expansion in multiple training epochs and face a scalability issue. Moreover, most of them are inflexible since they are restricted to fixed-hop neighborhoods and insensitive to actual receptive field demands for different nodes. We circumvent these limitations by introducing a scalable and flexible Graph Attention Multilayer Perceptron (GAMLP). With the separation of the non-linear transformation and feature propagation, GAMLP significantly improves the scalability and efficiency by performing the propagation procedure in a pre-compute manner. With three principled receptive field attention, each node in GAMLP is flexible and adaptive in leveraging the propagated features over the different sizes of reception field. We conduct extensive evaluations on the three large open graph benchmarks (e.g., ogbn-papers100M, ogbn-products and ogbn-mag), demonstrating that GAMLP not only achieves the state-of-art performance, but also additionally provide high scalability and efficiency.

Discussion (0). Continue with ORCID 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. Training-free Heterogeneous Graph Condensation via Data Selection

    cs.LG 2024-12 conditional novelty 6.0 of 10

    FreeHGC performs training-free heterogeneous graph condensation through structural data selection and synthesis, matching or beating training-based condensation on seven datasets.

  2. Towards Scalable and Deep Graph Neural Networks via Noise Masking

    cs.LG 2024-12 reject novelty 5.0 of 10

    RMask uses random walks and a distance-based mask to extract exact-hop graph information, improving the accuracy and speed of model-simplification GNNs.

Pith tools