SOTAVerified

Stochastic Answer Networks for Machine Reading Comprehension

2017-12-10ACL 2018Code Available0· sign in to hype

Xiaodong Liu, Yelong Shen, Kevin Duh, Jianfeng Gao

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

We propose a simple yet robust stochastic answer network (SAN) that simulates multi-step reasoning in machine reading comprehension. Compared to previous work such as ReasoNet which used reinforcement learning to determine the number of steps, the unique feature is the use of a kind of stochastic prediction dropout on the answer module (final layer) of the neural network during the training. We show that this simple trick improves robustness and achieves results competitive to the state-of-the-art on the Stanford Question Answering Dataset (SQuAD), the Adversarial SQuAD, and the Microsoft MAchine Reading COmprehension Dataset (MS MARCO).

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
SQuAD1.1SAN (ensemble model)EM79.61Unverified
SQuAD1.1SAN (single model)EM76.83Unverified
SQuAD1.1 devSAN (single)EM76.24Unverified
SQuAD2.0SAN (ensemble model)EM71.32Unverified
SQuAD2.0SAN (single model)EM68.65Unverified

Reproductions