| Challenge: | Knowledge graphs encode knowledge in the form of subject-predicate-object triples, which is notoriously incomplete. |
| Approach: | They propose a framework for analyzing existing shallow knowledge graph models and their extensions. |
| Outcome: | The proposed framework shows that MuRE and ExpressivE are highly competitive . it can capture the same class of rule bases as state-of-the-art region-based embedding models. |
Similar Papers
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. |
SEEK: Segmented Embedding of Knowledge Graphs (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods for knowledge graph embedding can not make a proper trade-off between the model complexity and the model expressiveness, which makes them far from satisfactory. |
| Approach: | They propose a lightweight modeling framework that can achieve highly competitive relational expressiveness without increasing the model complexity. |
| Outcome: | The proposed framework can achieve highly competitive relational expressiveness without increasing model complexity. |
To Copy Rather Than Memorize: A Vertical Learning Paradigm for Knowledge Graph Completion (2023.acl-long)
Copied to clipboard
Rui Li, Xu Chen, Chaozhuo Li, Yanming Shen, Jianan Zhao, Yujing Wang, Weihao Han, Hao Sun, Weiwei Deng, Qi Zhang, Xing Xie
| Challenge: | Existing methods for embedding knowledge graphs implicitly memorize relation rules to infer missing links, but they are difficult to memorize due to the inherent deficiencies of such implicit memorization strategy. |
| Approach: | They propose a vertical learning paradigm that allows to explicitly copy target information from related factual triples for more accurate prediction. |
| Outcome: | The proposed model improves generalization ability and makes distant link prediction significantly easier. |
Empowering Small-Scale Knowledge Graphs: A Strategy of Leveraging General-Purpose Knowledge Graphs for Enriched Embeddings (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing approaches to augment LLMs with Knowledge Graphs (KGs) Knowledge-intensive tasks are prone to errors and require a large amount of knowledge to be understood. |
| Approach: | They propose a framework for augmenting LLMs through Knowledge Graphs (KGs) they propose KGs can be used to enhance performance in knowledge-intensive tasks . |
| Outcome: | Experimental results show that a small domain-specific KG can benefit from a performance boost in downstream tasks when linked to a substantial general-purpose KG. |
TranSHER: Translating Knowledge Graph Embedding with Hyper-Ellipsoidal Restriction (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods restrict entities on hyper-ellipsoid surfaces, resulting in suboptimal knowledge graph completion. |
| Approach: | They propose a score function that leverages relation-specific translations between head and tail entities to relax constraints on hyper-ellipsoid surfaces. |
| Outcome: | The proposed method achieves state-of-the-art performance on link prediction and generalizes well to datasets in different domains and scales. |
A Framework for Adapting Pre-Trained Language Models to Knowledge Graph Completion (2022.emnlp-main)
Copied to clipboard
| Challenge: | Recent work has demonstrated that entity representations can be extracted from pre-trained language models to develop knowledge graph completion models that are more robust to the naturally occurring sparsity found in knowledge graphs. |
| Approach: | They propose unsupervised and supervised methods to extract more informative representations from pre-trained language models to develop knowledge graph completion models. |
| Outcome: | The proposed model outperforms recent neural models in terms of performance and unsupervised processing methods. |
PairRE: Knowledge Graph Embeddings via Paired Relation Vectors (2021.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods fail to solve two major problems at the same time, leading to unsatisfactory results. |
| Approach: | They propose a model with paired vectors for each relation representation that can be adaptively adjusted to fit for different complex relations. |
| Outcome: | Experiments on two knowledge graph datasets show the proposed model can handle complex relations and encode relation patterns. |
Proceedings of the 2nd Workshop on Deep Learning Approaches for Low-Resource NLP (DeepLo 2019) (D19-61)
Copied to clipboard
| Challenge: | EMNLP-IJCNLP 2019 Workshop on Deep Learning Approaches for Low-Resource Natural Language Processing takes place in Hong Kong, China . |
| Approach: | EMNLP-IJCNLP 2019 Workshop on Deep Learning Approaches for Low-Resource Natural Language Processing takes place in Hong Kong, China . call for papers for this second workshop met with a strong response . |
| Outcome: | the EMNLP-IJCNLP 2019 workshop on deep learning approaches for low-resource natural language processing takes place in Hong Kong, China. |
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 . |