| Challenge: | Structured embeddings based on regions, densities, and orderings have gained popularity for their inductive bias towards the essential asymmetries inherent in problems such as image captioning. |
| Approach: | They propose a box lattice and accompanying probability measure to capture negative correlations over arbitrary concepts. |
| Outcome: | The proposed model can capture anti-correlation and even disjoint concepts while learning from and predicting calibrated uncertainty. |
Similar Papers
Probabilistic Box Embeddings for Uncertain Knowledge Graph Reasoning (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing methods to generalize knowledge bases model triple-level uncertainty . Existing models only model triple level uncertainty, and reasoning results lack global consistency. |
| Approach: | They propose a method to embed knowledge graphs with calibrated probabilistic semantics . they model each entity as a box and relations between two entities as affine transforms based on affinity transforms. |
| Outcome: | Experiments show that the proposed method outperforms baseline methods on confidence prediction and fact ranking. |
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. |
GammaE: Gamma Embeddings for Logical Queries on Knowledge Graphs (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for embedding knowledge graphs are difficult due to complicated query structures and incomplete graph data. |
| Approach: | They propose a probabilistic embedding model for encoding entities and queries to answer different types of FOL queries on KGs. |
| Outcome: | The proposed model outperforms state-of-the-art models on public benchmarks on three large logical query datasets. |
Knowledge Graph Embeddings using Neural Ito Process: From Multiple Walks to Stochastic Trajectories (2023.findings-acl)
Copied to clipboard
Mojtaba Nayyeri, Bo Xiong, Majid Mohammadi, Mst. Mahfuja Akter, Mirza Mohtashim Alam, Jens Lehmann, Steffen Staab
| Challenge: | Existing knowledge graph embeddings have problems expressing knowledge graphs because they model a specific relation r from a head h to tails by transitioning deterministically to exactly one other point in the embeddable space. |
| Approach: | They propose a framework that models relations between nodes by relation-specific, stochastic transitions. |
| Outcome: | The proposed framework is expressive and generic subsuming state-of-the-art models operating on low-dimensional manifolds. |
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. |
Box Embeddings: An open-source library for representation learning using geometric structures (2021.emnlp-demo)
Copied to clipboard
Tejas Chheda, Purujit Goyal, Trang Tran, Dhruvesh Patel, Michael Boratko, Shib Sankar Dasgupta, Andrew McCallum
| Challenge: | Recent studies have explored alternative vector representations with different inductive biases or capabilities. |
| Approach: | They propose a Python library that extends probabilistic box embeddings to geometric shapes and regions. |
| Outcome: | The proposed library is fully open source and compatible with PyTorch and TensorFlow. |
Insert or Attach: Taxonomy Completion via Box Embedding (2024.acl-long)
Copied to clipboard
| Challenge: | Existing taxonomy expansion methods embed concepts as vectors in Euclidean space, causing incorrectly model asymmetric relations. |
| Approach: | They propose to use box containment and center closeness to create geometric scorers that capture intrinsic relationships between concepts. |
| Outcome: | The proposed framework outperforms existing methods on four real-world datasets. |
RulE: Knowledge Graph Reasoning with Rule Embedding (2024.findings-acl)
Copied to clipboard
| Challenge: | Knowledge graph reasoning is an important problem for knowledge graphs. |
| Approach: | They propose a framework that leverages logical rules to enhance KG reasoning by learning rule embeddings from existing triplets and first-order rules. |
| Outcome: | The proposed framework outperforms existing embedding-based and rule-based methods on multiple benchmarks. |
CylE: Cylinder Embeddings for Multi-hop Reasoning over Knowledge Graphs (2023.eacl-main)
Copied to clipboard
| Challenge: | Existing geometric-based models cannot handle the logical negation operation . Existing models using cones embeddings are limited to representing queries by two-dimensional shapes . Empirical results show that the performance of multi-hop reasoning task using CylE significantly increases over state-of-the-art geometric- based models for queries without negation. |
| Approach: | They propose a geometric-based model based on three-dimensional shapes with unbounded cylinder embeddings that can handle a complete set of first-order logic operations. |
| Outcome: | Empirical results show that CylE outperforms state-of-the-art models for queries without negation. |
Concept2Box: Joint Geometric Embeddings for Learning Two-View Knowledge Graphs (2023.findings-acl)
Copied to clipboard
Zijie Huang, Daheng Wang, Binxuan Huang, Chenwei Zhang, Jingbo Shang, Yan Liang, Zhengyang Wang, Xian Li, Christos Faloutsos, Yizhou Sun, Wei Wang
| Challenge: | Existing methods to embed knowledge graphs have ignored the fact that they contain two fundamentally different views: high-level ontology-view concepts and fine-grained instance-view entities. |
| Approach: | They propose a novel geometric representation that jointly embeds the two views of a KG using dual geometric representations. |
| Outcome: | Experiments on the public DBpedia KG and a newly-created industrial KG show the proposed method works well. |