Challenge: Existing Key-value Memory Neural Networks are effective for shallow reasoning over documents . but extending them to Knowledge Based Question Answering is not trivial .
Approach: They propose a mechanism to enable conventional KV-MemNNs models to perform interpretable reasoning for complex questions.
Outcome: The proposed solution provides better reasoning abilities on complex questions and achieves state-of-the-art performance.

Similar Papers

Explain by Evidence: An Explainable Memory-based Neural Network for Question Answering (2020.coling-main)

Copied to clipboard

Challenge: Interpretability and explainability of deep neural net models are always challenging due to their size and complexity.
Approach: They propose to design an explainable, evidence-based memory network architecture that connects current sample with seen samples and bases its decision on these samples.
Outcome: The proposed model can trace errors to training instances that might have caused errors . the proposed model achieves state-of-the-art performance on two popular datasets .
Modeling Semantics with Gated Graph Neural Networks for Knowledge Base Question Answering (C18-1)

Copied to clipboard

Challenge: Existing approaches to Knowledge Base Question Answering focus on semantic parsing . previous work focused on selecting the correct semantic relations and not on the structure of the semantic parses .
Approach: They propose to use Gated Graph Neural Networks to encode the graph structure of the semantic parse.
Outcome: The proposed approach outperforms baseline models that do not explicitly model the structure.
Bidirectional Attentive Memory Networks for Question Answering over Knowledge Bases (N19-1)

Copied to clipboard

Challenge: Existing methods for knowledge base question answering ignore subtle inter-relationships between the question and the KB.
Approach: They propose to model the two-way flow of interactions between questions and KBs using a bidirectional attentive memory network.
Outcome: The proposed method outperforms existing methods on the WebQuestions benchmark and offers better interpretability compared to baselines.
Multimodal Neural Graph Memory Networks for Visual Question Answering (2020.acl-main)

Copied to clipboard

Challenge: Visual question answering (VQA) is a new challenge for AI.
Approach: They propose a graph neural network architecture based on the recently proposed Graph Network (GN) . they generate visual features and encoded captions for an image to generate two GNs .
Outcome: The proposed model rivals the state-of-the-art models on Visual7W, VQA-v2.0, and CLEVR 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.
Memory-augmented Query Reconstruction for LLM-based Knowledge Graph Reasoning (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods that confuse tool utilization with knowledge reasoning harm readability and give rise to tool invocation hallucinations.
Approach: They propose to decouple LLM from tool invocation tasks by establishing a memory module with explicit descriptions of query statements and a query memory module to facilitate the KGQA process.
Outcome: The proposed method achieves state-of-the-art on WebQSP and CWQ benchmarks.
iQUEST: An Iterative Question-Guided Framework for Knowledge Base Question Answering (2025.acl-long)

Copied to clipboard

Challenge: Large language models suffer from factual inaccuracies in knowledge-intensive domains.
Approach: They propose a question-guided KBQA framework that iteratively decomposes complex queries into simpler sub-questions and integrates a Graph Neural Network (GNN) to look ahead and incorporate 2-hop neighbor information at each reasoning step.
Outcome: The proposed framework improves on four benchmark datasets and four LLMs.
Episodic Memory Reader: Learning What to Remember for Question Answering from Streaming Data (P19-1)

Copied to clipboard

Challenge: Existing QA methods lack scalability and performance is difficult to solve with document-level contexts.
Approach: They propose an end-to-end deep network model that sequentially reads the input contexts into an external memory while replacing memories that are less important for answering unseen questions.
Outcome: The proposed model improves on a synthetic dataset and real-world large-scale textual and video QA datasets.
Uncertainty Guided Global Memory Improves Multi-Hop Question Answering (2023.emnlp-main)

Copied to clipboard

Challenge: Transformers are used to solve multi-hop question answering tasks that require reasoning over multiple parts of a long document.
Approach: They propose a method that collects relevant information over the entire document and then combines it with local context to solve a multi-hop question answering task.
Outcome: The proposed method improves on three MHQA datasets compared to the baseline model.
Knowledge Base Question Answering via Encoding of Complex Query Graphs (D18-1)

Copied to clipboard

Challenge: Existing KBQA methods focus on simpler questions and do not work well on complex questions . a knowledge-based question answering approach is able to answer complex questions using a standard knowledge base .
Approach: They propose to encode query structure into a uniform vector representation of a question and its semantic components into .
Outcome: The proposed approach outperforms existing methods on complex questions while staying competitive on simple questions.

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