mlsanityData to 14 Oct 2026

ReTok: Replacing Tokenizer to Enhance Representation Efficiency in Large Language Model

arXiv 2410.04335 ↗First posted 6 Oct 2024cs.CLcited by 5

Not on the map. Why?

Abstract (arXiv)

Tokenizer is an essential component for large language models (LLMs), and a tokenizer with a high compression rate can improve the model's representation and processing efficiency. However, the tokenizer cannot ensure high compression rate in all scenarios, and an increase in the average input and output lengths will increases the training and inference costs of the model. Therefore, it is crucial to find ways to improve the model's efficiency with minimal cost while maintaining the model's performance. In this work, we propose a method to improve model representation and processing efficiency by replacing the tokenizers of LLMs. We propose replacing and reinitializing the parameters of the model's input and output layers with the parameters of the original model, and training these parameters while keeping other parameters fixed. We conducted experiments on different LLMs, and the results show that our method can maintain the performance of the model after replacing the tokenizer, while significantly improving the decoding speed for long texts.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 28 of its 42 references that are in the map. First posted on arXiv 6 Oct 2024.

Builds on

28 of 42 references.

References · 28

  1. 2020Language Models are Few-Shot Learnerscited by 32,419
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  3. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  4. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  5. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  6. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  7. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  8. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  9. 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,918
  10. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  11. 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,411
  12. 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,807
16 more
  1. 2023AGIEval: A Human-Centric Benchmark for Evaluating Foundation Modelscited by 716
  2. 2018Subword Regularization: Improving Neural Network Translation Models with Multiple Subword Candidatescited by 639
  3. 2021ByT5: Towards a token-free future with pre-trained byte-to-byte modelscited by 509
  4. 2023CMMLU: Measuring massive multitask language understanding in Chinesecited by 449
  5. 2021CANINE: Pre-training an Efficient Tokenization-Free Encoder for Language Representationcited by 232
  6. 2023Do All Languages Cost the Same? Tokenization in the Era of Commercial Language Modelscited by 192
  7. 2024Tokenization counts: the impact of tokenization on arithmetic in frontier LLMscited by 115
  8. 2023Examining Inter-Consistency of Large Language Models Collaboration: An In-depth Analysis via Debatecited by 97
  9. 2020Fast WordPiece Tokenizationcited by 87
  10. 2024Fast Vocabulary Transfer for Language Model Compressioncited by 42
  11. 2020From English To Foreign Languages: Transferring Pre-trained Language Modelscited by 37
  12. 2023OFA: A Framework of Initializing Unseen Subword Embeddings for Efficient Large-scale Multilingual Continued Pretrainingcited by 37
  13. 2024Toward a Theory of Tokenization in LLMscited by 30
  14. 2023Outline, Then Details: Syntactically Guided Coarse-To-Fine Code Generationcited by 27
  15. 2023ChineseWebText: Large-scale High-quality Chinese Web Text Extracted with Effective Evaluation Modelcited by 16
  16. 2021Evaluating Various Tokenizers for Arabic Text Classificationcited by 14

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 4; 2026: 1.

5 papers.