Explainable Question Answering based on Semantic Graph by Global Differentiable Learning and Dynamic Adaptive Reasoning (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing models for multi-hop Question Answering have improved the implicit reasoning ability, but the black box nature of pure neural networks has hindered the construction of explainable intelligent systems. |
| Approach: | They propose a global differentiation strategy to explore optimal reasoning paths from latent probability space and a Dynamic Adaptive Reasoner to enhance generalization of unseen questions. |
| Outcome: | The proposed method achieves 17% improvements in F1-score against BreakRC and shows better interpretability. |
Similar Papers
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. |
Locate Then Ask: Interpretable Stepwise Reasoning for Multi-hop Question Answering (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods for multi-hop reasoning ignore grounding on supporting facts of each step, which tends to generate inaccurate decompositions. |
| Approach: | They propose an interpretable stepwise reasoning framework that incorporates supporting sentences and questions at each intermediate step and utilizes the inference of the current hop for the next until reasoning out the final result. |
| Outcome: | The proposed model can boost performance and yield a better interpretable reasoning process without decomposition supervision. |
Diff-Explainer: Differentiable Convex Optimization for Explainable Multi-hop Inference (2022.tacl-1)
Copied to clipboard
| Challenge: | Existing explainable multi-hop inference models are regarded as black-boxes due to their ability to transfer linguistic and semantic information to downstream tasks, posing concerns about interpretability and transparency of their predictions. |
| Approach: | They propose a hybrid framework that integrates explicit constraints with neural architectures through differentiable convex optimization to answer and explain multi-hop questions in natural language. |
| Outcome: | The proposed framework improves performance on scientific and commonsense QA tasks while still providing structured explanations in support of its predictions. |
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. |
Neural Natural Logic Inference for Interpretable Question Answering (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing question answering models are based on textual entailment tasks . prior work has focused on QA on premise-based questions . |
| Approach: | They propose a neural-symbolic QA approach that integrates natural logic reasoning within deep learning architectures towards developing effective question answering models. |
| Outcome: | The proposed model outperforms previous work on multiple-choice science questions . it integrates natural logic reasoning within deep learning architectures to build proof paths . |
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 . |
Calibrating Trust of Multi-Hop Question Answering Systems with Decompositional Probes (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Recent work in multi-hop QA has shown that performance can be boosted by decomposing questions into simpler, single-hop questions. |
| Approach: | They propose to decompose multi-hop questions into simpler, single-hop ones to create explanations by probing a neural QA model with them. |
| Outcome: | The proposed approach can be used to generate explanations by probing a neural QA model with them. |
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. |
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. |
Intrinsic Subgraph Generation for Interpretable Graph Based Visual Question Answering (2024.lrec-main)
Copied to clipboard
| Challenge: | Visual Question Answering (VQA) is acknowledged as a challenging multi-modal task for Machine Learning (ML). |
| Approach: | They propose an interpretable approach for graph-based Visual Question Answering . their model is designed to intrinsically produce a subgraph during the question-answering process as its explanation . |
| Outcome: | The proposed model outperforms existing explainable methods on a graph-based VQA dataset. |