Cited by 50Topic ModelingNatural Language Processing TechniquesMultimodal Machine Learning Applications

Do Long-Range Language Models Actually Use Long-Range Context?

Open access
Sun, Simeng, Krishna, Kalpesh, Mattarella-Micke, Andrew, Iyyer, Mohit·2021·Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing

Abstract

Language models are generally trained on short, truncated input sequences, which limits their ability to use discourse-level information present in long-range context to improve their predictions.Recent efforts to improve the efficiency of self-attention have led to a proliferation of long-range Transformer language models, which can process much longer sequences than models of the past.However, the ways in which such models take advantage of the longrange context remain unclear.In this paper, we perform a fine-grained analysis of two longrange Transformer language models (including the Routing Transformer, which achieves state-of-the-art perplexity on the PG-19 longsequence LM benchmark dataset) that accept input sequences of up to 8K tokens.Our results reveal that providing long-range context (i.e., beyond the previous 2K tokens) to these models only improves their predictions on a small set of tokens (e.g., those that can be copied from the distant context) and does not help at all for sentence-level prediction tasks.Finally, we discover that PG-19 contains a variety of different document types and domains, and that long-range context helps most for literary novels (as opposed to textbooks or magazines).

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.18653/v1/2021.emnlp-main.62

Cites

43 of 43 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Transformers process natural language as a sequence on finite context windows, and global relationships among words beyond these windows cannot be completely modeled via sequence processing only.

    “Transformers process natural language as a sequence on finite context windows; however, global relationships among words beyond these windows cannot be completely modeled via sequence processing only.”

    From Emotion Classification With Visibility Graphs (2025) · cites this paper as [12]

    The Introduction says Transformer language models have maximum sequence lengths and that small context windows prevent models from using long-range discourse structure. The Conclusion reports that the two models studied rarely take advantage of long-range context. The paper does not establish the broader claim that sequence processing alone cannot completely model relationships beyond a window. (LLM, conf=0.85)

    Experimental — accuracy not yet measured
  • Pretrained-only base LLMs are known to show biased attention for more recent tokens (the end of inputs), especially when evaluating next-word prediction of contiguous text.

    “Pretrained-only base LLMs are known to show biased attention for more recent tokens (that is, the end of inputs), especially when evaluating next-word prediction of contiguous text52.”

    From A psychometric framework for evaluating and shaping personality traits in large language models (2025) · cites this paper as [52]

    Section 3 reports that overall next-token perplexity plateaus beyond a 2K-token prefix, and Section 4 finds that the Routing Transformer relies on the most recent occurrences of repeated tokens for prediction. Section 5 confirms that the token-level evaluations use ground-truth contiguous prefixes. These results support a preference for recent context in the models studied, but do not establish biased attention weights across pretrained-only base LLMs generally. (LLM, conf=0.84)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

3 of the 46 references couldn’t be matched to a known paper.

Research works printed but not linked: 2

  1. Jane Grimshaw. 1990. Argument structure. the MIT Press.
  2. Alec Radford, Jeffrey Wu, Rewon Child, David Luan, Dario Amodei, and Ilya Sutskever. 2019. Language models are unsupervised multitask learners. OpenAI blog, 1(8):9.

Cited by

Sorted by citations

Authors
Sun, S., Krishna, K., Mattarella-Micke, A., & Iyyer, M.
Affiliations
University of Massachusetts Amherst (US)
Venue
Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing
Published
2021
Pages
807-822
OpenAlex
W3200409031
Cited by
43
References
46
Citations by year
2026: 8 · 2025: 7 · 2024: 9 · 2023: 11 · 2022: 8
FWCI
3.23
Type
conference paper
Language
en
Open access
Licence
cc-by
Locations
  • Conference on Empirical Methods in Natural Language Processing (EMNLP) (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
National Science Foundation (1955567)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Multimodal Machine Learning Applications
Keywords
long-range context, literary novels

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review