English

DyREx: Dynamic Query Representation for Extractive Question Answering

Computation and Language 2022-10-28 v1 Artificial Intelligence

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 \textit{DyREx}, a generalization of the \textit{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 \url{https://github.com/urchade/DyReX}.

Keywords

Cite

@article{arxiv.2210.15048,
  title  = {DyREx: Dynamic Query Representation for Extractive Question Answering},
  author = {Urchade Zaratiana and Niama El Khbir and Dennis Núñez and Pierre Holat and Nadi Tomeh and Thierry Charnois},
  journal= {arXiv preprint arXiv:2210.15048},
  year   = {2022}
}

Comments

Accepted at "2nd Workshop on Efficient Natural Language and Speech Processing (ENLSP-II)" @ NeurIPS 2022

R2 v1 2026-06-28T04:36:15.117Z