{"url":"/task/graph-learning","name":"Graph Learning","slug":"graph-learning","description_markdown":"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.\r\n\r\nGraph 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.\r\n\r\nKey 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.","categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":1570,"papers_with_code":686,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":10,"subtasks":2,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/graph-learning-on-camels","slug":"graph-learning-on-camels","dataset":"CAMELS","dataset_url":null,"rows_in_archive":1,"metrics":["R^2","absolute relative error"],"first_row_in_archive_order":{"model":"HaloGraphNet","paper_title":"Inferring halo masses with Graph Neural Networks","paper_url":"/paper/inferring-halo-masses-with-graph-neural","paper_date":"2021-11-16","arxiv_id":"2111.08683","code_links":[{"title":"PabloVD/HaloGraphNet","url":"https://github.com/PabloVD/HaloGraphNet"}],"syntology":null}}],"datasets":[{"url":"/dataset/botnet","name":"BotNet","full_name":null,"num_papers_in_archive":12},{"url":"/dataset/mindboggle","name":"Mindboggle","full_name":"","num_papers_in_archive":9},{"url":"/dataset/mimic-sparql","name":"MIMIC-SPARQL","full_name":"","num_papers_in_archive":3},{"url":"/dataset/gvlqa","name":"GVLQA","full_name":"Graph Vision-Language Question-Answering","num_papers_in_archive":2},{"url":"/dataset/asep","name":"AsEP","full_name":"Antibody-specific Epitope Prediction","num_papers_in_archive":1},{"url":"/dataset/ethz-shape","name":"ETHZ-Shape","full_name":"ETHZ-Shape","num_papers_in_archive":1},{"url":"/dataset/lowest-common-ancestor-generations-lcag","name":"Lowest Common Ancestor Generations (LCAG) Phasespace Particle Decay Reconstruction Dataset","full_name":"","num_papers_in_archive":1},{"url":"/dataset/nba-player-performance-prediction-dataset","name":"NBA player performance prediction dataset","full_name":"","num_papers_in_archive":1},{"url":"/dataset/ocb","name":"OCB","full_name":"Open Circuit Benchmark","num_papers_in_archive":1},{"url":"/dataset/sagc-a68","name":"SAGC-A68","full_name":"A space access graph dataset for the classification of spaces and space elements in apartment buildings","num_papers_in_archive":1}],"subtasks":[{"url":"/task/graph-sampling","name":"Graph Sampling"},{"url":"/task/task-graph-learning","name":"Task Graph Learning"}],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":686,"tagged_in_all":1570,"items":[{"url":"/paper/graph-random-neural-network","title":"Graph Random Neural Network for Semi-Supervised Learning on Graphs","date":"2020-05-22","arxiv_id":"2005.11079","repositories_listed":9,"syntology":{"n":22,"n_ran":8,"n_unverified":14,"n_pointer_only":0}},{"url":"/paper/deep-graph-library-towards-efficient-and","title":"Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks","date":"2019-09-03","arxiv_id":"1909.01315","repositories_listed":7,"syntology":{"n":39,"n_ran":3,"n_unverified":36,"n_pointer_only":4}},{"url":"/paper/ogb-lsc-a-large-scale-challenge-for-machine","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","date":"2021-03-17","arxiv_id":"2103.09430","repositories_listed":6,"syntology":null},{"url":"/paper/large-scale-learning-on-non-homophilous","title":"Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods","date":"2021-10-27","arxiv_id":"2110.14446","repositories_listed":5,"syntology":{"n":21,"n_ran":7,"n_unverified":14,"n_pointer_only":4}},{"url":"/paper/a-fair-comparison-of-graph-neural-networks-1","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","date":"2019-12-20","arxiv_id":"1912.09893","repositories_listed":5,"syntology":null},{"url":"/paper/higher-order-attention-networks","title":"Topological Deep Learning: Going Beyond Graph Data","date":"2022-06-01","arxiv_id":"2206.00606","repositories_listed":4,"syntology":null},{"url":"/paper/gcc-graph-contrastive-coding-for-graph-neural","title":"GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training","date":"2020-06-17","arxiv_id":"2006.09963","repositories_listed":4,"syntology":{"n":2,"n_ran":0,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/understanding-negative-sampling-in-graph","title":"Understanding Negative Sampling in Graph Representation Learning","date":"2020-05-20","arxiv_id":"2005.09863","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/triplet-interaction-improves-graph","title":"Triplet Interaction Improves Graph Transformers: Accurate Molecular Graph Learning with Triplet Graph Transformers","date":"2024-02-07","arxiv_id":"2402.04538","repositories_listed":3,"syntology":{"n":13,"n_ran":10,"n_unverified":3,"n_pointer_only":0}},{"url":"/paper/cat-balanced-continual-graph-learning-with","title":"CaT: Balanced Continual Graph Learning with Graph Condensation","date":"2023-09-18","arxiv_id":"2309.09455","repositories_listed":3,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":1}},{"url":"/paper/sthg-spatial-temporal-heterogeneous-graph","title":"STHG: Spatial-Temporal Heterogeneous Graph Learning for Advanced Audio-Visual Diarization","date":"2023-06-18","arxiv_id":"2306.10608","repositories_listed":3,"syntology":null},{"url":"/paper/link-prediction-without-graph-neural-networks","title":"Link Prediction without Graph Neural Networks","date":"2023-05-23","arxiv_id":"2305.13656","repositories_listed":3,"syntology":null},{"url":"/paper/simplifying-subgraph-representation-learning","title":"Simplifying Subgraph Representation Learning for Scalable Link Prediction","date":"2023-01-29","arxiv_id":"2301.12562","repositories_listed":3,"syntology":null},{"url":"/paper/graph-matching-with-bi-level-noisy","title":"Graph Matching with Bi-level Noisy Correspondence","date":"2022-12-08","arxiv_id":"2212.04085","repositories_listed":3,"syntology":{"n":7,"n_ran":7,"n_unverified":0,"n_pointer_only":7}},{"url":"/paper/enhanced-graph-learning-schemes-driven-by","title":"Enhanced graph-learning schemes driven by similar distributions of motifs","date":"2022-07-11","arxiv_id":"2207.04747","repositories_listed":3,"syntology":null},{"url":"/paper/graphmae-self-supervised-masked-graph","title":"GraphMAE: Self-Supervised Masked Graph Autoencoders","date":"2022-05-22","arxiv_id":"2205.10803","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":3}},{"url":"/paper/invariance-principle-meets-out-of","title":"Learning Causally Invariant Representations for Out-of-Distribution Generalization on Graphs","date":"2022-02-11","arxiv_id":"2202.05441","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/edge-augmented-graph-transformers-global-self","title":"Global Self-Attention as a Replacement for Graph Convolution","date":"2021-08-07","arxiv_id":"2108.03348","repositories_listed":3,"syntology":{"n":4,"n_ran":0,"n_unverified":4,"n_pointer_only":0}},{"url":"/paper/autosf-towards-automatic-scoring-function","title":"Bilinear Scoring Function Search for Knowledge Graph Learning","date":"2021-07-01","arxiv_id":"2107.00184","repositories_listed":3,"syntology":null},{"url":"/paper/tcl-transformer-based-dynamic-graph-modelling","title":"TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learning","date":"2021-05-17","arxiv_id":"2105.07944","repositories_listed":3,"syntology":null},{"url":"/paper/learning-on-attribute-missing-graphs","title":"Learning on Attribute-Missing Graphs","date":"2020-11-03","arxiv_id":"2011.01623","repositories_listed":3,"syntology":{"n":6,"n_ran":5,"n_unverified":1,"n_pointer_only":6}},{"url":"/paper/self-supervised-graph-learning-for","title":"Self-supervised Graph Learning for Recommendation","date":"2020-10-21","arxiv_id":"2010.10783","repositories_listed":3,"syntology":null},{"url":"/paper/lifelong-graph-learning","title":"Lifelong Graph Learning","date":"2020-09-01","arxiv_id":"2009.00647","repositories_listed":3,"syntology":{"n":4,"n_ran":1,"n_unverified":3,"n_pointer_only":0}},{"url":"/paper/generative-3d-part-assembly-via-dynamic-graph","title":"Generative 3D Part Assembly via Dynamic Graph Learning","date":"2020-06-14","arxiv_id":"2006.07793","repositories_listed":3,"syntology":null},{"url":"/paper/deepergcn-all-you-need-to-train-deeper-gcns","title":"DeeperGCN: All You Need to Train Deeper GCNs","date":"2020-06-13","arxiv_id":"2006.07739","repositories_listed":3,"syntology":null},{"url":"/paper/connecting-the-dots-multivariate-time-series","title":"Connecting the Dots: Multivariate Time Series Forecasting with Graph Neural Networks","date":"2020-05-24","arxiv_id":"2005.11650","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_unverified":1,"n_pointer_only":1}},{"url":"/paper/diffusion-improves-graph-learning-1","title":"Diffusion Improves Graph Learning","date":"2019-10-28","arxiv_id":"1911.05485","repositories_listed":3,"syntology":{"n":3,"n_ran":0,"n_unverified":3,"n_pointer_only":0}},{"url":"/paper/graph-construction-from-data-using-non","title":"Neighborhood and Graph Constructions using Non-Negative Kernel Regression","date":"2019-10-21","arxiv_id":"1910.09383","repositories_listed":3,"syntology":null},{"url":"/paper/fast-and-distributed-equivariant-graph-neural","title":"Fast and Distributed Equivariant Graph Neural Networks by Virtual Node Learning","date":"2025-06-24","arxiv_id":"2506.19482","repositories_listed":2,"syntology":null},{"url":"/paper/2506-08618","title":"HSG-12M: A Large-Scale Spatial Multigraph Dataset","date":"2025-06-10","arxiv_id":"2506.08618","repositories_listed":2,"syntology":{"n":14,"n_ran":6,"n_unverified":8,"n_pointer_only":0}}],"syntology_records":16,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}