Methods › Graphs › Graph Models › PNA

Principal Neighbourhood Aggregation

PNA

5 papers tagged archive 2025-07-28

Introduced by Gabriele Corso et al. in Principal Neighbourhood Aggregation for Graph Nets

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Principal Neighbourhood Aggregation (PNA) is a general and flexible architecture for graphs combining multiple aggregators with degree-scalers (which generalize the sum aggregator).

PaperSource

Papers archive 2025-07-28

5 shown of 5, newest first. Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code; it is per sample and not a correctness claim.

Tasks archive 2025-07-28

9 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Benchmarking1
Computational Efficiency1
Graph Classification1
Graph Neural Network1
Graph Regression1
Molecular Property Prediction1
Node Classification1
Super-Resolution1
Time Series1

Usage over time archive 2025-07-28

Papers per year tagged with PNA: 2020 to 2025, peak 1 1 0 2020: 1 paper 2020 2021: 1 paper 2021 2022: 0 papers 2022 2023: 1 paper 2023 2024: 1 paper 2024 2025: 1 paper 2025
Papers per year the archive tags with this method, by the paper's archive date (5 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Graph Models

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections