mlsanityData to 14 Oct 2026

LLM4GNAS: A Large Language Model Based Toolkit for Graph Neural Architecture Search

arXiv 2502.10459 ↗First posted 12 Feb 2025cs.LG cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

Graph Neural Architecture Search (GNAS) facilitates the automatic design of Graph Neural Networks (GNNs) tailored to specific downstream graph learning tasks. However, existing GNAS approaches often require manual adaptation to new graph search spaces, necessitating substantial code optimization and domain-specific knowledge. To address this challenge, we present LLM4GNAS, a toolkit for GNAS that leverages the generative capabilities of Large Language Models (LLMs). LLM4GNAS includes an algorithm library for graph neural architecture search algorithms based on LLMs, enabling the adaptation of GNAS methods to new search spaces through the modification of LLM prompts. This approach reduces the need for manual intervention in algorithm adaptation and code modification. The LLM4GNAS toolkit is extensible and robust, incorporating LLM-enhanced graph feature engineering, LLM-enhanced graph neural architecture search, and LLM-enhanced hyperparameter optimization. Experimental results indicate that LLM4GNAS outperforms existing GNAS methods on tasks involving both homogeneous and heterogeneous graphs.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 30 of its 49 references that are in the map. First posted on arXiv 12 Feb 2025.

Builds on

30 of 49 references.

References · 30

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  4. 2017Graph Attention Networkscited by 8,923
  5. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,326
  6. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,790
  7. 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,181
  8. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
  9. 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,694
  10. 2023PaLM 2 Technical Reportcited by 1,162
  11. 2023Large Language Models as Optimizerscited by 864
  12. 2020Simple and Deep Graph Convolutional Networkscited by 860
18 more
  1. 2021How Attentive are Graph Attention Networks?cited by 835
  2. 2019Heterogeneous Graph Attention Networkcited by 734
  3. 2020Heterogeneous Graph Transformercited by 582
  4. 2021Beyond Low-frequency Information in Graph Convolutional Networkscited by 362
  5. 2020MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embeddingcited by 304
  6. 2023GPT4Graph: Can Large Language Models Understand Graph Structured Data ? An Empirical Evaluation and Benchmarkingcited by 210
  7. 2023Harnessing Explanations: LLM-to-LM Interpreter for Enhanced Text-Attributed Graph Representation Learningcited by 133
  8. 2023Graph-ToolFormer: To Empower LLMs with Graph Reasoning Ability via Prompt Augmented by ChatGPTcited by 80
  9. 2019Auto-GNN: Neural Architecture Search of Graph Neural Networkscited by 74
  10. 2023Can GPT-4 Perform Neural Architecture Search?cited by 74
  11. 2023Using Large Language Models for Hyperparameter Optimizationcited by 71
  12. 2021Automated Machine Learning on Graphs: A Surveycited by 39
  13. 2022PaSca: a Graph Neural Architecture Search System under the Scalable Paradigmcited by 37
  14. 2020DiffMG: Differentiable Meta Graph Search for Heterogeneous Graph Neural Networkscited by 34
  15. 2023Auto-HeG: Automated Graph Neural Network on Heterophilic Graphscited by 23
  16. 2021AutoGEL: An Automated Graph Neural Network with Explicit Link Informationcited by 17
  17. 2023Adversarially Robust Neural Architecture Search for Graph Neural Networkscited by 7
  18. 2023Heterogeneous Graph Neural Architecture Search with GPT-4cited by 7

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 3; 2026: 1.

4 papers.