mlsanityData to 14 Oct 2026

Increasing transformer token length with a Maximum Entropy Principle Method

arXiv 2408.10277 ↗First posted 17 Aug 2024cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Transformers suffer from the computational overhead of their quadratic dependence on the length of sequences processed. We present three methods, all adding an intermediate step between training and inference/generation, which extend the autoregressive length of transformers. All rely on a Maximum Entropy Principle (MEP) whereby entropy is maximized in the presence of suitable constraints, accounted for by use of Lagrange Multipliers. These constraint methods extend the autoregressive character from T to 2T tokens in a linear-with-T fashion. There is overhead associated with this added step, but they should still be faster than the standard methods.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 5 of its 5 references that are in the map. First posted on arXiv 17 Aug 2024.

Builds on

5 of 5 references.

References · 5

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2020Longformer: The Long-Document Transformercited by 3,413
  3. 2019Generating Long Sequences with Sparse Transformerscited by 1,546
  4. 2021Attention is Not All You Need: Pure Attention Loses Rank Doubly Exponentially with Depthcited by 419
  5. 2022Formal Algorithms for Transformerscited by 72

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.