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.

Similar Papers

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.
MMAPG: A Training-Free Framework for Multimodal Multi-hop Question Answering via Adaptive Planning Graphs (2025.emnlp-main)

Copied to clipboard

Challenge: Existing multimodal question answering models rely on sequential retrieval and reasoning, but this single-path paradigm makes them vulnerable to errors due to misleading intermediate steps.
Approach: They propose a multimodal multi-hop question answering framework guided by an Adaptive Planning Graph . they propose modality-specific strategies that dynamically adapt to distinct data types .
Outcome: The proposed framework outperforms existing models that rely on training.
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.
Triggering Multi-Hop Reasoning for Question Answering in Language Models using Soft Prompts and Random Walks (2023.findings-acl)

Copied to clipboard

Challenge: Existing methods that decompose multi-hop questions into single hop sub-questions are difficult to implement.
Approach: They propose to use random-walks to guide pre-trained language models to map multi-hop questions to random-walked paths that lead to the answer.
Outcome: The proposed methods improve on two T5 LMs.
Beyond the Answer: Advancing Multi-Hop QA with Fine-Grained Graph Reasoning and Evaluation (2025.acl-long)

Copied to clipboard

Challenge: Existing evaluations of multi-hop question answering systems focus on comparing final answers of reasoning method and given ground-truths.
Approach: They propose a "Planner-Executor-Reasoner" architecture that evaluates reasoning . they propose PER-DP and PER QA architectures that provide ground-truths .
Outcome: The proposed model improves the performance of multi-hop question answering systems.
Dynamic Semantic Graph Construction and Reasoning for Explainable Multi-hop Science Question Answering (2021.findings-acl)

Copied to clipboard

Challenge: Existing approaches suffer from low confidence when retrieving evidence facts to fill the knowledge gap and lack transparent reasoning process.
Approach: They propose a framework to exploit more valid facts while obtaining explainability for multi-hop question answering at web scale by dynamically constructing a semantic graph and reasoning over it.
Outcome: The proposed framework surpasses existing approaches while maintaining high explainability on OpenBookQA and ARC-Challenge.
A Collaborative Reasoning Framework Powered by Reinforcement Learning and Large Language Models for Complex Questions Answering over Knowledge Graph (2025.coling-main)

Copied to clipboard

Challenge: Knowledge Graph Question Answering (KGQA) aims to answer natural language questions by reasoning across multiple triples in knowledge graphs.
Approach: They propose a collaborative reasoning framework powered by RL and LLMs to answer complex questions based on the knowledge graph.
Outcome: The proposed model surpasses state-of-the-art models on four datasets.
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.
Leveraging Structured Information for Explainable Multi-hop Question Answering and Reasoning (2023.findings-emnlp)

Copied to clipboard

Challenge: Neural models, including large language models (LLMs), achieve superior performance on multi-hop question-answering tasks.
Approach: They propose to use the chain-of-thought mechanism to generate both the reasoning chain and the answer.
Outcome: Empirical results show that the proposed framework generates more faithful reasoning chains and significantly improves the QA performance on two benchmark datasets.
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.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations