Challenge: Existing approaches for multi-hop reasoning are lacking for local graph reasoning . existing approaches neglect local semantic structures in utterances .
Approach: They propose a question-aware global-to-local graph reasoning approach that expands the canonical Interlocutor-Utterance graph by introducing a query node.
Outcome: The proposed approach outperforms existing methods on Molweni and FriendsQA.

Similar Papers

Cognitive Graph for Multi-Hop Reading Comprehension at Scale (P19-1)

Copied to clipboard

Challenge: a new framework for multi-hop reading comprehension question answering is needed to cross the chasm of reading comprehension between machine and human.
Approach: They propose a CogQA framework for multi-hop reading comprehension question answering in web-scale documents that builds a cognitive graph in an iterative process by coordinating an implicit extraction module and an explicit reasoning module.
Outcome: The proposed framework outperforms the best competitor in the hotpotQA dataset in F1 . it provides explainable reasoning paths and accurate answers, while giving accurate answers .
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.
Reading Comprehension with Graph-based Temporal-Casual Reasoning (C18-1)

Copied to clipboard

Challenge: Existing methods for reading comprehension tasks ignore semantic relations between sentences or use sliding window scanning over the words of the passage without sentence breaks.
Approach: They propose a method to integrate information from multiple sentences to answer complex questions.
Outcome: Experiments on RACE and MCTest show that the proposed approach improves state-of-the-art methods on simple factoid questions.
Question Answering by Reasoning Across Documents with Graph Convolutional Networks (N19-1)

Copied to clipboard

Challenge: Recent research in reading comprehension has focused on answering questions based on individual documents or even single paragraphs.
Approach: They propose a neural model which integrates and reasons relying on information spread within documents and across multiple documents.
Outcome: The proposed model achieves state-of-the-art on a multi-document question answering dataset, WikiHop.
Graph-Based Knowledge Integration for Question Answering over Dialogue (2020.coling-main)

Copied to clipboard

Challenge: Existing approaches for question answering over dialogue did not consider dialogue structure and background knowledge (e.g., relationships between speakers).
Approach: They propose a method which organizes a dialogue as a "relational graph" and uses edges to represent relationships between entities to encode multi-relations knowledge for reasoning.
Outcome: The proposed method is better at tackling complex questions requiring relational reasoning and defending adversarial attacks with distracting sentences.
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%.
Multi-Grained Conversational Graph Network for Retrieval-based Dialogue Systems (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods for retrieval-based dialogues concatenate all turns in the dialogue history as input, ignoring dialogue dependency and structural information between the utterances.
Approach: They propose a multi-grained conversational graph network that considers multiple levels of abstraction from dialogue histories and semantic dependencies within multi-turn dialogues for addressing.
Outcome: The proposed method improves on two benchmarks on open domain dialogues.
HetGCoT: Heterogeneous Graph-Enhanced Chain-of-Thought LLM Reasoning for Academic Question Answering (2025.findings-emnlp)

Copied to clipboard

Challenge: graph neural networks capture structured graph information, but lack integration at the reasoning level.
Approach: They propose a framework that leverages graph structural information to reason interpretable academic QA results.
Outcome: The proposed framework outperforms sota baselines on OpenAlex and DBLP datasets.
SRLGRN: Semantic Role Labeling Graph Reasoning Network (2020.emnlp-main)

Copied to clipboard

Challenge: Existing models that use context and type-matching heuristics do not provide realistic evaluation of reasoning capabilities.
Approach: They propose a graph reasoning network based on the semantic structure of the sentences to learn cross paragraph reasoning paths and find supporting facts and the answer jointly.
Outcome: The proposed network shows competitive performance on the HotpotQA distractor setting benchmark compared to the state-of-the-art models.
Question-Interlocutor Scope Realized Graph Modeling over Key Utterances for Dialogue Reading Comprehension (2023.findings-acl)

Copied to clipboard

Challenge: Compared to standard RC tasks, dialogue reading comprehension (DRC) has raised challenges because of the complex speaker information and noisy dialogue context.
Approach: They propose a new method for dialogue reading comprehension that extracts answers from dialogues by using key-utterances-extracting methods and a Question-Interlocutor Scope Realized Graph.
Outcome: The proposed method achieves state-of-the-art performance against previous works.

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