Compressed code: the hidden effects of quantization and distillation on programming tokens
Not on the map. Why?
Abstract (arXiv)
Large Language Models (LLMs) have demonstrated exceptional code generation capabilities, yet their token-level mechanisms remain underexplored, particularly in compressed models. Through systematic analysis of programming language token representations, we characterize how programming languages are encoded in LLM tokenizers by analyzing their vocabulary distribution and keyword coverage patterns. We introduce a novel cold-start probability analysis method that provides insights into model behavior without requiring explicit prompts. Additionally, we present a comprehensive evaluation of how different model optimization techniques - including quantization, distillation, model scaling, and task-specific fine-tuning - affect token-level representations and code generation quality. Our experiments, supported by comprehensive probability distribution analysis and evaluation metrics, reveal critical insights into token-level behavior and provide empirically-validated guidelines for maintaining code generation quality under various optimization constraints. These findings advance both theoretical understanding of LLM code generation and practical implementation of optimized models in production environments.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 14 of its 18 references that are in the map. First posted on arXiv 5 Jan 2026.
Builds on
14 of 18 references.
References · 14
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2021Evaluating Large Language Models Trained on Codecited by 8,053
- 2021Program Synthesis with Large Language Modelscited by 3,509
- 2023SWE-bench: Can Language Models Resolve Real-World GitHub Issues?cited by 3,193
- 2024Chatbot Arena: An Open Platform for Evaluating LLMs by Human Preferencecited by 1,151
- 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,093
- 2024BigCodeBench: Benchmarking Code Generation with Diverse Function Calls and Complex Instructionscited by 527
- 2020Byte Pair Encoding is Suboptimal for Language Model Pretrainingcited by 189
- 2024Byte Latent Transformer: Patches Scale Better Than Tokenscited by 137
- 2024Model Collapse Demystified: The Case of Regressioncited by 80
- 2024Getting the most out of your tokenizer for pre-training and domain adaptationcited by 65
- 2024Low-Bit Quantization Favors Undertrained LLMs: Scaling Laws for Quantized LLMs with 100T Training Tokenscited by 18
Built on by
Citing papers per year: 2026: 1.
1 paper.