Modular Linear Tokenization (MLT)
Not on the map. Why?
Abstract (arXiv)
This paper introduces Modular Linear Tokenization (MLT), a reversible and deterministic technique for encoding high-cardinality categorical identifiers into compact numerical vectors. Unlike traditional hashing or one-hot encodings, MLT preserves bijective mappings by leveraging modular arithmetic over finite fields and invertible linear transformations. The method offers explicit control of dimensionality and computational scalability while maintaining full reversibility, even for millions of identifiers. Experimental results on the MovieLens 20M dataset show that MLT achieves comparable predictive performance to supervised embeddings while requiring significantly fewer parameters and lower training cost. An open-source implementation of MLT is available on PyPI (https://pypi.org/project/light-mlt/) and GitHub (https://github.com/tcharliesschmitz/light-mlt).
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 13 references that are in the map. First posted on arXiv 29 Oct 2025.
Builds on
6 of 13 references.
References · 6
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
- 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,918
- 2018SentencePiece: A simple and language independent subword tokenizer and detokenizer for Neural Text Processingcited by 1,989
- 2016Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translationcited by 1,475
- 2016Bag of Tricks for Efficient Text Classificationcited by 876
- 2021ByT5: Towards a token-free future with pre-trained byte-to-byte modelscited by 509
Built on by
Not cited yet.