Why and when should you pool? Analyzing Pooling in Recurrent Architectures
Pratyush Maini Affiliation: Indian Institute of Technology, Delhi, India Keshav Kolluru Affiliation: Indian Institute of Technology, Delhi, India Danish Pruthi Affiliation: Carnegie Mellon University, Pittsburgh, USA{pratyush.maini, Mausam Affiliation: Indian Institute of Technology, Delhi, India
Abstract
Pooling-based recurrent neural architectures consistently outperform their counterparts without pooling on sequence classification tasks. However, the reasons for their enhanced performance are largely unexamined. In this work, we explore three commonly used pooling techniques (mean-pooling, max-pooling, and attention11 1 Attention aggregates representations via a weighted sum, thus we consider it under the umbrella of pooling in this paper.), and propose max-attention, a novel variant that captures interactions among predictive tokens in a sentence. Using novel experiments, we demonstrate that pooling architectures substantially differ from their non-pooling equivalents in their learning ability and positional biases: (i) pooling facilitates better gradient flow than BiLSTMs in initial training epochs, and (ii) BiLSTMs are biased towards tokens at the beginning and end of the input, whereas pooling alleviates this bias. Consequently, we find that pooling yields large gains in low resource scenarios, and instances when salient words lie towards the middle of the input. Across several text classification tasks, we find max-attention to frequently outperform other pooling techniques.
原文 arXiv:2005.00159;中英对照 + 大白话阅读 https://aha.fim.ai/paper/2005.00159v2