KGTuner: Efficient Hyper-parameter Search for Knowledge Graph Learning
While hyper-parameters (HPs) are important for knowledge graph (KG) learning, existing methods fail to search them efficiently. To solve this problem, we first analyze the properties of different HPs and measure the transfer ability from small subgraph to the full graph. Based on the analysis, we propose an efficient two-stage search algorithm KGTuner, which efficiently explores HP configurations on small subgraph at the first stage and transfers the top-performed configurations for fine-tuning on the large full graph at the second stage. Experiments show that our method can consistently find better HPs than the baseline algorithms within the same time budget, which achieves {9.1\%} average relative improvement for four embedding models on the large-scale KGs in open graph benchmark.
Code (2)
Tasks
Graph LearningSimilar Papers 제목 키워드 기반
Efficient Hyper-parameter Search for Knowledge Graph Embedding
While hyper-parameters (HPs) are important for knowledge graph (KG) learning, existing methods fail to search them efficiently. To solve this problem, we first analyze the properties of different HPs and measure the tran…
AutoMLGraph EmbeddingKnowledge Graph EmbeddingAssessing the Effects of Hyperparameters on Knowledge Graph Embedding Quality
Embedding knowledge graphs into low-dimensional spaces is a popular method for applying approaches, such as link prediction or node classification, to these databases. This embedding process is very costly in terms of bo…
Graph EmbeddingKnowledge Graph EmbeddingKnowledge GraphsLink Prediction+2Extending TWIG: Zero-Shot Predictive Hyperparameter Selection for KGEs based on Graph Structure
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 Embeddin…
General KnowledgeKnowledge Graph EmbeddingsKnowledge GraphsLink PredictionEfficient Hyper-parameter Search for Knowledge Graph Embedding
While hyper-parameters (HPs) are important for knowledge graph (KG) embedding, existing methods fail to search them efficiently. To solve this problem, we first analyze the properties of different HPs and quantize the tr…
Graph EmbeddingKnowledge Graph EmbeddingAugmenting and Tuning Knowledge Graph Embeddings
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