| Challenge: | Knowledge Graph Embedding (KGE) is a common approach for Knowledge Grasse (KGs) in AI tasks. |
| Approach: | They propose a new KGE training framework MED that allows one training to obtain a croppable KGE model for multiple scenarios with different dimensional needs. |
| Outcome: | The proposed framework improves low-dimensional sub-models and makes high-dimensional models retain the low-dimension sub-modells’ capacity. |
Similar Papers
Should We Use a Fixed Embedding Size? Customized Dimension Sizes for Knowledge Graph Embedding (2025.coling-main)
Copied to clipboard
| Challenge: | Knowledge Graph Embedding (KGE) aims to project entities and relations into a low-dimensional space, which is crucial for knowledge completion, fusion, and inference. |
| Approach: | They propose to embed entities and relations into a low-dimensional space to enable knowledge Graphs to be effectively used by downstream AI tasks. |
| Outcome: | The proposed framework is universal and flexible, suitable for various KGE models. |
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. |
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. |
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. |
Knowledge Graph Embedding with Hierarchical Relation Structure (D18-1)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding models embed entities and relations into latent vectors without leveraging rich information from relation structure. |
| Approach: | They extend existing KGE models to learn knowledge representations by leveraging relation structure . authors say their approach is capable of extending other KGEs . |
| Outcome: | The proposed approach can extend existing KGE models, and validates against baselines. |
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. |
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 . |
A Mutual Information Perspective on Knowledge Graph Embedding (2025.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding techniques suffer from high intra-group similarity, loss of semantic information, and insufficient inference capability, particularly in complex relation patterns such as 1-N and N-1 relations. |
| Approach: | They propose a knowledge graph embedding framework that leverages mutual information maximization to improve the semantic representation of entities and relations. |
| Outcome: | Extensive experiments on benchmark datasets demonstrate the effectiveness of the proposed method, with consistent performance improvements across various baseline models. |
KGvec2go – Knowledge Graph Embeddings as a Service (2020.lrec-1)
Copied to clipboard
| Challenge: | Currently, we serve pre-trained graph embeddings for four knowledge graphs . KGvec2go is a Web API for accessing and consuming graph embeds based on a knowledge graph . |
| Approach: | They propose a Web API for accessing and consuming graph embeddings in a light-weight fashion in downstream applications. |
| Outcome: | The proposed service can be used in machine learning, document modeling, and recommender systems. |
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. |