Saved in:
Bibliographic Details
Main Authors: Sardina, Jeffrey, Kelleher, John D., O'Sullivan, Declan
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2412.14801
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913618923094016
author Sardina, Jeffrey
Kelleher, John D.
O'Sullivan, Declan
author_facet Sardina, Jeffrey
Kelleher, John D.
O'Sullivan, Declan
contents Knowledge Graphs (KGs) have seen increasing use across various domains -- from biomedicine and linguistics to general knowledge modelling. In order to facilitate the analysis of knowledge graphs, Knowledge Graph Embeddings (KGEs) have been developed to automatically analyse KGs and predict new facts based on the information in a KG, a task called "link prediction". Many existing studies have documented that the structure of a KG, KGE model components, and KGE hyperparameters can significantly change how well KGEs perform and what relationships they are able to learn. Recently, the Topologically-Weighted Intelligence Generation (TWIG) model has been proposed as a solution to modelling how each of these elements relate. In this work, we extend the previous research on TWIG and evaluate its ability to simulate the output of the KGE model ComplEx in the cross-KG setting. Our results are twofold. First, TWIG is able to summarise KGE performance on a wide range of hyperparameter settings and KGs being learned, suggesting that it represents a general knowledge of how to predict KGE performance from KG structure. Second, we show that TWIG can successfully predict hyperparameter performance on unseen KGs in the zero-shot setting. This second observation leads us to propose that, with additional research, optimal hyperparameter selection for KGE models could be determined in a pre-hoc manner using TWIG-like methods, rather than by using a full hyperparameter search.
format Preprint
id arxiv_https___arxiv_org_abs_2412_14801
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Extending TWIG: Zero-Shot Predictive Hyperparameter Selection for KGEs based on Graph Structure
Sardina, Jeffrey
Kelleher, John D.
O'Sullivan, Declan
Machine Learning
Knowledge Graphs (KGs) have seen increasing use across various domains -- from biomedicine and linguistics to general knowledge modelling. In order to facilitate the analysis of knowledge graphs, Knowledge Graph Embeddings (KGEs) have been developed to automatically analyse KGs and predict new facts based on the information in a KG, a task called "link prediction". Many existing studies have documented that the structure of a KG, KGE model components, and KGE hyperparameters can significantly change how well KGEs perform and what relationships they are able to learn. Recently, the Topologically-Weighted Intelligence Generation (TWIG) model has been proposed as a solution to modelling how each of these elements relate. In this work, we extend the previous research on TWIG and evaluate its ability to simulate the output of the KGE model ComplEx in the cross-KG setting. Our results are twofold. First, TWIG is able to summarise KGE performance on a wide range of hyperparameter settings and KGs being learned, suggesting that it represents a general knowledge of how to predict KGE performance from KG structure. Second, we show that TWIG can successfully predict hyperparameter performance on unseen KGs in the zero-shot setting. This second observation leads us to propose that, with additional research, optimal hyperparameter selection for KGE models could be determined in a pre-hoc manner using TWIG-like methods, rather than by using a full hyperparameter search.
title Extending TWIG: Zero-Shot Predictive Hyperparameter Selection for KGEs based on Graph Structure
topic Machine Learning
url https://arxiv.org/abs/2412.14801