Browse State-of-the-Art › Graph Regression

Graph Regression

118 papers with code · 23 benchmarks · 21 datasets archive 2025-07-28

Graphs

The regression task is similar to graph classification but using different loss function and performance metric.

Description from the archive archive 2025-07-28.

Benchmarks archive 2025-07-28

23 leaderboard tables shown for this task, 23 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted. 10 shown of 23 until expanded.

DatasetBest model (first row in archive order)PaperCodeSyntologyCompare
Peptides-struct (39 rows) ESA + RWSE (Edge set attention, Random Walk Structural Encoding, tuned) An end-to-end attention-based approach for learning on graphs code — Compare
ZINC-500k (36 rows) ESA + rings + NodeRWSE + EdgeRWSE An end-to-end attention-based approach for learning on graphs code — Compare
ZINC (27 rows) ESA + rings + NodeRWSE + EdgeRWSE An end-to-end attention-based approach for learning on graphs code — Compare
Lipophilicity (23 rows) PNA Principal Neighbourhood Aggregation for Graph Nets code Syntology ran 33 of 55 samples · 22 unverified Compare
PCQM4Mv2-LSC (20 rows) ESA (Edge set attention, no positional encodings) An end-to-end attention-based approach for learning on graphs code — Compare
ZINC-full (19 rows) ESA + rings + NodeRWSE + EdgeRWSE An end-to-end attention-based approach for learning on graphs code — Compare
PCQM4M-LSC (11 rows) Graphormer Do Transformers Really Perform Bad for Graph Representation? code — Compare
ESR2 (9 rows) ESA (Edge set attention, no positional encodings) An end-to-end attention-based approach for learning on graphs code — Compare
F2 (9 rows) ESA (Edge set attention, no positional encodings) An end-to-end attention-based approach for learning on graphs code — Compare
KIT (9 rows) PNA Principal Neighbourhood Aggregation for Graph Nets code Syntology ran 33 of 55 samples · 22 unverified Compare
PARP1 (9 rows) ESA (Edge set attention, no positional encodings) An end-to-end attention-based approach for learning on graphs code — Compare
PGR (9 rows) ESA (Edge set attention, no positional encodings) An end-to-end attention-based approach for learning on graphs code — Compare
ZINC 100k (8 rows) CIN-small Weisfeiler and Lehman Go Cellular: CW Networks code — Compare
Tox21 (3 rows) CensNet CensNet: Convolution with Edge-Node Switching in Graph Neural Networks — — Compare
ESOL (1 row) ProtoW-dot Optimal Transport Graph Neural Networks code Syntology ran 1 of 1 samples · 0 unverified Compare
GlassTemp (1 row) GREA (GIN) Graph Rationalization with Environment-based Augmentations code Syntology ran 0 of 1 samples · 1 unverified Compare
Lipophilicity (1 row) GAT Graph Attention Networks code Syntology ran 50 of 106 samples · 56 unverified Compare
QM9 (1 row) FIT-GNN FIT-GNN: Faster Inference Time for GNNs Using Coarsening code — Compare
QM9: del e (1 row) FIT-GNN FIT-GNN: Faster Inference Time for GNNs Using Coarsening code — Compare
QM9: mu (1 row) FIT-GNN FIT-GNN: Faster Inference Time for GNNs Using Coarsening code — Compare
QM9: UATOM (1 row) FIT-GNN FIT-GNN: Faster Inference Time for GNNs Using Coarsening code — Compare
QM9: ZPVE (1 row) FIT-GNN FIT-GNN: Faster Inference Time for GNNs Using Coarsening code — Compare
ZINC 10k (1 row) FIT-GNN FIT-GNN: Faster Inference Time for GNNs Using Coarsening code — Compare

Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. A dash means no Syntology record for that paper, not a recorded non-run. Read from the graph 2026-09-24.

Libraries

Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.

Datasets archive 2025-07-28

21 datasets whose archive record lists this task, ordered by the archive's paper count.

Subtasks archive 2025-07-28

No subtask under this task in the archive's task tree.

Most implemented papers archive 2025-07-28

