| 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. |
Similar Papers
Path Spuriousness-aware Reinforcement Learning for Multi-Hop Knowledge Graph Reasoning (2023.eacl-main)
Copied to clipboard
| Challenge: | Multi-hop reasoning is a common approach for query answering, but can be biased to spurious paths which coincidentally lead to the correct answer with poor explanation. |
| Approach: | They propose a method that quantitatively estimates to what extent a path is spurious by a metric called Path Spuriousness (PS) they propose KG reasoning, which infers new facts along existing paths in KGs. |
| Outcome: | The proposed model significantly improves the agent’s ability to prevent spurious paths while keeping comparable to state-of-the-art performance. |
Rule-Aware Reinforcement Learning for Knowledge Graph Reasoning (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to reason missing facts on Knowledge Graphs face with serious incompleteness due to their black-box nature. |
| Approach: | They propose a multi-hop reasoning method that injects high quality symbolic rules into the model's reasoning process and employs partially random beam search. |
| Outcome: | The proposed method outperforms existing multi-hop reasoning methods in terms of Hit@1 and MRR. |
Progressive Planning and Reinforced Reasoning: Large Language Model-Guided Multi-hop Question Answering over Knowledge Graph (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to multi-hop question answering lack effective intermediate guidance and policy networks focus on local neighborhood information, making it difficult to anticipate the long-term consequences of decisions. |
| Approach: | They propose a framework that converts decomposed sub-question sequences into stepwise decision guidance and a structure-aware lookahead policy network to enhance the agent's global state awareness and decision foresight in complex environments. |
| Outcome: | The proposed framework surpasses state-of-the-art methods while showing strong generalization. |
SCE: Semantic Consistency Enhanced Reinforcement Learning for Multi-Hop Knowledge Graph Reasoning (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to multihop reasoning fail to address the problem of spurious paths . existing approaches neglect the internal semantic consistency of the reward function . |
| Approach: | They propose a framework that incorporates semantic consistency into the reward function to guide multi-hop reasoning. |
| Outcome: | The proposed framework outperforms baseline methods and facilitates more interpretable reasoning paths. |
SQUIRE: A Sequence-to-sequence Framework for Multi-hop Knowledge Graph Reasoning (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for multi-hop knowledge graph reasoning suffer from slow and poor convergence . a transformer model can be used to learn and predict in an end-to-end fashion, giving faster convergence compared to previous methods . |
| Approach: | They propose a Sequence-to-sequence based multi-hop reasoning framework . it uses an encoder-decoder transformer structure to translate the query to a path . |
| Outcome: | The proposed framework can learn and predict in an end-to-end fashion, which gives better and faster convergence. |
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. |
Understanding and Improving Zero-shot Multi-hop Reasoning in Generative Question Answering (2022.coling-1)
Copied to clipboard
| Challenge: | Generative question answering (QA) models generate answers to complex questions, but their mechanism for doing so is still poorly understood. |
| Approach: | They decompose multi-hop questions into multiple corresponding single-hop question chains and find marked inconsistency in QA models’ answers on these pairs of ostensibly identical question chains. |
| Outcome: | The proposed models lack zero-shot multi-hop reasoning ability when trained on single-hop questions and on logical forms. |
Constraint-based Multi-hop Question Answering with Knowledge Graph (2022.naacl-industry)
Copied to clipboard
| Challenge: | Recent work addresses multi-hop KGQA, which requires reasoning across numerous edges of the KG. |
| Approach: | They propose to use KG embeddings to reduce KG sparsity by performing missing link prediction. |
| Outcome: | Empirical results show that the proposed method produces state-of-the-art results on three KGQA datasets. |
Robustifying Multi-hop QA through Pseudo-Evidentiality Training (2021.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to robustify multi-hop question answering models require expensive annotations. |
| Approach: | They propose a method to supervise answers with right reasoning chains without annotations . they compare answers confidence with and without evidence sentences to generate "pseudo-evidentiality" annotations. |
| Outcome: | The proposed model is accurate and robust in multi-hop reasoning. |
Improving Multi-hop Logical Reasoning in Knowledge Graphs with Context-Aware Query Representation Learning (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing methods rely on linear sequential operations to solve First-Order Logic queries. |
| Approach: | They propose a model-agnostic approach that fully integrates the context of the query graph. |
| Outcome: | The proposed method improves performance on two datasets by 19.5%. |