Pith. sign in

Learning to Skim Text

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Recurrent Neural Networks are showing much promise in many sub-areas of natural language processing, ranging from document classification to machine translation to automatic question answering. Despite their promise, many recurrent models have to read the whole text word by word, making it slow to handle long documents. For example, it is difficult to use a recurrent network to read a book and answer questions about it. In this paper, we present an approach of reading text while skipping irrelevant information if needed. The underlying model is a recurrent network that learns how far to jump after reading a few words of the input text. We employ a standard policy gradient method to train the model to make discrete jumping decisions. In our benchmarks on four different tasks, including number prediction, sentiment analysis, news article classification and automatic Q\&A, our proposed model, a modified LSTM with jumping, is up to 6 times faster than the standard sequential LSTM, while maintaining the same or even better accuracy.

fields

cs.CL 1

years

2019 1

verdicts

CONDITIONAL 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.

  • Interactive Machine Comprehension with Information Seeking Agents cs.CL · 2019-08-27 · conditional · none · ref 30 · internal anchor

    Reframing machine reading comprehension as an interactive, partially observable environment where agents reveal hidden sentences via commands, and showing a DQN-based baseline can learn to seek answers.