| Challenge: | Knowledge graphs are incomplete with many facts missing, causing performance bottlenecks in many applications. |
| Approach: | They propose a general multi-hop reasoning task that can be formulated as a search process and can be extended to long-distance reasoning scenarios. |
| Outcome: | The proposed model improves on baselines in short and long distance reasoning scenarios. |
Similar Papers
MCMH: Learning Multi-Chain Multi-Hop Rules for Knowledge Graph Reasoning (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing work on knowledge graphs infers a missing relationship between entities with a multi-hop rule . Empirical results show that our multi-chain multi-homing (MCMH) rules yield superior results compared to the standard single-chain approaches. |
| Approach: | They propose to use a generalized form of multi-hop rules to learn generalized rules efficiently . they propose to select a small set of relation chains as a rule and evaluate confidence . |
| Outcome: | The proposed method outperforms the existing methods and the existing frameworks. |
Recurrent One-Hop Predictions for Reasoning over Knowledge Graphs (C18-1)
Copied to clipboard
| Challenge: | Large scale knowledge graphs (KGs) such as Freebase are generally incomplete. |
| Approach: | They propose a model that predicts entities at each step of mh-KB paths . the model is based on recurrent neural networks and vector representations of entities and relations . |
| Outcome: | The proposed models show state-of-the-art for two important multi-hop KG reasoning tasks. |
Dynamic Anticipation and Completion for Multi-Hop Reasoning over Sparse Knowledge Graph (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing reasoning methods for sparse KGs are incomplete and lack of evidential paths to target entities makes multi-hop reasoning difficult. |
| Approach: | They propose a multi-hop reasoning model over sparse KGs to solve this problem . they use latent prediction of embedding-based models to make the model perform more potential path search over sparses . |
| Outcome: | The proposed method outperforms state-of-the-art models on five datasets from Freebase, NELL and Wikidata. |
Can We Guide a Multi-Hop Reasoning Language Model to Incrementally Learn at Each Single-Hop? (2022.coling-1)
Copied to clipboard
| Challenge: | Recent developments have shown that pre-trained language models are effective soft reasoners over language. |
| Approach: | They propose to model multi-hop reasoning process as a sequence of explicit single-hop steps. |
| Outcome: | The proposed model improves on multiple-choice question answering and reading comprehension with 68.4% and 16.0% w.r.t. classic PLMs. |
Seemingly Plausible Distractors in Multi-Hop Reasoning: Are Large Language Models Attentive Readers? (2024.emnlp-main)
Copied to clipboard
| Challenge: | State-of-the-art Large Language Models (LLMs) are accredited with a number of different capabilities, including reading comprehension, mathematical and reasoning skills, and possessing scientific knowledge. |
| Approach: | They propose a benchmark to generate seemingly plausible multi-hop reasoning chains that ultimately lead to incorrect answers. |
| Outcome: | The proposed model circumvents the reasoning requirement but in subtle ways . it shows that it is more difficult to generate plausible alternatives . |
Do Multi-hop Readers Dream of Reasoning Chains? (D19-58)
Copied to clipboard
| Challenge: | Existing models for multihop reasoning are limited in their performance . multi-hop reasoning requires the ability to gather information from multiple passages . |
| Approach: | They propose a method that provides the full reasoning chain of multiple passages instead of just one final passage where the answer appears. |
| Outcome: | The proposed model improves on existing models by providing the full reasoning chain of multiple passages instead of just one final passage where the answer appears. |
Do Large Language Models Latently Perform Multi-Hop Reasoning? (2024.acl-long)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) latently perform multi-hop reasoning with complex prompts such as "The mother of the singer of ‘Superstition’ is". |
| Approach: | They examine whether Large Language Models (LLMs) latently perform multi-hop reasoning with complex prompts such as "The mother of the singer of ‘Superstition’ is". |
| Outcome: | The proposed model can latently perform multi-hop reasoning with complex prompts such as "The mother of the singer of ‘Superstition’ is". |
Multi-Hop Knowledge Graph Reasoning with Reward Shaping (D18-1)
Copied to clipboard
| Challenge: | Multi-hop reasoning is an effective approach for query answering over incomplete knowledge graphs (KGs). |
| Approach: | They propose to adopt a pretrained one-hop embedding model to estimate reward of unobserved facts and to force agents to explore diverse set of paths using randomly generated edge masks. |
| Outcome: | The proposed model reduces false negative supervision and counters spurious search trajectories by forcing the agent to explore a diverse set of paths using randomly generated edge masks. |
Low-Resource Generation of Multi-hop Reasoning Questions (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods to generate valid and fluent questions from text are limited and insufficient for training. |
| Approach: | They propose to generate multi-hop reasoning questions from the raw text in a low resource circumstance by deducing over multiple relations on several sentences in the text. |
| Outcome: | The proposed model can be applied to the task of machine reading comprehension and achieve significant performance improvements. |
LOG: A Local-to-Global Optimization Approach for Retrieval-based Explainable Multi-Hop Question Answering (2025.coling-main)
Copied to clipboard
| Challenge: | Existing approaches to multi-hop question answering emphasize single-step and multi-step iterative decomposition or retrieval, which are susceptible to failure in long-chain reasoning due to the progressive accumulation of erroneous information. |
| Approach: | They propose a Local-tO-Global optimized retrieval method to discover more beneficial information and improve tuplet objective loss. |
| Outcome: | The proposed method outperforms state-of-the-art models and significantly improves multi-hop reasoning. |