MulDE: Multi-teacher Knowledge Distillation for Low-dimensional Knowledge Graph Embeddings
원문 초록
Link prediction based on knowledge graph embeddings (KGE) aims to predict new triples to automatically construct knowledge graphs (KGs). However, recent KGE models achieve performance improvements by excessively increasing the embedding dimensions, which may cause enormous training costs and require more storage space. In this paper, instead of training high-dimensional models, we propose MulDE, a novel knowledge distillation framework, which includes multiple low-dimensional hyperbolic KGE models as teachers and two student components, namely Junior and Senior. Under a novel iterative distillation strategy, the Junior component, a low-dimensional KGE model, asks teachers actively based on its preliminary prediction results, and the Senior component integrates teachers' knowledge adaptively to train the Junior component based on two mechanisms: relation-specific scaling and contrast attention. The experimental results show that MulDE can effectively improve the performance and training speed of low-dimensional KGE models. The distilled 32-dimensional model is competitive compared to the state-of-the-art high-dimensional methods on several widely-used datasets.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Predicate-Conditional Conformalized Answer Sets for Knowledge Graph Embeddings
QuatE-D: A Distance-Based Quaternion Model for Knowledge Graph Embedding
On Large-scale Evaluation of Embedding Models for Knowledge Graph Completion
Predicting missing annotations in Gene Ontology with Knowledge Graph Embeddings and True Path Rule
Parallel Training of Knowledge Graph Embedding Models: A Comparison of Techniques
Knowledge Graph Embedding via Graph Attenuated Attention Networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.