Increasing transformer token length with a Maximum Entropy Principle Method

R. I. Cukier
8/17/2024
cs.LG

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{cukier2024increasing,
  title  = {Increasing transformer token length with a Maximum Entropy Principle Method},
  author = {R. I. Cukier},
  year   = {2024},
  eprint = {2408.10277},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2408.10277v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2408.10277.svg)](https://codeofpaper.com/paper/2408.10277)

Discussion