Pith. sign in

REVIEW 3 cited by

Automated Graph Machine Learning: Approaches, Libraries, Benchmarks and Directions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2201.01288 v2 pith:JAVYFXGA submitted 2022-01-04 cs.LG cs.AI

classification cs.LGcs.AI
keywords learninggraphmachineautomatedapproachesdirectionslibrariesarchitecture
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Graph machine learning has been extensively studied in both academic and industry. However, as the literature on graph learning booms with a vast number of emerging methods and techniques, it becomes increasingly difficult to manually design the optimal machine learning algorithm for different graph-related tasks. To tackle the challenge, automated graph machine learning, which aims at discovering the best hyper-parameter and neural architecture configuration for different graph tasks/data without manual design, is gaining an increasing number of attentions from the research community. In this paper, we extensively discuss automated graph machine learning approaches, covering hyper-parameter optimization (HPO) and neural architecture search (NAS) for graph machine learning. We briefly overview existing libraries designed for either graph machine learning or automated machine learning respectively, and further in depth introduce AutoGL, our dedicated and the world's first open-source library for automated graph machine learning. Also, we describe a tailored benchmark that supports unified, reproducible, and efficient evaluations. Last but not least, we share our insights on future research directions for automated graph machine learning. This paper is the first systematic and comprehensive discussion of approaches, libraries as well as directions for automated graph machine learning.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. SA-GNAS: Seed Architecture Expansion for Efficient Large-scale Graph Neural Architecture Search

    cs.LG 2024-12 conditional novelty 6.0 of 10

    Seed-architecture expansion via Kendall-tau subgraph matching and entropy-guided node splitting scales graph neural architecture search to billion-edge graphs in about 8 GPU hours.

  2. Knowledge-aware Evolutionary Graph Neural Architecture Search

    cs.NE 2024-11 conditional novelty 6.0 of 10

    KEGNAS uses a knowledge base of pre-evaluated GNN architectures to generate and rank transfer candidates that warm-start a multi-objective evolutionary search, improving accuracy on several graph datasets.

  3. Automated Decision-Making on Networks with LLMs through Knowledge-Guided Evolution

    cs.LG 2025-06 conditional novelty 5.0 of 10

    LLMNet automates GNN architecture design with LLM agents that retrieve knowledge from curated knowledge bases, and it reports top average rank on twelve graph learning benchmarks.

Pith tools