Sequence-to-Sequence Knowledge Graph Completion and Question Answering (2022.acl-long)
Copied to clipboard
| Challenge: | Knowledge graph embedding (KGE) models represent each entity and relation of a knowledge graph (KG) with low-dimensional embeddable vectors. |
| Approach: | They propose to use an off-the-shelf encoder-decoder Transformer model to generate a knowledge graph embedding model that can be used for KG link prediction and incomplete KG question answering. |
| Outcome: | The proposed model outperforms baselines on multiple large-scale datasets without extensive hyperparameter tuning. |
Similar Papers
Knowledge Graph Embedding Compression (2020.acl-main)
Copied to clipboard
| Challenge: | Knowledge graph (KG) embedding techniques that learn continuous embedds of entities and relations consume a large amount of storage and memory. |
| Approach: | They propose a method that compresses the KG embedding layer by representing each entity in the KA as a vector of discrete codes and then composes the embeddables from these codes. |
| Outcome: | The proposed approach achieves 50-1000x compression of embeddings with a minor loss in performance on standard KG embeddable evaluations and retains the ability to perform reasoning tasks such as KG inference. |
MEKER: Memory Efficient Knowledge Embedding Representation for Link Prediction and Question Answering (2022.acl-srw)
Copied to clipboard
| Challenge: | Existing methods to embed learning use a standard Neural Networks (NN) backward mechanism, duplicating its memory consumption. |
| Approach: | They propose a memory-efficient KG embedding model that embeds knowledge graphs as 3rd-order binary tensors. |
| Outcome: | The proposed model yields comparable performance on link prediction and KG-based question answering tasks. |
Improving Knowledge Graph Embedding Using Simple Constraints (P18-1)
Copied to clipboard
| Challenge: | Recent efforts focused on designing more complicated models or incorporating extra information beyond triples. |
| Approach: | They propose to use non-negativity constraints on entity representations and approximate entailment constraints on relation representations to improve KG embedding. |
| Outcome: | The proposed model outperforms baseline models on WordNet, Freebase, and DBpedia. |
TranS: Transition-based Knowledge Graph Embedding with Synthetic Relation Representation (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Knowledge graph embedding (KGE) is a computational approach to learn continuous vector representations of relations and entities in knowledge graphs. |
| Approach: | They propose a transition-based method to learn continuous vector representations of relations and entities in knowledge graph (KG) it replaces a single relation vector in the relation part with a synthetic relation representation with entity-relation interactions to solve these problems. |
| Outcome: | The proposed method achieves state-of-the-art on a large knowledge graph dataset. |
Improving Multi-hop Question Answering over Knowledge Graphs using Knowledge Base Embeddings (2020.acl-main)
Copied to clipboard
| Challenge: | Existing multi-hop KGQA methods impose heuristic neighborhood limits, which often make it much harder to answer the input NL question. |
| Approach: | They propose to use knowledge Graphs (KG) to answer natural language queries over the KG. |
| Outcome: | The proposed method is particularly effective in performing multi-hop KGQA over sparse KGs. |
Pretrain-KGE: Learning Knowledge Representation from Pretrained Language Models (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding models suffer from limited knowledge representation due to sparse and noisy dataset annotations. |
| Approach: | They propose to use pretrained language models to enhance knowledge representation by leveraging world knowledge from pretrained models. |
| Outcome: | Extensive experiments show that the proposed framework can improve results over existing models. |
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 . |
Knowledge GeoGebra: Leveraging Geometry of Relation Embeddings in Knowledge Graph Completion (2024.lrec-main)
Copied to clipboard
| Challenge: | Knowledge graph embedding models are limited to the algebra and geometry of the entity embeddable space, the algebra of the relation embeddible space, and the interaction between relation and entity embeds. |
| Approach: | They propose a method that leverages the geometry of relation embeddings and generalizes it with the concept of a butterfly curve, consecutively. |
| Outcome: | The proposed model outperforms existing models on the WN18RR, FB15K-237 and YouTube benchmarks. |
MQuinE: a Cure for “Z-paradox” in Knowledge Graph Embedding (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding models suffer from Z-paradox, a deficiency in expressiveness . Embedding-based models map each entity and relation into a vector or matrix . |
| Approach: | They propose a new knowledge graph embedding model that does not suffer from Z-paradox while preserves strong expressiveness to model various relation patterns with theoretical justification. |
| Outcome: | The proposed model outperforms existing models on link prediction tasks while maintaining strong expressiveness. |
Connecting Embeddings for Knowledge Graph Entity Typing (2020.acl-main)
Copied to clipboard
| Challenge: | Existing knowledge graphs suffer from incompleteness and miss important facts, jeopardizing their usefulness in downstream tasks such as question answering. |
| Approach: | They propose a method which is trained by utilizing local typing knowledge from existing entity type assertions and global triple knowledge in KGs. |
| Outcome: | The proposed model favors inferences that agree with both entity type instances and triple knowledge in KGs. |