Revisiting Transformer-based Models for Long Document Classification
Xiang Dai, Ilias Chalkidis, Sune Darkner, Desmond Elliott
TL;DR
This study interrogates how Transformer-based long-document classification can overcome the limitations of truncating long texts. By comparing sparse-attention (Longformer, BigBird) and hierarchical architectures across MIMIC-III, ECtHR, Hyperpartisan, and 20 News, it shows substantial performance gains when longer text is processed, with nuanced guidance on architectural choices. Task-adaptive pre-training and careful design of global attention, segment length, and overlap emerge as key levers for effectiveness and efficiency. The findings offer concrete recommendations for practitioners and demonstrate that transformers can outperform CNN baselines on genuinely long documents, reshaping approaches to real-world long-document classification tasks.
Abstract
The recent literature in text classification is biased towards short text sequences (e.g., sentences or paragraphs). In real-world applications, multi-page multi-paragraph documents are common and they cannot be efficiently encoded by vanilla Transformer-based models. We compare different Transformer-based Long Document Classification (TrLDC) approaches that aim to mitigate the computational overhead of vanilla transformers to encode much longer text, namely sparse attention and hierarchical encoding methods. We examine several aspects of sparse attention (e.g., size of local attention window, use of global attention) and hierarchical (e.g., document splitting strategy) transformers on four document classification datasets covering different domains. We observe a clear benefit from being able to process longer text, and, based on our results, we derive practical advice of applying Transformer-based models on long document classification tasks.
