CLAILGNov 1, 2024

Adapting Language Models via Token Translation

HarvardMicrosoft
arXiv:2411.00593v22 citationsh-index: 21
Originality Incremental advance
AI Analysis

This addresses the issue of domain adaptation for language models, particularly in specialized fields like protein sequences, but is incremental as it builds on existing tokenization and finetuning techniques.

The paper tackled the problem of fixed tokenizers in language models causing inferior performance when applied to new domains, and introduced Sparse Sinkhorn Token Translation (S2T2) to improve perplexity and compression for out-of-domain protein sequences, outperforming direct finetuning methods.

Modern large language models use a fixed tokenizer to effectively compress text drawn from a source domain. However, applying the same tokenizer to a new target domain often leads to inferior compression, more costly inference, and reduced semantic alignment. To address this deficiency, we introduce Sparse Sinkhorn Token Translation (S2T2). S2T2 trains a tailored tokenizer for the target domain and learns to translate between target and source tokens, enabling more effective reuse of the pre-trained next-source-token predictor. In our experiments with finetuned English language models, S2T2 improves both the perplexity and the compression of out-of-domain protein sequences, outperforming direct finetuning with either the source or target tokenizer. In addition, we find that token translations learned for smaller, less expensive models can be directly transferred to larger, more powerful models to reap the benefits of S2T2 at lower cost.

Foundations

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

Your Notes