Pith. sign in

REVIEW 6 cited by

GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal 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 1803.07294 v1 pith:7DRD4IHS submitted 2018-03-20 cs.LG cs.SI

GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal Graphs

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

We propose a new network architecture, Gated Attention Networks (GaAN), for learning on graphs. Unlike the traditional multi-head attention mechanism, which equally consumes all attention heads, GaAN uses a convolutional sub-network to control each attention head's importance. We demonstrate the effectiveness of GaAN on the inductive node classification problem. Moreover, with GaAN as a building block, we construct the Graph Gated Recurrent Unit (GGRU) to address the traffic speed forecasting problem. Extensive experiments on three real-world datasets show that our GaAN framework achieves state-of-the-art results on both tasks.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 6 Pith papers

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

  1. Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges

    cs.LG 2021-04 accept novelty 6.0

    Geometric deep learning provides a unified mathematical framework based on grids, groups, graphs, geodesics, and gauges to explain and extend neural network architectures by incorporating physical regularities.

  2. Graph Star Net for Generalized Multi-Task Learning

    cs.SI 2019-06 unverdicted novelty 6.0

    GraphStar is a new GNN that adds star nodes and relay attention to achieve non-local representations for node, graph, and link tasks, claiming 2-5% gains over prior SOTA on benchmarks.

  3. Graph Mamba Operator: A Latent Simulator for Interacting Particle Systems

    cs.LG 2026-06 unverdicted novelty 5.0

    GraMO couples graph interactions and temporal state updates in one linear recurrence with input-dependent coefficients to simulate N-body, motion, and robotics systems with lower long-horizon error than prior GNN or S...

  4. GMENet: Generative Mixture of Experts Network for Multi-Center Glioma Diagnosis with Incomplete Imaging Sequences

    eess.IV 2026-05 unverdicted novelty 5.0

    GMENet synthesizes missing MRI sequences with gated cross-attention and fuses dual-sequence features via confidence-aware mixture-of-experts for improved glioma diagnosis on incomplete multi-center data.

  5. A Global-Local Graph Attention Network for Traffic Forecasting

    cs.AI 2026-05 unverdicted novelty 5.0

    GLGAT uses global-local graph attention with pairwise encoding and event-based adjacency to capture spatio-temporal traffic correlations and reports competitive results on two real-world datasets.

  6. STAGformer: A Spatio-temporal Agent Graph Transformer for Micro Mobility Demand Forecasting

    cs.LG 2026-07 conditional novelty 4.0

    STAGformer forecasts bike-station demand with linear-complexity spatial-temporal agent attention and reports lower RMSE/MAE than listed baselines on NYC and Chicago data.