LGSIJun 18, 2022

MetaGL: Evaluation-Free Selection of Graph Learning Models via Meta-Learning

arXiv:2206.09280v38 citationsh-index: 136
Originality Incremental advance
AI Analysis

This addresses the costly and ad hoc model selection process in graph learning, offering a practical solution for researchers and practitioners, though it is incremental as it builds on meta-learning techniques.

The paper tackles the problem of selecting the best graph learning model and hyperparameters for a new graph without training or evaluation, by introducing MetaGL, a meta-learning approach that uses prior performances on benchmark datasets. The result shows MetaGL outperforms existing meta-learning techniques by up to 47% and is extremely fast at test time (~1 second).

Given a graph learning task, such as link prediction, on a new graph, how can we select the best method as well as its hyperparameters (collectively called a model) without having to train or evaluate any model on the new graph? Model selection for graph learning has been largely ad hoc. A typical approach has been to apply popular methods to new datasets, but this is often suboptimal. On the other hand, systematically comparing models on the new graph quickly becomes too costly, or even impractical. In this work, we develop the first meta-learning approach for evaluation-free graph learning model selection, called MetaGL, which utilizes the prior performances of existing methods on various benchmark graph datasets to automatically select an effective model for the new graph, without any model training or evaluations. To quantify similarities across a wide variety of graphs, we introduce specialized meta-graph features that capture the structural characteristics of a graph. Then we design G-M network, which represents the relations among graphs and models, and develop a graph-based meta-learner operating on this G-M network, which estimates the relevance of each model to different graphs. Extensive experiments show that using MetaGL to select a model for the new graph greatly outperforms several existing meta-learning techniques tailored for graph learning model selection (up to 47% better), while being extremely fast at test time (~1 sec).

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes