LLM4GNAS: A Large Language Model Based Toolkit for Graph Neural Architecture Search
Yang Gao, Hong Yang, Yizhi Chen, Junxian Wu, Peng Zhang, Haishuai Wang
TL;DR
LLM4GNAS tackles the adaptability bottleneck in Graph Neural Architecture Search by introducing an LLM-based toolkit that augments node features, guides architecture search, and optimizes hyperparameters via prompts. The framework uses an LLM as controller to iterative perform LLM-enhanced Node Augmentation, GNAS, and Hyperparameter Optimization, with prompt engineering enabling easy transfer to new search spaces. Empirical results on both homogeneous and heterogeneous graphs show competitive performance and improved search efficiency against established GNAS baselines, with ablations validating the contributions of node augmentation and LLM choice. This work demonstrates a scalable, extensible path toward prompt-driven neural architecture search for graph tasks and lays groundwork for graph foundation-models.
Abstract
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.
