Knowledge Graph Embedding by Adaptive Limit Scoring Loss Using Dynamic Weighting Strategy
Knowledge graph embedding aims to represent entities and relations as low-dimensional vectors, which is an effective way for predicting missing links in knowledge graphs. Designing a strong and effective loss framework is essential for knowledge graph embedding models to distinguish between correct and incorrect triplets. The classic margin-based ranking loss limits the scores of positive and negative triplets to have a suitable margin. The recently proposed Limit-based Scoring Loss independently limits the range of positive and negative triplet scores. However, these loss frameworks use equal or fixed penalty terms to reduce the scores of positive and negative sample pairs, which is inflexible in optimization. Our intuition is that if a triplet score deviates far from the optimum, it should be emphasized. To this end, we propose Adaptive Limit Scoring Loss, which simply re-weights each triplet to highlight the less-optimized triplet scores. We apply this loss framework to several knowledge graph embedding models such as TransE, TransH and ComplEx. The experimental results on link prediction and triplet classification show that our proposed method has achieved performance on par with the state of the art.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph EmbeddingKnowledge Graph EmbeddingKnowledge GraphsLink PredictionTripletSimilar Papers 제목 키워드 기반
Distance-Adaptive Quaternion Knowledge Graph Embedding with Bidirectional Rotation
Quaternion contains one real part and three imaginary parts, which provided a more expressive hypercomplex space for learning knowledge graph. Existing quaternion embedding models measure the plausibility of a triplet ei…
Graph EmbeddingKnowledge Graph CompletionKnowledge Graph EmbeddingLink Prediction+2Locally Adaptive Translation for Knowledge Graph Embedding
Knowledge graph embedding aims to represent entities and relations in a large-scale knowledge graph as elements in a continuous vector space. Existing methods, e.g., TransE and TransH, learn embedding representation by d…
Graph EmbeddingKnowledge Graph EmbeddingKnowledge GraphsTranslationHyCubE: Efficient Knowledge Hypergraph 3D Circular Convolutional Embedding
Knowledge hypergraph embedding models are usually computationally expensive due to the inherent complex semantic information. However, existing works mainly focus on improving the effectiveness of knowledge hypergraph em…
GPUhypergraph embeddingRelWalk -- A Latent Variable Model Approach to Knowledge Graph Embedding
Knowledge Graph Embedding (KGE) is the task of jointly learning entity and relation embeddings for a given knowledge graph. Existing methods for learning KGEs can be seen as a two-stage process where (a) entities and rel…
Entity EmbeddingsGraph EmbeddingKnowledge Graph EmbeddingRelation+1Efficient Relation-aware Scoring Function Search for Knowledge Graph Embedding
The scoring function, which measures the plausibility of triplets in knowledge graphs (KGs), is the key to ensure the excellent performance of KG embedding, and its design is also an important problem in the literature. …
AutoMLGraph EmbeddingKnowledge Graph EmbeddingKnowledge Graphs+1