Adversarial Attacks on Knowledge Graph Embeddings via Instance Attribution Methods
Despite the widespread use of Knowledge Graph Embeddings (KGE), little is known about the security vulnerabilities that might disrupt their intended behaviour. We study data poisoning attacks against KGE models for link prediction. These attacks craft adversarial additions or deletions at training time to cause model failure at test time. To select adversarial deletions, we propose to use the model-agnostic instance attribution methods from Interpretable Machine Learning, which identify the training instances that are most influential to a neural model's predictions on test instances. We use these influential triples as adversarial deletions. We further propose a heuristic method to replace one of the two entities in each influential triple to generate adversarial additions. Our experiments show that the proposed strategies outperform the state-of-art data poisoning attacks on KGE models and improve the MRR degradation due to the attacks by up to 62% over the baselines.
Code (1)
Tasks
Data PoisoningInterpretable Machine LearningKnowledge Graph EmbeddingsLink PredictionSimilar Papers 제목 키워드 기반
BadSKP: Backdoor Attacks on Knowledge Graph-Enhanced LLMs with Soft Prompts
Recent knowledge graph (KG)-enhanced large language models (LLMs) move beyond purely textual knowledge augmentation by encoding retrieved subgraphs into continuous soft prompts via graph neural networks, introducing a gr…
Adversarial Robustness of Representation Learning for Knowledge Graphs
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 fact…
Adversarial RobustnessData PoisoningDecision MakingKnowledge Graph Embeddings+2Untargeted Adversarial Attack on Knowledge Graph Embeddings
Knowledge graph embedding (KGE) methods have achieved great success in handling various knowledge graph (KG) downstream tasks. However, KGE methods may learn biased representations on low-quality KGs that are prevalent i…
Adversarial AttackGraph EmbeddingKnowledge Graph EmbeddingKnowledge Graph Embeddings+1Adversarial Attacks on Node Embeddings via Graph Poisoning
The goal of network representation learning is to learn low-dimensional node embeddings that capture the graph structure and are useful for solving downstream tasks. However, despite the proliferation of such methods, th…
Representation LearningAdversarial Attacks on Neural Networks for Graph Data
Deep learning models for graphs have achieved strong performance for the task of node classification. Despite their proliferation, currently there is no study of their robustness to adversarial attacks. Yet, in domains w…
General ClassificationNode Classification