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.
ReproduceCode
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
| Dataset | Model | Metric | Claimed | Verified | Status |
|---|---|---|---|---|---|
| SQuAD1.1 | SAN (ensemble model) | EM | 79.61 | — | Unverified |
| SQuAD1.1 | SAN (single model) | EM | 76.83 | — | Unverified |
| SQuAD1.1 dev | SAN (single) | EM | 76.24 | — | Unverified |
| SQuAD2.0 | SAN (ensemble model) | EM | 71.32 | — | Unverified |
| SQuAD2.0 | SAN (single model) | EM | 68.65 | — | Unverified |