agentsclimarketplace

Graph learning papers guide

Skill brycewang-stanford/Auto-Empirical-Research-Skills/skills/43-wentorai-research-plugins/skills/domains/ai-ml/graph-learning-papers-guide

Conference papers on graph neural networks and graph learningFrom its SKILL.md

Install
npx -y skills add brycewang-stanford/Auto-Empirical-Research-Skills --skill graph-learning-papers-guide

Assembled from the repository path, not quoted from the project. Check it against their README if it does not work.

One thing to look at

  • no licenseNo license file was found in the repository. Code published without one is not open source by default, so using it at work is a question for whoever answers licensing questions where you are.

SKILL.md

4.1 KB, 970 tokens by cl100k_base, as published. Nobody here has run it

Graph Learning Papers Guide

Overview

A curated list of graph learning papers from top AI/ML conferences (NeurIPS, ICML, ICLR, KDD, WWW, AAAI). Covers graph neural networks, graph transformers, spectral methods, message passing, and applications in molecular science, social networks, and recommendation systems. Organized by venue, year, and topic for systematic tracking.

Topic Taxonomy

Graph Learning
├── Graph Neural Networks
│   ├── Message Passing (GCN, GAT, GraphSAGE, GIN)
│   ├── Spectral (ChebNet, CayleyNet)
│   ├── Graph Transformers (Graphormer, GPS)
│   └── Equivariant GNNs (EGNN, SE(3)-Transformers)
├── Graph Generation
│   ├── VAE-based (GraphVAE)
│   ├── Autoregressive (GraphRNN)
│   ├── Diffusion (GDSS, DiGress)
│   └── Flow-based (GraphFlow)
├── Self-supervised Learning
│   ├── Contrastive (GraphCL, GCA)
│   ├── Generative (GraphMAE)
│   └── Predictive (GPT-GNN)
├── Scalability
│   ├── Sampling (GraphSAINT, ClusterGCN)
│   ├── Knowledge distillation
│   └── Graph condensation
├── Temporal Graphs
│   ├── Dynamic GNNs
│   ├── Temporal interaction
│   └── Evolving graphs
└── Applications
    ├── Molecular property prediction
    ├── Drug discovery
    ├── Social network analysis
    ├── Recommendation systems
    └── Traffic forecasting

Key Models

ModelYearInnovation
GCN2017Spectral convolution simplified
GraphSAGE2017Inductive with sampling
GAT2018Attention over neighbors
GIN2019WL-test as powerful as possible
Graphormer2021Transformer on graphs
GPS2022General, powerful, scalable recipe
GraphMAE2022Masked autoencoding on graphs

Paper Search

import arxiv

def find_gnn_papers(topic="graph neural network", max_results=20):
    """Find recent GNN papers."""
    search = arxiv.Search(
        query=f"abs:{topic}",
        max_results=max_results,
        sort_by=arxiv.SortCriterion.SubmittedDate,
    )

    for r in search.results():
        print(f"[{r.published.strftime('%Y-%m-%d')}] {r.title}")

find_gnn_papers("graph transformer")
find_gnn_papers("molecular graph generation")

Benchmark Datasets

datasets = {
    "Node Classification": {
        "Cora": "Citation network, 7 classes",
        "PubMed": "Medical citation, 3 classes",
        "ogbn-arxiv": "arXiv papers, 40 classes",
        "ogbn-papers100M": "100M papers (large-scale)",
    },
    "Graph Classification": {
        "ZINC": "Molecular graphs, regression",
        "ogbg-molpcba": "128 molecular tasks",
        "PROTEINS": "Protein function prediction",
    },
    "Link Prediction": {
        "ogbl-collab": "Author collaborations",
        "ogbl-citation2": "Citation prediction",
    },
}

for task, ds in datasets.items():
    print(f"\n{task}:")
    for name, desc in ds.items():
        print(f"  {name}: {desc}")

Use Cases

  1. Literature survey: Track GNN research across top venues
  2. Method comparison: Compare GNN architectures and results
  3. Research planning: Identify trends and open problems
  4. Course preparation: Curate reading lists for GNN courses
  5. Benchmark tracking: Monitor SOTA on OGB leaderboards

References

What ships with it

Read from the repository

Just SKILL.md. No reference files, no scripts.

Keep looking

Skills are one crate of 326,144. Ordering is by how many stacks a row turns up in, so the top of any crate is what has actually been picked rather than what has the most stars.