T-FREE: Subword Tokenizer-Free Generative LLMs via Sparse Representations for Memory-Efficient Embeddings

Björn Deiseroth, Manuel Brack, Patrick Schramowski, Kristian Kersting, Samuel Weinbach
6/27/2024
cs.CLcs.AIcs.LG

No official code found. Best implementation: Aleph-Alpha-Research/trigrams (60 stars, last commit 2025-11-18).

Abstract

Tokenizers are crucial for encoding information in Large Language Models, but their development has recently stagnated, and they contain inherent weaknesses. Major limitations include computational overhead, ineffective vocabulary use, and unnecessarily large embedding and head layers. Additionally, their performance is biased towards a reference corpus, leading to reduced effectiveness for underrepresented languages. To remedy these issues, we propose T-FREE, which directly embeds words through sparse activation patterns over character triplets, and does not require a reference corpus. T-FREE inherently exploits morphological similarities and allows for strong compression of embedding layers. In our exhaustive experimental evaluation, we achieve competitive downstream performance with a parameter reduction of more than 85% on these layers. Further, T-FREE shows significant improvements in cross-lingual transfer learning.

View on arXivView PDF

Code Implementations(1)

607Shell, PythonJun 24, 202411 months agoNOASSERTION

Similar Papers

Cite this paper

@article{deiseroth2024tfree,
  title  = {T-FREE: Subword Tokenizer-Free Generative LLMs via Sparse Representations for Memory-Efficient Embeddings},
  author = {Björn Deiseroth and Manuel Brack and Patrick Schramowski and Kristian Kersting and Samuel Weinbach},
  year   = {2024},
  eprint = {2406.19223},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2406.19223v2}
}

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

Discussion