Resilience in Knowledge Graph Embeddings
Arnab Sharma, N'Dah Jean Kouagou, Axel-Cyrille Ngonga Ngomo

TL;DR
This paper provides a comprehensive survey on resilience in knowledge graph embeddings, addressing various challenges like noise, missing data, and adversarial attacks, and highlights the need for broader resilience research beyond robustness.
Contribution
It offers a unified definition of resilience in knowledge graph embeddings and systematically reviews existing work, identifying gaps and future research directions.
Findings
Most existing work focuses on robustness of KGE models.
Resilience encompasses generalization, consistency, adaptation, and robustness.
Survey highlights the need for broader resilience research in KGE.
Abstract
In recent years, knowledge graphs have gained interest and witnessed widespread applications in various domains, such as information retrieval, question-answering, recommendation systems, amongst others. Large-scale knowledge graphs to this end have demonstrated their utility in effectively representing structured knowledge. To further facilitate the application of machine learning techniques, knowledge graph embedding (KGE) models have been developed. Such models can transform entities and relationships within knowledge graphs into vectors. However, these embedding models often face challenges related to noise, missing information, distribution shift, adversarial attacks, etc. This can lead to sub-optimal embeddings and incorrect inferences, thereby negatively impacting downstream applications. While the existing literature has focused so far on adversarial attacks on KGE models, the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks
MethodsFocus
