Tiny Transformers Excel at Sentence Compression

Peter Belcak, Roger Wattenhofer
10/30/2024
cs.LGcs.CL

No confident code implementation found for this paper.

Abstract

It is staggering that words of the English language, which are on average represented by 5--6 bytes of ASCII, require as much as 24 kilobytes when served to large language models. We show that there is room for more information in every token embedding. We demonstrate that 1--3-layer transformers are capable of encoding and subsequently decoding standard English sentences into as little as a single 3-kilobyte token. Our work implies that even small networks can learn to construct valid English sentences and suggests the possibility of optimising large language models by moving from sub-word token embeddings towards larger fragments of text.

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{belcak2024tiny,
  title  = {Tiny Transformers Excel at Sentence Compression},
  author = {Peter Belcak and Roger Wattenhofer},
  year   = {2024},
  eprint = {2410.23510},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2410.23510v1}
}

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/2410.23510.svg)](https://codeofpaper.com/paper/2410.23510)

Discussion