Question-Answer Sentence Graph for Joint Modeling Answer Selection

• URL: http://arxiv.org/abs/2203.03549v2
• Date: Sun, 23 Apr 2023 04:01:56 GMT
• Title: Question-Answer Sentence Graph for Joint Modeling Answer Selection
• Authors: Roshni G. Iyer, Thuy Vu, Alessandro Moschitti, Yizhou Sun
• Abstract summary: We train and integrate state-of-the-art (SOTA) models for computing scores between question-question, question-answer, and answer-answer pairs. Online inference is then performed to solve the AS2 task on unseen queries.
• Score: 122.29142965960138
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This research studies graph-based approaches for Answer Sentence Selection (AS2), an essential component for retrieval-based Question Answering (QA) systems. During offline learning, our model constructs a small-scale relevant training graph per question in an unsupervised manner, and integrates with Graph Neural Networks. Graph nodes are question sentence to answer sentence pairs. We train and integrate state-of-the-art (SOTA) models for computing scores between question-question, question-answer, and answer-answer pairs, and use thresholding on relevance scores for creating graph edges. Online inference is then performed to solve the AS2 task on unseen queries. Experiments on two well-known academic benchmarks and a real-world dataset show that our approach consistently outperforms SOTA QA baseline models.

Related papers

• QUADRo: Dataset and Models for QUestion-Answer Database Retrieval [97.84448420852854]
  Given a database (DB) of question/answer (q/a) pairs, it is possible to answer a target question by scanning the DB for similar questions. We build a large scale DB of 6.3M q/a pairs, using public questions, and design a new system based on neural IR and a q/a pair reranker. We show that our DB-based approach is competitive with Web-based methods, i.e., a QA system built on top the BING search engine.
  arXiv  Detail & Related papers  (2023-03-30T00:42:07Z)
• Graph Attention with Hierarchies for Multi-hop Question Answering [19.398300844233837]
  We present two extensions to the SOTA Graph Neural Network (GNN) based model for HotpotQA. Experiments on HotpotQA demonstrate the efficiency of the proposed modifications.
  arXiv  Detail & Related papers  (2023-01-27T15:49:50Z)
• Dynamic Relevance Graph Network for Knowledge-Aware Question Answering [22.06211725256875]
  This work investigates the challenge of learning and reasoning for Commonsense Question Answering given an external source of knowledge. We propose a novel graph neural network architecture, called Dynamic Relevance Graph Network (DRGN) DRGN operates on a given KG subgraph based on the question and answers entities and uses the relevance scores between the nodes to establish new edges.
  arXiv  Detail & Related papers  (2022-09-20T18:52:05Z)
• Better Query Graph Selection for Knowledge Base Question Answering [2.367061689316429]
  This paper presents a novel approach based on semantic parsing to improve the performance of Knowledge Base Question Answering (KBQA) Specifically, we focus on how to select an optimal query graph from a candidate set so as to retrieve the answer from knowledge base (KB)
  arXiv  Detail & Related papers  (2022-04-27T01:53:06Z)
• Bilateral Cross-Modality Graph Matching Attention for Feature Fusion in Visual Question Answering [71.6781118080461]
  We propose a Graph Matching Attention (GMA) network for Visual Question Answering (VQA) task. firstly, it builds graph for the image, but also constructs graph for the question in terms of both syntactic and embedding information. Next, we explore the intra-modality relationships by a dual-stage graph encoder and then present a bilateral cross-modality graph matching attention to infer the relationships between the image and the question. Experiments demonstrate that our network achieves state-of-the-art performance on the GQA dataset and the VQA 2.0 dataset.
  arXiv  Detail & Related papers  (2021-12-14T10:01:26Z)
• Classification-Regression for Chart Comprehension [16.311371103939205]
  Chart question answering (CQA) is a task used for assessing chart comprehension. We propose a new model that jointly learns classification and regression. Our model's edge is particularly emphasized on questions with out-of-vocabulary answers.
  arXiv  Detail & Related papers  (2021-11-29T18:46:06Z)
• Joint Models for Answer Verification in Question Answering Systems [85.93456768689404]
  We build a three-way multi-classifier, which decides if an answer supports, refutes, or is neutral with respect to another one. We tested our models on WikiQA, TREC-QA, and a real-world dataset.
  arXiv  Detail & Related papers  (2021-07-09T05:34:36Z)
• Graph-Based Tri-Attention Network for Answer Ranking in CQA [56.42018099917321]
  We propose a novel graph-based tri-attention network, namely GTAN, to generate answer ranking scores. Experiments on three real-world CQA datasets demonstrate GTAN significantly outperforms state-of-the-art answer ranking methods.
  arXiv  Detail & Related papers  (2021-03-05T10:40:38Z)
• A Hierarchical Reasoning Graph Neural Network for The Automatic Scoring of Answer Transcriptions in Video Job Interviews [14.091472037847499]
  We propose a Hierarchical Reasoning Graph Neural Network (HRGNN) for the automatic assessment of question-answer pairs. We employ a semantic-level reasoning graph attention network to model the interaction states of the current QA session. Finally, we propose a gated recurrent unit encoder to represent the temporal question-answer pairs for the final prediction.
  arXiv  Detail & Related papers  (2020-12-22T12:27:45Z)
• Line Graph Neural Networks for Link Prediction [71.00689542259052]
  We consider the graph link prediction task, which is a classic graph analytical problem with many real-world applications. In this formalism, a link prediction problem is converted to a graph classification task. We propose to seek a radically different and novel path by making use of the line graphs in graph theory. In particular, each node in a line graph corresponds to a unique edge in the original graph. Therefore, link prediction problems in the original graph can be equivalently solved as a node classification problem in its corresponding line graph, instead of a graph classification task.
  arXiv  Detail & Related papers  (2020-10-20T05:54:31Z)

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.