Performance Evaluation of Knowledge Graph Embedding Approaches under Non-adversarial Attacks
This addresses the robustness issue for AI applications like semantic search and recommenders, but it is incremental as it extends prior work on adversarial attacks to non-adversarial scenarios.
The paper tackled the problem of evaluating the robustness of Knowledge Graph Embedding (KGE) approaches under non-adversarial attacks, finding that label perturbation has a strong effect on performance, parameter perturbation has a moderate effect, and graph perturbation has a low effect across 5 algorithms and 5 datasets.
Knowledge Graph Embedding (KGE) transforms a discrete Knowledge Graph (KG) into a continuous vector space facilitating its use in various AI-driven applications like Semantic Search, Question Answering, or Recommenders. While KGE approaches are effective in these applications, most existing approaches assume that all information in the given KG is correct. This enables attackers to influence the output of these approaches, e.g., by perturbing the input. Consequently, the robustness of such KGE approaches has to be addressed. Recent work focused on adversarial attacks. However, non-adversarial attacks on all attack surfaces of these approaches have not been thoroughly examined. We close this gap by evaluating the impact of non-adversarial attacks on the performance of 5 state-of-the-art KGE algorithms on 5 datasets with respect to attacks on 3 attack surfaces-graph, parameter, and label perturbation. Our evaluation results suggest that label perturbation has a strong effect on the KGE performance, followed by parameter perturbation with a moderate and graph with a low effect.