Machine reading comprehension, whose goal is to find answers from the candidate passages for a given question, has attracted a lot of research efforts in recent years. One of the key challenge in machine reading comprehension is how to identify the main content from a large, redundant, and overlapping set of candidate sentences. In this paper we propose to tackle the challenge with Markov Decision Process in which the main content identification is formalized as sequential decision making and each action corresponds to selecting a sentence. Policy gradient is used to learn the model parameters. Experimental results based on MSMARCO showed that the proposed model, called MC-MDP, can select high quality main contents and significantly improved the performances of answer span prediction.
[1]
Ali Farhadi,et al.
Bidirectional Attention Flow for Machine Comprehension
,
2016,
ICLR.
[2]
Martin L. Puterman,et al.
Markov Decision Processes: Discrete Stochastic Dynamic Programming
,
1994
.
[3]
Shuohang Wang,et al.
Machine Comprehension Using Match-LSTM and Answer Pointer
,
2016,
ICLR.
[4]
Wei Zhang,et al.
R3: Reinforced Ranker-Reader for Open-Domain Question Answering
,
2018,
AAAI.