paper-with-me

홈 › Papers

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

2024-10-08 · Lequan Lin, Dai Shi, Andi Han, Zhiyong Wang, Junbin Gao

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.

📄 PDF Abstract BibTeX arXiv:2410.05697

Code (1)

lequanlin/gnn-diff 공식 구현 pytorch

Tasks

Graph Representation LearningLink PredictionNode ClassificationRepresentation Learning

Methods 이 논문이 사용한 방법론

Diffusion Diffusion models generate samples by gradually removing noise from a signal, and their training objective can be expressed as a reweighted variational lower-bound…

Similar Papers 제목 키워드 기반

Augmenting and Tuning Knowledge Graph Embeddings

2019-07-01 · Robert Bamler, Farnood Salehi, Stephan Mandt

Knowledge graph embeddings rank among the most successful methods for link prediction in knowledge graphs, i.e., the task of completing an incomplete collection of relational facts. A downside of these models is their st…

Knowledge Graph EmbeddingsKnowledge GraphsLink Prediction

A Simple and Fast Baseline for Tuning Large XGBoost Models

2021-11-12 · Sanyam Kapoor, Valerio Perrone

XGBoost, a scalable tree boosting algorithm, has proven effective for many prediction tasks of practical interest, especially using tabular datasets. Hyperparameter tuning can further improve the predictive performance, …

Hyperparameter Optimization

To tune or not to tune? An Approach for Recommending Important Hyperparameters

2021-08-30 · Mohamadjavad Bahmani, Radwa El Shawi, Nshan Potikyan, Sherif Sakr

Novel technologies in automated machine learning ease the complexity of algorithm selection and hyperparameter optimization. Hyperparameters are important for machine learning models as they significantly influence the p…

BIG-bench Machine LearningHyperparameter Optimization

Selecting Hyperparameters for Tree-Boosting

2026-02-05 · Floris Jan Koster, Fabio Sigrist arxiv

Tree-boosting is a widely used machine learning technique for tabular data. However, its out-of-sample accuracy is critically dependent on multiple hyperparameters. In this article, we empirically compare several popular…

Hyperparameter Optimization

Learning to Tune XGBoost with XGBoost

2019-09-16 · Johanna Sommer, Dimitrios Sarigiannis, Thomas Parnell

In this short paper we investigate whether meta-learning techniques can be used to more effectively tune the hyperparameters of machine learning models using successive halving (SH). We propose a novel variant of the SH …

BIG-bench Machine LearningMeta-Learning