Adversarial Robustness of Representation Learning for Knowledge Graphs
Peru Bhardwaj

TL;DR
This paper investigates the adversarial robustness of knowledge graph embedding models, revealing their vulnerability to data poisoning attacks and proposing novel methods to evaluate and understand these security risks.
Contribution
It introduces two new data poisoning attacks on KGE models and demonstrates their effectiveness, highlighting security vulnerabilities in knowledge graph embedding techniques.
Findings
Simple attacks can outperform complex ones in degrading model performance
KGE models are vulnerable to training data manipulation
Understanding these vulnerabilities can improve model security
Abstract
Knowledge graphs represent factual knowledge about the world as relationships between concepts and are critical for intelligent decision making in enterprise applications. New knowledge is inferred from the existing facts in the knowledge graphs by encoding the concepts and relations into low-dimensional feature vector representations. The most effective representations for this task, called Knowledge Graph Embeddings (KGE), are learned through neural network architectures. Due to their impressive predictive performance, they are increasingly used in high-impact domains like healthcare, finance and education. However, are the black-box KGE models adversarially robust for use in domains with high stakes? This thesis argues that state-of-the-art KGE models are vulnerable to data poisoning attacks, that is, their predictive performance can be degraded by systematically crafted…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning
