Command Palette
Search for a command to run...
Minghao Hu; Yuxing Peng; Zhen Huang; Xipeng Qiu; Furu Wei; Ming Zhou

Abstract
In this paper, we introduce the Reinforced Mnemonic Reader for machine reading comprehension tasks, which enhances previous attentive readers in two aspects. First, a reattention mechanism is proposed to refine current attentions by directly accessing to past attentions that are temporally memorized in a multi-round alignment architecture, so as to avoid the problems of attention redundancy and attention deficiency. Second, a new optimization approach, called dynamic-critical reinforcement learning, is introduced to extend the standard supervised method. It always encourages to predict a more acceptable answer so as to address the convergence suppression problem occurred in traditional reinforcement learning algorithms. Extensive experiments on the Stanford Question Answering Dataset (SQuAD) show that our model achieves state-of-the-art results. Meanwhile, our model outperforms previous systems by over 6% in terms of both Exact Match and F1 metrics on two adversarial SQuAD datasets.
Code Repositories
Benchmarks
| Benchmark | Methodology | Metrics |
|---|---|---|
| question-answering-on-squad11 | Reinforced Mnemonic Reader (ensemble model) | EM: 82.283 F1: 88.533 |
| question-answering-on-squad11 | Reinforced Mnemonic Reader (single model) | EM: 79.545 F1: 86.654 |
| question-answering-on-squad11 | Mnemonic Reader (single model) | EM: 70.995 F1: 80.146 |
| question-answering-on-squad11 | Mnemonic Reader (ensemble) | EM: 74.268 F1: 82.371 |
| question-answering-on-squad11-dev | R.M-Reader (single) | EM: 78.9 F1: 86.3 |
| question-answering-on-triviaqa | Mnemonic Reader | EM: 46.94 F1: 52.85 |
Build AI with AI
From idea to launch — accelerate your AI development with free AI co-coding, out-of-the-box environment and best price of GPUs.