30 shown of 118 papers with code (145 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.

  • 30 Oct 2017 93 repositories listed Syntology ran 50 of 106 samples · 56 unverified · 43 pointer-only (licence)
    We present graph attention networks (GATs), novel neural network architectures that operate on graph-structured data, leveraging masked self-attentional layers to address the shortcomings of prior methods based on graph…
  • 9 Sep 2016 55 repositories listed Syntology ran 31 of 58 samples · 27 unverified · 22 pointer-only (licence)
    We present a scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of convolutional neural networks which operate directly on graphs.
  • 7 Jun 2017 20 repositories listed Syntology ran 3 of 5 samples · 2 unverified · 5 pointer-only (licence)
    Low-dimensional embeddings of nodes in large graphs have proved extremely useful in a variety of prediction tasks, from content recommendation to identifying protein functions.
  • 4 Apr 2017 20 repositories listed Syntology ran 3 of 3 samples · 0 unverified · 1 pointer-only (licence)
    Supervised learning on molecules has incredible potential to be useful in chemistry, drug discovery, and materials science.
  • 1 Oct 2018 19 repositories listed Syntology ran 3 of 10 samples · 7 unverified · 5 pointer-only (licence)
    Here, we present a theoretical framework for analyzing the expressive power of GNNs to capture different graph structures.
  • 2 Mar 2020 15 repositories listed Syntology ran 1 of 23 samples · 22 unverified
    In the last few years, graph neural networks (GNNs) have become the standard toolkit for analyzing and learning from data on graphs.
  • 30 May 2021 8 repositories listed Syntology ran 6 of 16 samples · 10 unverified · 1 pointer-only (licence)
    Because GATs use a static attention mechanism, there are simple graph problems that GAT cannot express: in a controlled problem, we show that static attention hinders GAT from even fitting the training data.
  • 12 Apr 2020 8 repositories listed Syntology ran 33 of 55 samples · 22 unverified · 48 pointer-only (licence)
    Graph Neural Networks (GNNs) have been shown to be effective models for different predictive tasks on graph-structured data.
  • 30 Sep 2015 8 repositories listed Syntology ran 0 of 26 samples · 26 unverified · 1 pointer-only (licence)
    We introduce a convolutional neural network that operates directly on graphs.
  • 19 Feb 2019 7 repositories listed Syntology ran 3 of 8 samples · 5 unverified
    Graph Convolutional Networks (GCNs) and their variants have experienced significant attention and have become the de facto methods for learning graph representations.
  • 17 Mar 2021 6 repositories listed
    Enabling effective and efficient machine learning (ML) over large-scale graph data (e.
  • 9 Mar 2022 5 repositories listed Syntology ran 4 of 9 samples · 5 unverified
    This technical note describes the recent updates of Graphormer, including architecture design modifications, and the adaption to 3D molecular dynamics simulation.
  • 9 Jun 2021 5 repositories listed
    Our key insight to utilizing Transformer in the graph is the necessity of effectively encoding the structural information of a graph into the model.
  • 29 Jan 2025 4 repositories listed
    We study the effectiveness of molecular fingerprints for peptide property prediction and demonstrate that domain-specific feature extraction from molecular graphs can outperform complex and computationally expensive…
  • 25 May 2022 4 repositories listed Syntology ran 3 of 21 samples · 18 unverified
    We propose a recipe on how to build a general, powerful, scalable (GPS) graph Transformer with linear complexity and state-of-the-art results on a diverse set of benchmarks.
  • 4 Jul 2020 4 repositories listed Syntology ran 5 of 7 samples · 2 unverified · 4 pointer-only (licence)
    We propose the GCNII, an extension of the vanilla GCN model with two simple yet effective techniques: {\em Initial residual} and {\em Identity mapping}.
  • 25 Nov 2016 4 repositories listed Syntology ran 0 of 5 samples · 5 unverified
    Recently, there has been an increasing interest in geometric deep learning, attempting to generalize deep learning methods to non-Euclidean structured data such as graphs and manifolds, with a variety of applications…
  • 7 Feb 2024 3 repositories listed Syntology ran 10 of 13 samples · 3 unverified
    We also obtain SOTA results on QM9, MOLPCBA, and LIT-PCBA molecular property prediction benchmarks via transfer learning.
  • 28 Oct 2023 3 repositories listed Syntology ran 11 of 12 samples · 1 unverified
    However, from a theoretical perspective, the universal expressive power of spectral embedding comes at the price of losing two important invariance properties of graphs, sign and basis invariance, which also limits its…
  • 27 Dec 2022 3 repositories listed Syntology ran 2 of 3 samples · 1 unverified
    First, they capture long-range dependency and mitigate the issue of over-squashing as demonstrated on Long Range Graph Benchmark and TreeNeighbourMatch datasets.
  • 23 Nov 2022 3 repositories listed
    Unlike existing graph explainability methods, our network can produce node and edge attributional explanations along multiple channels, the number of which is independent of task specifications.
  • 7 Aug 2021 3 repositories listed Syntology ran 0 of 4 samples · 4 unverified
    The resultant framework - which we call Edge-augmented Graph Transformer (EGT) - can directly accept, process and output structural information of arbitrary form, which is important for effective learning on…
  • 17 Dec 2020 3 repositories listed Syntology ran 2 of 2 samples · 0 unverified
    This work closes the gap between the original transformer, which was designed for the limited case of line graphs, and graph neural networks, that can work with arbitrary graphs.
  • 1 Jun 2025 2 repositories listed
    Graph-based learning provides a powerful framework for modeling complex relational structures; however, its application within the domain of wireless security remains significantly underexplored.
  • 24 Apr 2025 2 repositories listed
    Understanding complex three-dimensional (3D) structures of graphs is essential for accurately modeling various properties, yet many existing approaches struggle with fully capturing the intricate spatial relationships…
  • 30 Jan 2025 2 repositories listed Syntology ran 6 of 11 samples · 5 unverified
    Graph learning tasks often hinge on identifying key substructure patterns -- such as triadic closures in social networks or benzene rings in molecular graphs -- that underpin downstream performance.
  • 28 May 2024 2 repositories listed Syntology ran 4 of 6 samples · 2 unverified · 1 pointer-only (licence)
    In this work, we introduce a canonicalization perspective that provides an essential and complete view of the design of frames.
  • 3 Feb 2024 2 repositories listed Syntology ran 14 of 21 samples · 7 unverified · 21 pointer-only (licence)
    Transformers have revolutionized performance in Natural Language Processing and Vision, paving the way for their integration with Graph Neural Networks (GNNs).
  • 1 Sep 2023 2 repositories listed Syntology ran 5 of 12 samples · 7 unverified
    The recent Long-Range Graph Benchmark (LRGB, Dwivedi et al.
  • 27 May 2023 2 repositories listed Syntology ran 6 of 12 samples · 6 unverified
    Graph inductive biases are crucial for Graph Transformers, and previous works incorporate them using message-passing modules and/or positional encodings.

Syntology lines on 24 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.

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