Reinforced Mnemonic Reader for Machine Reading Comprehension

Code

• github.com/HKUST-KnowComp/MnemonicReader
  pytorch★ 0
• github.com/yly-revive/chainer-mreader
  none★ 0
• github.com/ewrfcas/Reinforced-Mnemonic-Reader
  tf★ 0

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.

Tasks

Benchmark Results

Reproductions