CLMay 13, 2024

Zero-Shot Tokenizer Transfer

arXiv:2405.07883v232 citationsh-index: 32NIPS
Originality Incremental advance
AI Analysis

This addresses a flexibility issue for language model users by enabling tokenizer swapping without performance degradation, though it is incremental as it builds on existing hypernetwork methods.

The paper tackles the problem of language models being inefficient in non-English languages due to their English-centric tokenizers by introducing Zero-Shot Tokenizer Transfer (ZeTT), which uses a hypernetwork to predict embeddings for new tokenizers, achieving performance close to original models in cross-lingual and coding tasks while reducing tokenized sequence length.

Language models (LMs) are bound to their tokenizer, which maps raw text to a sequence of vocabulary items (tokens). This restricts their flexibility: for example, LMs trained primarily on English may still perform well in other natural and programming languages, but have vastly decreased efficiency due to their English-centric tokenizer. To mitigate this, we should be able to swap the original LM tokenizer with an arbitrary one, on the fly, without degrading performance. Hence, in this work we define a new problem: Zero-Shot Tokenizer Transfer (ZeTT). The challenge at the core of ZeTT is finding embeddings for the tokens in the vocabulary of the new tokenizer. Since prior heuristics for initializing embeddings often perform at chance level in a ZeTT setting, we propose a new solution: we train a hypernetwork taking a tokenizer as input and predicting the corresponding embeddings. We empirically demonstrate that the hypernetwork generalizes to new tokenizers both with encoder (e.g., XLM-R) and decoder LLMs (e.g., Mistral-7B). Our method comes close to the original models' performance in cross-lingual and coding tasks while markedly reducing the length of the tokenized sequence. We also find that the remaining gap can be quickly closed by continued training on less than 1B tokens. Finally, we show that a ZeTT hypernetwork trained for a base (L)LM can also be applied to fine-tuned variants without extra training. Overall, our results make substantial strides toward detaching LMs from their tokenizer.

Code Implementations2 repos
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes