BAG: Bi-directional Attention Entity Graph Convolutional Network for Multi-hop Reasoning Question Answering (N19-1)
Copied to clipboard
| Challenge: | Existing datasets for question answering and machine comprehension (MC) are limited to a single paragraph, or even part of it. |
| Approach: | They propose a bi-directional Attention Entity Graph Convolutional Network (BAG) that leverages relationships between nodes in an entity graph and attention information between a query and the entity graph to generate a prediction. |
| Outcome: | Experimental results show that the proposed network achieves state-of-the-art accuracy on the QAngaroo WIKIHOP dataset. |
Similar Papers
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. |
Multi-hop Reading Comprehension across Multiple Documents by Reasoning over Heterogeneous Graphs (P19-1)
Copied to clipboard
| Challenge: | Existing models to tackle multi-hop reading comprehension (RC) are focusing on a single document or paragraph, but they lack the ability to do reasoning across multiple documents. |
| Approach: | They propose a heterogeneous document-entity graph with different types of nodes and edges to solve multi-hop RC problem. |
| Outcome: | The proposed model can do reasoning over the proposed graph with nodes representation initialized with co-attention and self-attention based context encoders. |
Entity-Aware Dependency-Based Deep Graph Attention Network for Comparative Preference Classification (2020.acl-main)
Copied to clipboard
| Challenge: | Existing approaches to comparative preference classification do not learn entity-aware representations well or use sequential modeling approaches that do not generalize well. |
| Approach: | They propose a deep-level deep-graph attention network that leverages word embeddings and syntactic information to solve a comparative preference classification problem. |
| Outcome: | The proposed model achieves state-of-the-art performance in comparative preference classification. |
Relation-Aware Question Answering for Heterogeneous Knowledge Graphs (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing retrieval-based approaches to solve multihop Knowledge Base Question Answering (KBQA) fail to utilize information from head-tail entities and the semantic connection between relations to enhance the information capturing of relations in KGs. |
| Approach: | They propose to use a dual relation graph to find the answer entity in a knowledge graph . they use primal entity graph reasoning, dual relation grafitment and interaction . |
| Outcome: | The proposed approach achieves significant performance gain over the prior state-of-the-art on two public datasets, WebQSP and CWQ. |
Graph Enhanced Dual Attention Network for Document-Level Relation Extraction (2020.coling-main)
Copied to clipboard
| Challenge: | Document-level relation extraction requires inter-sentence reasoning capabilities to capture local and global contextual information for multiple relation facts. |
| Approach: | They propose to characterize the interaction between sentences and potential relation instances via a Graph Enhanced Dual Attention network (GEDA) . they also propose a simple yet effective regularizer based on the natural duality of the S2R and R2S attentions, whose weights are also supervised by the supporting evidence of relation instances during training. |
| Outcome: | The proposed model achieves competitive performance on an existing large-scale dataset while the predictions can be interpretable and easily observed. |
Aligned Dual Channel Graph Convolutional Network for Visual Question Answering (2020.acl-main)
Copied to clipboard
| Challenge: | Existing graph-based methods focus only on relations between objects in an image and neglect the importance of syntactic dependency relations between words. |
| Approach: | They propose a dual channel graph convolutional network to capture relations between objects in an image and syntactic dependency relations between words in a question. |
| Outcome: | The proposed model achieves comparable performance with the state-of-the-art approaches. |
Dual Attention Network for Cross-lingual Entity Alignment (2020.coling-main)
Copied to clipboard
| Challenge: | Experimental results on three real-world cross-lingual entity alignment datasets have shown the effectiveness of DAEA. |
| Approach: | They propose a dual attention network for cross-lingual entity alignment . they use relation-aware graph attention and hierarchical attention to solve this problem . |
| Outcome: | The proposed approach can be applied to three real-world cross-lingual entity alignment datasets. |
Question Directed Graph Attention Network for Numerical Reasoning over Text (2020.emnlp-main)
Copied to clipboard
Kunlong Chen, Weidi Xu, Xingyi Cheng, Zou Xiaochuan, Yuyu Zhang, Le Song, Taifeng Wang, Yuan Qi, Wei Chu
| Challenge: | Numerical reasoning requires both natural language understanding and arithmetic computation. |
| Approach: | They propose a graph representation for the context of the passage and question needed for numerical reasoning. |
| Outcome: | The proposed model achieves remarkable results in benchmark datasets such as DROP. |
Dynamically Fused Graph Network for Multi-hop Reasoning (P19-1)
Copied to clipboard
| Challenge: | Text-based question answering (TBQA) has been studied extensively in recent years. |
| Approach: | They propose a Dynamically Fused Graph Network to answer questions requiring multiple scattered evidence and reasoning over them. |
| Outcome: | The proposed method achieves competitive results on a public TBQA dataset and produces interpretable reasoning chains. |
SEARCH-R: Structured Entity-Aware Retrieval with Chain-of-Reasoning Navigator for Multi-hop Question Answering (2026.findings-acl)
Copied to clipboard
FU Yuqing, Yimin Deng, Wanyu Wang, Yuhao Wang, Yejing Wang, Hongshi Liu, Yiqi Wang, Xiao Han, Maolin Wang, Guoshuai Zhao, Yi Chang, Xiangyu Zhao
| Challenge: | Existing approaches to multi-hop question answering lack effective control over reasoning paths, leading to astray results. |
| Approach: | They propose a framework for multi-hop question answering that trains an end-to-end reasoning path navigator to provide a powerful sub-question decomposer by fine-tuning the Llama3.1-8B model. |
| Outcome: | The proposed framework trains an end-to-end reasoning path navigator . it is able to provide a powerful sub-question decomposer by fine-tuning the Llama3.1-8B model . |