UHop: An Unrestricted-Hop Relation Extraction Framework for Knowledge-Based Question Answering (N19-1)
Copied to clipboard
| Challenge: | Existing work restricts search from one entity to another to the maximum number of hops . a knowledge graph is a powerful graph structure that encodes knowledge to save and organize it . |
| Approach: | They propose an unrestricted-hop framework which relaxes the restriction by using a transition-based search framework. |
| Outcome: | The proposed framework performs well with state-of-the-art models and is competitive without exhaustive searches. |
Similar Papers
Simple yet Effective Bridge Reasoning for Open-Domain Multi-Hop Question Answering (D19-58)
Copied to clipboard
| Challenge: | Existing work on open-domain multi-hop question answering relies on off-the-shelf information retrieval techniques to retrieve answer passages. |
| Approach: | They propose a new subproblem for open-domain multi-hop question answering . they aim to recognize the anchor from a set of start passages with a reading comprehension model . |
| Outcome: | The proposed method significantly improves the baseline method on the open-domain hotpotQA benchmark. |
Scalable Multi-Hop Relational Reasoning for Knowledge-Aware Question Answering (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing work on augmenting question answering models with external knowledge (e.g., knowledge graphs) lacks transparency into the model’s prediction rationale. |
| Approach: | They propose a knowledge-aware approach that equips pre-trained language models with a multi-hop relational reasoning module that performs multi-relational reasoning over subgraphs extracted from external knowledge graphs. |
| Outcome: | The proposed model performs multi-hop, multi-relational reasoning over subgraphs extracted from external knowledge graphs. |
Exploiting Hybrid Semantics of Relation Paths for Multi-hop Question Answering over Knowledge Graphs (2022.coling-1)
Copied to clipboard
| Challenge: | Existing approaches to answer natural language questions on knowledge graphs (KGQA) use large-scale entity-related text corpus or knowledge graph embeddings as auxiliary information to facilitate answer selection. |
| Approach: | They propose to integrate explicit textual information and implicit KG structural features of relation paths into a novel rotate-and-scale entity link prediction framework. |
| Outcome: | The proposed method is superior to existing methods on three KGQA datasets and shows that it can be used to identify answer entities. |
TransferNet: An Effective and Transparent Framework for Multi-hop Question Answering over Relation Graph (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing models infer the answer by predicting the sequential relation path or aggregating the hidden graph features. |
| Approach: | They propose a model which jumps between entities at multiple steps . they demonstrate that TransferNet surpasses state-of-the-art models by a large margin . |
| Outcome: | The proposed model surpasses state-of-the-art models on MetaQA and on other datasets. |
An Interpretable Reasoning Network for Multi-Relation Question Answering (C18-1)
Copied to clipboard
| Challenge: | Existing models for multi-relation question answering require elaborated analysis and reasoning over multiple fact triples in knowledge base. |
| Approach: | They propose a model that employs an interpretable hop-by-hop reasoning process for question answering . it decides which part of an input question should be analyzed at each hop and then drives next-hop thinking . |
| Outcome: | The proposed model yields state-of-the-art results on two datasets. |
Relation-Aware Question Answering for Heterogeneous Knowledge Graphs (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing retrieval-based approaches to solve multihop Knowledge Base Question Answering (KBQA) fail to utilize information from head-tail entities and the semantic connection between relations to enhance the information capturing of relations in KGs. |
| Approach: | They propose to use a dual relation graph to find the answer entity in a knowledge graph . they use primal entity graph reasoning, dual relation grafitment and interaction . |
| Outcome: | The proposed approach achieves significant performance gain over the prior state-of-the-art on two public datasets, WebQSP and CWQ. |
Multi-Hop Paragraph Retrieval for Open-Domain Question Answering (P19-1)
Copied to clipboard
| Challenge: | Existing methods for textual question answering are capable of outperforming humans on certain tasks. |
| Approach: | They propose a method for retrieving multiple supporting paragraphs from a large knowledge base. |
| Outcome: | The proposed method achieves state-of-the-art over two well-known datasets, SQuAD-Open and HotpotQA, which serve as benchmarks for the proposed method. |
Multi-hop Evidence Retrieval for Cross-document Relation Extraction (2023.findings-acl)
Copied to clipboard
| Challenge: | Relation Extraction (RE) is a task that seeks to identify the relation of entities described according to some context. |
| Approach: | They propose a multi-hop evidence retrieval method based on evidence path mining and ranking to support cross-document relation extraction. |
| Outcome: | The proposed method acquires cross-document evidence and boosts performance in both closed and open environments. |
Chain-of-Relations: Faithful and Efficient LLM Reasoning over Knowledge Graphs via Relation-Centric Exploration (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods adopt entity-centric exploration that incrementally constructs reasoning paths by selecting and connecting intermediate entities. |
| Approach: | They propose to use relation-centric exploration to construct reasoning paths by selecting and connecting intermediate entities and to reduce the dependence on entity completeness. |
| Outcome: | The proposed method outperforms baselines on three benchmark datasets in both F1 score and KG-grounded Rate. |
HOLMES: Hyper-Relational Knowledge Graphs for Multi-hop Question Answering using LLMs (2024.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to answer multi-hop questions are query-agnostic and the extracted facts are ambiguous as they lack context. |
| Approach: | They propose to use a knowledge graph to extract query-relevant information from unstructured text. |
| Outcome: | The proposed method achieves performance improvements on two popular datasets. |