Browse State-of-the-Art › Graph Learning
Graph Learning
686 papers with code · 1 benchmark · 10 datasets archive 2025-07-28
Graph learning is a branch of machine learning that focuses on the analysis and interpretation of data represented in graph form. In this context, a graph is a collection of nodes (or vertices) and edges, where nodes represent entities and edges represent the relationships or interactions between these entities. This structure is particularly useful for modeling complex networks found in various domains such as social networks, biological networks, and communication networks.
Graph learning leverages the relationships and structures within the graph to learn and make predictions. It includes techniques like graph neural networks (GNNs), which extend the concept of neural networks to handle graph-structured data. These models are adept at capturing the dependencies and influence of connected nodes, leading to more accurate predictions in scenarios where relationships play a key role.
Key applications of graph learning include recommender systems, drug discovery, social network analysis, and fraud detection. By utilizing the inherent structure of graph data, graph learning algorithms can uncover deep insights and patterns that are not apparent with traditional machine learning approaches.
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
1 leaderboard table shown for this task, 1 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.
| Dataset | Best model (first row in archive order) | Paper | Code | Syntology | Compare |
|---|---|---|---|---|---|
| CAMELS (1 row) | HaloGraphNet | Inferring halo masses with Graph Neural Networks | 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
10 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
2 subtasks in the archive's task tree.
Most implemented papers archive 2025-07-28
30 shown of 686 papers with code (1,570 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.
-
22 May 2020 9 repositories listed Syntology ran 8 of 22 samples · 14 unverifiedWe study the problem of semi-supervised learning on graphs, for which graph neural networks (GNNs) have been extensively explored.
-
3 Sep 2019 7 repositories listed Syntology ran 3 of 39 samples · 36 unverified · 4 pointer-only (licence)Advancing research in the emerging field of deep graph learning requires new tools to support tensor computation over graphs.
-
17 Mar 2021 6 repositories listedEnabling effective and efficient machine learning (ML) over large-scale graph data (e.
-
27 Oct 2021 5 repositories listed Syntology ran 7 of 21 samples · 14 unverified · 4 pointer-only (licence)Many widely used datasets for graph machine learning tasks have generally been homophilous, where nodes with similar labels connect to each other.
-
20 Dec 2019 5 repositories listedWe believe that this work can contribute to the development of the graph learning field, by providing a much needed grounding for rigorous evaluations of graph classification models.
-
1 Jun 2022 4 repositories listedTopological deep learning is a rapidly growing field that pertains to the development of deep learning models for data supported on topological domains such as simplicial complexes, cell complexes, and hypergraphs,…
-
17 Jun 2020 4 repositories listed Syntology ran 0 of 2 samples · 2 unverifiedGraph representation learning has emerged as a powerful technique for addressing real-world problems.
-
20 May 2020 4 repositories listed Syntology ran 1 of 1 samples · 0 unverified · 1 pointer-only (licence)To the best of our knowledge, we are the first to derive the theory and quantify that the negative sampling distribution should be positively but sub-linearly correlated to their positive sampling distribution.
-
7 Feb 2024 3 repositories listed Syntology ran 10 of 13 samples · 3 unverifiedWe also obtain SOTA results on QM9, MOLPCBA, and LIT-PCBA molecular property prediction benchmarks via transfer learning.
-
18 Sep 2023 3 repositories listed Syntology ran 0 of 1 samples · 1 unverified · 1 pointer-only (licence)Recent replay-based methods intend to solve this problem by updating the model using both (1) the entire new-coming data and (2) a sampling-based memory bank that stores replayed graphs to approximate the distribution…
-
18 Jun 2023 3 repositories listedThis report introduces our novel method named STHG for the Audio-Visual Diarization task of the Ego4D Challenge 2023.
-
23 May 2023 3 repositories listedLink prediction, which consists of predicting edges based on graph features, is a fundamental task in many graph applications.
-
29 Jan 2023 3 repositories listedLink prediction on graphs is a fundamental problem.
-
8 Dec 2022 3 repositories listed Syntology ran 7 of 7 samples · 0 unverified · 7 pointer-only (licence)In this paper, we study a novel and widely existing problem in graph matching (GM), namely, Bi-level Noisy Correspondence (BNC), which refers to node-level noisy correspondence (NNC) and edge-level noisy correspondence…
-
11 Jul 2022 3 repositories listedGuided by this, we first assume that we have a reference graph that is related to the sought graph (in the sense of having similar motif densities) and then, we exploit this relation by incorporating a similarity…
-
22 May 2022 3 repositories listed Syntology ran 2 of 3 samples · 1 unverified · 3 pointer-only (licence)Despite this, contrastive learning-which heavily relies on structural data augmentation and complicated training strategies-has been the dominant approach in graph SSL, while the progress of generative SSL on graphs,…
-
11 Feb 2022 3 repositories listed Syntology ran 1 of 1 samples · 0 unverifiedDespite recent success in using the invariance principle for out-of-distribution (OOD) generalization on Euclidean data (e.
-
7 Aug 2021 3 repositories listed Syntology ran 0 of 4 samples · 4 unverifiedThe 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…
-
1 Jul 2021 3 repositories listedWe first set up a search space for AutoBLM by analyzing existing scoring functions.
-
17 May 2021 3 repositories listedSecondly, on top of the proposed graph transformer, we introduce a two-stream encoder that separately extracts representations from temporal neighborhoods associated with the two interaction nodes and then utilizes a…
-
3 Nov 2020 3 repositories listed Syntology ran 5 of 6 samples · 1 unverified · 6 pointer-only (licence)Thereby, designing a new GNN for these graphs is a burning issue to the graph learning community.
-
21 Oct 2020 3 repositories listedIn this work, we explore self-supervised learning on user-item graph, so as to improve the accuracy and robustness of GCNs for recommendation.
-
1 Sep 2020 3 repositories listed Syntology ran 1 of 4 samples · 3 unverifiedIn this paper, we bridge GNN and lifelong learning by converting a continual graph learning problem to a regular graph learning problem so GNN can inherit the lifelong learning techniques developed for convolutional…
-
14 Jun 2020 3 repositories listedAnalogous to buying an IKEA furniture, given a set of 3D parts that can assemble a single shape, an intelligent agent needs to perceive the 3D part geometry, reason to propose pose estimations for the input parts, and…
-
13 Jun 2020 3 repositories listedGraph Convolutional Networks (GCNs) have been drawing significant attention with the power of representation learning on graphs.
-
24 May 2020 3 repositories listed Syntology ran 1 of 2 samples · 1 unverified · 1 pointer-only (licence)Modeling multivariate time series has long been a subject that has attracted researchers from a diverse range of fields including economics, finance, and traffic.
-
28 Oct 2019 3 repositories listed Syntology ran 0 of 3 samples · 3 unverifiedIn this work, we remove the restriction of using only the direct neighbors by introducing a powerful, yet spatially localized graph convolution: Graph diffusion convolution (GDC).
-
21 Oct 2019 3 repositories listedData-driven neighborhood definitions and graph constructions are often used in machine learning and signal processing applications.
-
24 Jun 2025 2 repositories listedEquivariant Graph Neural Networks (GNNs) have achieved remarkable success across diverse scientific applications.
-
10 Jun 2025 2 repositories listed Syntology ran 6 of 14 samples · 8 unverifiedExisting graph benchmarks assume non-spatial, simple edges, collapsing physically distinct paths into a single link.
Syntology lines on 16 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