CLNov 6, 2016

Hierarchical Question Answering for Long Documents

arXiv:1611.01839v2170 citations
Originality Incremental advance
AI Analysis

This addresses the computational bottleneck in processing long documents for question answering, offering a practical solution for applications requiring efficient and accurate text analysis.

The paper tackles the problem of scaling question answering to long documents by introducing a hierarchical framework that combines a fast sentence selector with a more expensive RNN for answer generation, achieving state-of-the-art performance on challenging datasets and speeding up the model by 3.5x-6.7x.

We present a framework for question answering that can efficiently scale to longer documents while maintaining or even improving performance of state-of-the-art models. While most successful approaches for reading comprehension rely on recurrent neural networks (RNNs), running them over long documents is prohibitively slow because it is difficult to parallelize over sequences. Inspired by how people first skim the document, identify relevant parts, and carefully read these parts to produce an answer, we combine a coarse, fast model for selecting relevant sentences and a more expensive RNN for producing the answer from those sentences. We treat sentence selection as a latent variable trained jointly from the answer only using reinforcement learning. Experiments demonstrate the state of the art performance on a challenging subset of the Wikireading and on a new dataset, while speeding up the model by 3.5x-6.7x.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes