SOTAVerified

DyREx: Dynamic Query Representation for Extractive Question Answering

2022-10-26Code Available0· sign in to hype

Urchade Zaratiana, Niama El Khbir, Dennis Núñez, Pierre Holat, Nadi Tomeh, Thierry Charnois

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Extractive question answering (ExQA) is an essential task for Natural Language Processing. The dominant approach to ExQA is one that represents the input sequence tokens (question and passage) with a pre-trained transformer, then uses two learned query vectors to compute distributions over the start and end answer span positions. These query vectors lack the context of the inputs, which can be a bottleneck for the model performance. To address this problem, we propose DyREx, a generalization of the vanilla approach where we dynamically compute query vectors given the input, using an attention mechanism through transformer layers. Empirical observations demonstrate that our approach consistently improves the performance over the standard one. The code and accompanying files for running the experiments are available at https://github.com/urchade/DyReX.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
NaturalQADyREXF178.58Unverified
NewsQADyREXF168.53Unverified
SQuAD1.1DyREXF191.01Unverified
TriviaQADyREXF177.37Unverified

Reproductions