mlsanityData to 7 Oct 2026

KGTuner: Efficient Hyper-parameter Search for Knowledge Graph Learning

arXiv 2205.02460 ↗First posted 5 May 2022cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 29 of its 62 references that are in the map. First posted on arXiv 5 May 2022.

Builds on

29 of 62 references.

References · 29

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2017Inductive Representation Learning on Large Graphscited by 6,284
  3. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
  4. 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,684
  5. 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
  6. 2014Embedding Entities and Relations for Learning and Inference in Knowledge Basescited by 929
  7. 2019RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Spacecited by 893
  8. 2017Convolutional 2D Knowledge Graph Embeddingscited by 729
  9. 2020A Survey on Knowledge Graphs: Representation, Acquisition and Applicationscited by 643
  10. 2019Composition-based Multi-Relational Graph Convolutional Networkscited by 395
  11. 2019TuckER: Tensor Factorization for Knowledge Graph Completioncited by 290
  12. 2019Inductive Relation Prediction by Subgraph Reasoningcited by 237
17 more
  1. 2018SimplE Embedding for Link Prediction in Knowledge Graphscited by 195
  2. 2020Design Space for Graph Neural Networkscited by 182
  3. 2018Canonical Tensor Decomposition for Knowledge Base Completioncited by 150
  4. 2018Tunability: Importance of Hyperparameters of Machine Learning Algorithmscited by 98
  5. 2021Knowledge Graph Reasoning with Relational Digraphcited by 91
  6. 2020Knowledge Graph Embedding for Link Prediction: A Comparative Analysiscited by 85
  7. 2019Learning to Exploit Long-term Relational Dependencies in Knowledge Graphscited by 83
  8. 2017Knowledge Graph Completion via Complex Tensor Factorizationcited by 80
  9. 2019A Re-evaluation of Knowledge Graph Completion Methodscited by 73
  10. 2020Bringing Light Into the Dark: A Large-scale Evaluation of Knowledge Graph Embedding Models Under a Unified Frameworkcited by 70
  11. 2017KBGAN: Adversarial Learning for Knowledge Graph Embeddingscited by 62
  12. 2014Question Answering with Subgraph Embeddingscited by 56
  13. 2019AutoSF: Searching Scoring Functions for Knowledge Graph Embeddingcited by 34
  14. 2015Hyperparameter Search in Machine Learningcited by 33
  15. 2020Duality-Induced Regularizer for Tensor Factorization Based Knowledge Graph Completioncited by 28
  16. 2021BORE: Bayesian Optimization by Density-Ratio Estimationcited by 26
  17. 2017On Multi-Relational Link Prediction with Bilinear Modelscited by 17

Built on by

Cited by year

Citing papers per year: 2022: 2; 2023: 3; 2024: 1; 2025: 1.

7 papers.