Name
Title | ||
|---|---|---|
Knowledge Graph Embedding by Adaptive Limit Scoring Loss Using Dynamic Weighting Strategy |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.18653/v1/2022.findings-acl.91 | FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2022) |
DocType | Volume | Citations |
Conference | Findings of the Association for Computational Linguistics: ACL 2022 | 0 |
PageRank | References | Authors |
0.34 | 0 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jinfa Yang | 1 | 0 | 1.01 |
| Xianghua Ying | 2 | 221 | 23.55 |
| Yongjie Shi | 3 | 1 | 5.42 |
| Xin Tong | 4 | 2 | 2.47 |
| Ruibin Wang | 5 | 0 | 1.35 |
| Taiyan Chen | 6 | 0 | 1.01 |
| Bowei Xing | 7 | 0 | 0.34 |