| Challenge: | Existing knowledge graph embedding techniques lack the capability to access similarities between entities and relations. |
| Approach: | They propose an adversarial learning framework to improve knowledge graph embedding models . they use one knowledge graph embedded model as a negative sample generator . |
| Outcome: | The proposed framework improves the performance of knowledge graph embedding models on a link prediction task. |
Similar Papers
Debiasing knowledge graph embeddings (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to train knowledge graph embeddings to be neutral to sensitive attributes such as gender have been shown to increase training time by a factor of eight or more. |
| Approach: | They propose a method where all embeddings are trained to be neutral to sensitive attributes such as gender by default using an adversarial loss. |
| Outcome: | The proposed method reduces training time by eightfold and improves accuracy. |
Adversarial Attacks on Knowledge Graph Embeddings via Instance Attribution Methods (2021.emnlp-main)
Copied to clipboard
| Challenge: | Knowledge Graph Embeddings (KGE) are widely used for relational learning on large scale Knowledge . however, little is known about the security vulnerabilities that might disrupt their intended behaviour. |
| Approach: | They propose to use model-agnostic instance attribution methods to select adversarial deletions and a heuristic method to replace one of the two entities in each influential triple to generate adversarials. |
| Outcome: | The proposed methods outperform the state-of-the-art data poisoning attacks on KGE models and improve the MRR degradation by up to 62% over the baselines. |
KGE-CL: Contrastive Learning of Tensor Decomposition Based Knowledge Graph Embeddings (2022.coling-1)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods ignore semantic similarity between related entities and entity-relation couples in different triples . |
| Approach: | They propose a contrastive learning framework for tensor decomposition based (TDB) KGE that can shorten the semantic distance of related entities and entity-relation couples in different triples and thus improve the performance of KGE. |
| Outcome: | The proposed method achieves 51.2% MRR, 46.8% Hits@1 on three standard KGE datasets, 37.8% MRR and 28.6% Hits @1 on FB15k-237 datasets and 59.1% MRR . |
Adversarial Attack against Cross-lingual Knowledge Graph Alignment (2021.emnlp-main)
Copied to clipboard
Zeru Zhang, Zijie Zhang, Yang Zhou, Lingfei Wu, Sixing Wu, Xiaoying Han, Dejing Dou, Tianshi Che, Da Yan
| Challenge: | Existing studies on cross-lingual entity alignment under adversarial attacks have not been conducted. |
| Approach: | They propose to use adversarial attack techniques to perturb cross-lingual entity alignment under adversarials. |
| Outcome: | The proposed model hides the attacked entities in dense regions in two KGs, and reduces the gradient vanishing issues in the process of adversarial attacks for further improving the attack effectiveness. |
Efficient and Robust Knowledge Graph Construction (2022.aacl-tutorials)
Copied to clipboard
| Challenge: | Knowledge graph construction has appealed to the NLP community but has encountered similar issues such as efficiency and robustness. |
| Approach: | They propose to introduce efficient and robust knowledge graph construction techniques and discuss their results. |
| Outcome: | This tutorial will provide an overview of the latest and ongoing techniques for efficient and robust knowledge graph construction. |
SimKGC: Simple Contrastive Knowledge Graph Completion with Pre-trained Language Models (2022.acl-long)
Copied to clipboard
| Challenge: | Text-based methods lag behind graph embedding-based approaches for knowledge graph completion (KGC) |
| Approach: | They propose three types of negatives to improve contrastive learning to improve learning efficiency. |
| Outcome: | The proposed model outperforms embedding-based methods on several benchmark datasets. |
AdvEntuRe: Adversarial Training for Textual Entailment with Knowledge-Guided Examples (P18-1)
Copied to clipboard
| Challenge: | Recent deep learning entailment systems have achieved close to human level performance on large datasets, but the problem is far from solved. |
| Approach: | They propose a knowledge-guided adversarial example generator for incorporating large lexical resources into entailment models via only a handful of rule templates and a natural language example generator that iteratively adjusts to the discriminator’s weaknesses. |
| Outcome: | The proposed methods increase accuracy by 4.7% on SciTail and 2.8% on a 1% sub-sample of SNLI. |
Adversarial Contrastive Estimation (P18-1)
Copied to clipboard
| Challenge: | Noise contrastive estimation (NCE) is a general strategy used in word embeddings and translations for knowledge graphs. |
| Approach: | They propose to augment negative sampler into mixture distribution with adversarially learned sampler and to combine it with noise contrastive estimation (NCE) they observe faster convergence and improved results on multiple metrics. |
| Outcome: | The proposed model performs better on word embeddings, order embedds and knowledge graph embeddments and faster convergence and improved results on multiple metrics. |
Highly Efficient Knowledge Graph Embedding Learning with Orthogonal Procrustes Analysis (2021.naacl-main)
Copied to clipboard
| Challenge: | Knowledge Graph Embeddings (KGEs) have been explored in recent years due to their promise for a wide range of applications. |
| Approach: | They propose a KGE framework which can reduce the training time and carbon footprint by orders of magnitudes compared with state-of-the-art approaches. |
| Outcome: | The proposed framework reduces the training time and carbon footprint by orders of magnitudes compared with state-of-the-art approaches while producing competitive performance. |
RelWalk - A Latent Variable Model Approach to Knowledge Graph Embedding (2021.eacl-main)
Copied to clipboard
| Challenge: | Existing methods for embedding entities and relations in knowledge graphs are heuristically motivated and theoretical understanding of such embeddables is underdeveloped. |
| Approach: | They extend the random walk model of word embeddings to Knowledge Graph Embeddings (KGEs) they propose a learning objective motivated by the theoretical analysis to learn KGEs from a given knowledge graph. |
| Outcome: | The proposed learning objective is motivated by the theoretical analysis to learn KGEs from a given knowledge graph. |