Skip to content

GraphAgent: An Effective Knowledge-Guided GNN Model Selection System

Aug 2026 · Proceedings of the VLDB Endowment · Vol 19, pp. 4630-4633 · 0 citations · 9 references

TL;DR

GraphAgent is demonstrated, a user-friendly and effective system for knowledge-guided selection of Graph Neural Network models for new graph data that unifies over 413,000 performance records from public GNN benchmarks into a comprehensive Graph-Model Knowledge Graph (GMKG).

Abstract

We demonstrate GraphAgent, a user-friendly and effective system for knowledge-guided selection of Graph Neural Network (GNN) models for new graph data. Existing methods, such as Neural Architecture Search, are computationally expensive, while pretrained graph foundation models often fail to generalize across diverse datasets and tasks. GraphAgent addresses these challenges by unifying over 413,000 performance records from public GNN benchmarks into a comprehensive Graph-Model Knowledge Graph (GMKG), encoding relationships between datasets, models, and tasks via ranking-based and performance-weighted edges. A reinforcement learning-based feature selector identifies the most informative metafeatures for each dataset, and model features are derived from normalized performance patterns. A Performance-Aware heterogeneous GNN, trained with listwise ranking loss, propagates structural and performance signals across the GMKG, enabling accurate model ranking prediction for new data. Given a user-uploaded graph and task, GraphAgent rapidly selects the top- k models with interpretable reasoning. Extensive evaluations show GraphAgent achieves up to 95.4% nDCG@1 efficiently.

View source

Similar papers

#graph neural networks Review Open access Sep 2026

Automated graph construction and graph neural network search: a survey

Graphs are widely used to describe objects and their interactions in physically-informed real-world networking scenario including transportation, networking and energy, etc. Graph neural network (GNN) is the latest deep learning (DL) model for processing graph-structured data, widely applied in various tasks, e.g., p...

Yu-Feng Wang, Xin-Ying-Jian-Gan-Zhi-De-Shen-Jing-Jia-Gou-Sou-Suo Wang, Jian-Hua Ma et al. · 0 citations
Open access Sep 2026

From Topology to Cognition: A Unified Graph-Driven Framework for Scalable Intelligent Data Mining

Modern data are increasingly represented and utilized as interconnected networks, including collaboration graphs, multi-relational user–item interactions, and schema-less knowledge graphs that support retrieval-augmented generation pipelines. While graph analytics has become a key foundation for intelligent data mining...

Yao Hu, Qian Huang · 0 citations
#machine learning Preprint Sep 2026

NodeGround: A Node Classification Benchmark in the Graph Foundation Model Era

Can a pretrained graph model replace training and tuning a separate predictor for each dataset? Answering this requires evaluating prediction quality alongside computational cost. We present NodeGround, a node classification benchmark that puts graph foundation models (GFMs) and dataset-specific supervised learning und...

Jin-Mo Lee, Dooho Lee, Minho Jeong et al. · 0 citations
#machine learning Preprint Sep 2026

Efficient Dynamic Algorithms for Graph Neural Networks with Non-Linear Propagation

Graph Neural Networks (GNNs) are widely used for representation learning on graphs, but most methods assume static topologies, making them inefficient on evolving networks where edges change over time. Existing dynamic approaches either model graph evolution through temporal GNN architectures without focusing on effici...

Kiarash Banihashem, Mohammadtaghi Hajiaghayi, Mahdi JafariRaviz et al. · 0 citations
#artificial intelligence Preprint Sep 2026

GTA: Graph Theory Agent and Benchmark for Algorithmic Graph Reasoning with LLMs

The Graph Theory Agent (GTA), which pairs a preference-trained representation selector with plan-and-decompose scaffolding around a frozen executor LLM, is proposed, which lifts Phi-4 from 53.5% to 69.1% on the benchmark's easy split and from 33.0% to 41.5% on its hard split.

Zi-Xiang Xu, Yan-Bo Wang, Chenxi Wang et al. · 2 citations · ⚡1
#machine learning Preprint Sep 2026

Message Passing Does More with Less for In-Context Learning on Graphs

Achieving strong performance with graph neural networks (GNNs) typically requires training and hyperparameter tuning for each dataset, incurring repeated costs and effort. Graph in-context learning (ICL) avoids this by using a single pretrained model to predict unknown node labels directly from labeled context nodes. E...

Dooho Lee, Jin-Mo Lee, Minho Jeong et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.