Dynamic Semantic Graph Construction and Reasoning for Explainable Multi-hop Science Question Answering

• URL: http://arxiv.org/abs/2105.11776v1
• Date: Tue, 25 May 2021 09:14:55 GMT
• Title: Dynamic Semantic Graph Construction and Reasoning for Explainable Multi-hop Science Question Answering
• Authors: Weiwen Xu, Huihui Zhang, Deng Cai and Wai Lam
• Abstract summary: We propose a new framework to exploit more valid facts while obtaining explainability for multi-hop QA. Our framework contains three new ideas: (a) tt AMR-SG, an AMR-based Semantic Graph, constructed by candidate fact AMRs to uncover any hop relations among question, answer and multiple facts, (b) a novel path-based fact analytics approach exploiting tt AMR-SG to extract active facts from a large fact pool to answer questions, and (c) a fact-level relation modeling leveraging graph convolution network (GCN) to guide the reasoning process.
• Score: 50.546622625151926
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Knowledge retrieval and reasoning are two key stages in multi-hop question answering (QA) at web scale. Existing approaches suffer from low confidence when retrieving evidence facts to fill the knowledge gap and lack transparent reasoning process. In this paper, we propose a new framework to exploit more valid facts while obtaining explainability for multi-hop QA by dynamically constructing a semantic graph and reasoning over it. We employ Abstract Meaning Representation (AMR) as semantic graph representation. Our framework contains three new ideas: (a) {\tt AMR-SG}, an AMR-based Semantic Graph, constructed by candidate fact AMRs to uncover any hop relations among question, answer and multiple facts. (b) A novel path-based fact analytics approach exploiting {\tt AMR-SG} to extract active facts from a large fact pool to answer questions. (c) A fact-level relation modeling leveraging graph convolution network (GCN) to guide the reasoning process. Results on two scientific multi-hop QA datasets show that we can surpass recent approaches including those using additional knowledge graphs while maintaining high explainability on OpenBookQA and achieve a new state-of-the-art result on ARC-Challenge in a computationally practicable setting.

Related papers

• Efficient Parallel Multi-Hop Reasoning: A Scalable Approach for Knowledge Graph Analysis [0.0]
  Multi-hop reasoning (MHR) is a critical function in various applications. This paper focuses on optimizing MHR for time efficiency on large-scale graphs. We introduce a novel parallel algorithm that harnesses domain-specific learned embeddings.
  arXiv  Detail & Related papers  (2024-06-11T21:12:34Z)
• FedCQA: Answering Complex Queries on Multi-Source Knowledge Graphs via Federated Learning [55.02512821257247]
  Complex logical query answering is a challenging task in knowledge graphs (KGs) Recent approaches are proposed to represent KG entities into embedding vectors and find answers to logical queries from the KGs. It remains unknown how to answer queries on multi-source KGs.
  arXiv  Detail & Related papers  (2024-02-22T14:57:44Z)
• Leveraging Structured Information for Explainable Multi-hop Question Answering and Reasoning [14.219239732584368]
  In this work, we investigate constructing and leveraging extracted semantic structures (graphs) for multi-hop question answering. Empirical results and human evaluations show that our framework: generates more faithful reasoning chains and substantially improves the QA performance on two benchmark datasets.
  arXiv  Detail & Related papers  (2023-11-07T05:32:39Z)
• Towards Graph-hop Retrieval and Reasoning in Complex Question Answering over Textual Database [15.837457557803507]
  Graph-Hop is a novel multi-chains and multi-hops retrieval and reasoning paradigm in complex question answering. We construct a new benchmark called ReasonGraphQA, which provides explicit and fine-grained evidence graphs for complex questions.
  arXiv  Detail & Related papers  (2023-05-23T16:28:42Z)
• UniKGQA: Unified Retrieval and Reasoning for Solving Multi-hop Question Answering Over Knowledge Graph [89.98762327725112]
  Multi-hop Question Answering over Knowledge Graph(KGQA) aims to find the answer entities that are multiple hops away from the topic entities mentioned in a natural language question. We propose UniKGQA, a novel approach for multi-hop KGQA task, by unifying retrieval and reasoning in both model architecture and parameter learning.
  arXiv  Detail & Related papers  (2022-12-02T04:08:09Z)
• Exploiting Hybrid Semantics of Relation Paths for Multi-hop Question Answering Over Knowledge Graphs [31.088325888508137]
  This paper proposes improving multi-hop KGQA by exploiting relation paths' hybrid semantics. We integrate explicit textual information and implicit KG structural features of relation paths based on a novel rotate-and-scale entity link prediction framework.
  arXiv  Detail & Related papers  (2022-09-02T08:07:37Z)
• VQA-GNN: Reasoning with Multimodal Knowledge via Graph Neural Networks for Visual Question Answering [79.22069768972207]
  We propose VQA-GNN, a new VQA model that performs bidirectional fusion between unstructured and structured multimodal knowledge to obtain unified knowledge representations. Specifically, we inter-connect the scene graph and the concept graph through a super node that represents the QA context. On two challenging VQA tasks, our method outperforms strong baseline VQA methods by 3.2% on VCR and 4.6% on GQA, suggesting its strength in performing concept-level reasoning.
  arXiv  Detail & Related papers  (2022-05-23T17:55:34Z)
• Modeling Multi-hop Question Answering as Single Sequence Prediction [88.72621430714985]
  We propose a simple generative approach (PathFid) that extends the task beyond just answer generation. PathFid explicitly models the reasoning process to resolve the answer for multi-hop questions. Our experiments demonstrate that PathFid leads to strong performance gains on two multi-hop QA datasets.
  arXiv  Detail & Related papers  (2022-05-18T21:57:59Z)
• Exploiting Reasoning Chains for Multi-hop Science Question Answering [51.86289192292466]
  Our framework is capable of performing explainable reasoning without the need of any corpus-specific annotations. A textitChain-aware loss, concerning both local and global chain information, is also designed to enable the generated chains to serve as distant supervision signals.
  arXiv  Detail & Related papers  (2021-09-07T07:22:07Z)
• Scalable Multi-Hop Relational Reasoning for Knowledge-Aware Question Answering [35.40919477319811]
  We propose a novel knowledge-aware approach that equips pre-trained language models with a multi-hop relational reasoning module. It performs multi-hop, multi-relational reasoning over subgraphs extracted from external knowledge graphs. It unifies path-based reasoning methods and graph neural networks to achieve better interpretability and scalability.
  arXiv  Detail & Related papers  (2020-05-01T23:10:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.