Diffusing to the Top: Boost Graph Neural Networks with Minimal Hyperparameter Tuning

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Lin, Lequan, Shi, Dai, Han, Andi, Wang, Zhiyong, Gao, Junbin
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866912063996035072
author Lin, Lequan
Shi, Dai
Han, Andi
Wang, Zhiyong
Gao, Junbin
author_facet Lin, Lequan
Shi, Dai
Han, Andi
Wang, Zhiyong
Gao, Junbin
contents Graph Neural Networks (GNNs) are proficient in graph representation learning and achieve promising performance on versatile tasks such as node classification and link prediction. Usually, a comprehensive hyperparameter tuning is essential for fully unlocking GNN's top performance, especially for complicated tasks such as node classification on large graphs and long-range graphs. This is usually associated with high computational and time costs and careful design of appropriate search spaces. This work introduces a graph-conditioned latent diffusion framework (GNN-Diff) to generate high-performing GNNs based on the model checkpoints of sub-optimal hyperparameters selected by a light-tuning coarse search. We validate our method through 166 experiments across four graph tasks: node classification on small, large, and long-range graphs, as well as link prediction. Our experiments involve 10 classic and state-of-the-art target models and 20 publicly available datasets. The results consistently demonstrate that GNN-Diff: (1) boosts the performance of GNNs with efficient hyperparameter tuning; and (2) presents high stability and generalizability on unseen data across multiple generation runs. The code is available at https://github.com/lequanlin/GNN-Diff.
format Preprint
id arxiv_https___arxiv_org_abs_2410_05697
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Diffusing to the Top: Boost Graph Neural Networks with Minimal Hyperparameter Tuning
Lin, Lequan
Shi, Dai
Han, Andi
Wang, Zhiyong
Gao, Junbin
Machine Learning
Graph Neural Networks (GNNs) are proficient in graph representation learning and achieve promising performance on versatile tasks such as node classification and link prediction. Usually, a comprehensive hyperparameter tuning is essential for fully unlocking GNN's top performance, especially for complicated tasks such as node classification on large graphs and long-range graphs. This is usually associated with high computational and time costs and careful design of appropriate search spaces. This work introduces a graph-conditioned latent diffusion framework (GNN-Diff) to generate high-performing GNNs based on the model checkpoints of sub-optimal hyperparameters selected by a light-tuning coarse search. We validate our method through 166 experiments across four graph tasks: node classification on small, large, and long-range graphs, as well as link prediction. Our experiments involve 10 classic and state-of-the-art target models and 20 publicly available datasets. The results consistently demonstrate that GNN-Diff: (1) boosts the performance of GNNs with efficient hyperparameter tuning; and (2) presents high stability and generalizability on unseen data across multiple generation runs. The code is available at https://github.com/lequanlin/GNN-Diff.
title Diffusing to the Top: Boost Graph Neural Networks with Minimal Hyperparameter Tuning
topic Machine Learning
url https://arxiv.org/abs/2410.05697