Neural-based Mixture Probabilistic Query Embedding for Answering FOL queries on Knowledge Graphs (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to embed entities and first-order logical queries in a vector space are often violated in real applications and limit their performance. |
| Approach: | They propose a Neural-based Mixture Probabilistic Query Embedding Model that embeds entities and first-order logical queries in a vector space. |
| Outcome: | The proposed model outperforms state-of-the-art methods on benchmark datasets. |
Similar Papers
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. |
SConE: Simplified Cone Embeddings with Symbolic Operators for Complex Logical Queries (2023.findings-acl)
Copied to clipboard
| Challenge: | Current geometric-based methods depend on the neural approach to model FOL operators . empirical evidence for explainability is challenging . |
| Approach: | They propose to model conjunction operators using a symbolic modeling approach . they propose to emphasize the essential role of relation projection operator . |
| Outcome: | The proposed method improves answering complex logical queries over previous models. |
Query2Triple: Unified Query Encoding for Answering Diverse Complex Queries over Knowledge Graphs (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Complex Query Answering (CQA) is a challenge task of Knowledge Graphs due to incompleteness of KGs. |
| Approach: | They propose a query embedding approach that decouples the training for simple and complex queries. |
| Outcome: | The proposed approach decouples training for simple and complex queries and achieves state-of-the-art performance over three public benchmarks. |
Query2Particles: Knowledge Graph Reasoning with Particle Embeddings (2022.findings-naacl)
Copied to clipboard
| Challenge: | Existing methods to answer complex logical queries on incomplete knowledge graphs with missing edges are needed to solve the problem. |
| Approach: | They propose a query embedding method that encodes queries and entities to the same embeddable space and then selects the answer entities based on similarities . |
| Outcome: | The proposed method can answer complex logical queries on incomplete knowledge graphs with missing edges. |
EEE-QA: Exploring Effective and Efficient Question-Answer Representations (2024.lrec-main)
Copied to clipboard
| Challenge: | Current approaches to question answering rely on pre-trained language models like RoBERTa. |
| Approach: | They propose a pooling approach that embeds all answer candidates with the question . they also propose enabling cross-reference between answer choices . |
| Outcome: | The proposed methods improve throughput and memory efficiency with little sacrifice in performance. |
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 . |
Alignment over Heterogeneous Embeddings for Question Answering (N19-1)
Copied to clipboard
| Challenge: | Existing approaches for non-factoid question answering are based on heterogeneous embeddings that model text at different levels of abstraction. |
| Approach: | They propose a fast, mostly-unsupervised approach for non-factoid question answering called Alignment over Heterogeneous Embeddings (AHE) it aligns each word in the question and candidate answer with the most similar word in retrieved supporting paragraph and a meta-classifier that learns how much to trust the predictions over each representation. |
| Outcome: | The proposed approach outperforms other supervised approaches on the AI2 Reasoning Challenge dataset and the WikiQA dataset. |
Program Synthesis for Complex QA on Charts via Probabilistic Grammar Based Filtered Iterative Back-Translation (2023.findings-eacl)
Copied to clipboard
Shabbirhussain Bhaisaheb, Shubham Paliwal, Rajaswa Patil, Manasi Patwardhan, Lovekesh Vig, Gautam Shroff
| Challenge: | Current chart-based Question Answering approaches address structural, visual or simple data retrieval-type questions with fixed-vocabulary answers. |
| Approach: | They employ a neural semantic parser to transform NL questions into SQL programs . they use a probabilistic context-free grammar to generate NL queries from a schema . |
| Outcome: | The proposed approach achieves State-of-the-Art (SOTA) results on reasoning-based queries. |
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. |
Retrieval-based Question Answering with Passage Expansion Using a Knowledge Graph (2024.lrec-main)
Copied to clipboard
| Challenge: | Recent advances in dense neural retrievers and language models have hindered performance, especially for less common entities and facts. |
| Approach: | They propose a multi-modal passage retrieval model that combines entity features and textual data to improve retrieval precision for less common entities. |
| Outcome: | The proposed model improves retrieval precision on less common entities and facts on common benchmarks. |