mlsanityData to 14 Oct 2026

Pre-Training Curriculum for Multi-Token Prediction in Language Models

arXiv 2505.22757 ↗First posted 28 May 2025cs.CL cs.AIcited by 2

On the map: Efficient LLM inference and serving → Speculative decoding

Abstract (arXiv)

Multi-token prediction (MTP) is a recently proposed pre-training objective for language models. Rather than predicting only the next token (NTP), MTP predicts the next k tokens at each prediction step, using multiple prediction heads. MTP has shown promise in improving downstream performance, inference speed, and training efficiency, particularly for large models. However, prior work has shown that smaller language models (SLMs) struggle with the MTP objective. To address this, we propose a curriculum learning strategy for MTP training, exploring two variants: a forward curriculum, which gradually increases the complexity of the pre-training objective from NTP to MTP, and a reverse curriculum, which does the opposite. Our experiments show that the forward curriculum enables SLMs to better leverage the MTP objective during pre-training, improving downstream NTP performance and generative output quality, while retaining the benefits of self-speculative decoding. The reverse curriculum achieves stronger NTP performance and output quality, but fails to provide any self-speculative decoding benefits.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 28 of its 44 references that are in the map. First posted on arXiv 28 May 2025.

Builds on

28 of 44 references.

Closest ancestors · 4

Same direction, newest first

  1. 2024SWIFT: On-the-Fly Self-Speculative Decoding for LLM Inference Acceleration9 Oct
  2. 2024KOALA: Enhancing Speculative Decoding for LLM via Multi-Layer Draft Heads with Adversarial Learning15 Aug
  3. 2024Kangaroo: Lossless Self-Speculative Decoding via Double Early Exiting29 Apr
  4. 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan

Other references · 24

  1. 2020Language Models are Few-Shot Learnerscited by 32,419
  2. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  3. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
  4. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  5. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
  6. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
  7. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  8. 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,918
  9. 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,411
  10. 2023G-Eval: NLG Evaluation using GPT-4 with Better Human Alignmentcited by 2,276
  11. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
  12. 2024Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phonecited by 1,917
12 more
  1. 2023Textbooks Are All You Need II: phi-1.5 technical reportcited by 565
  2. 2019BLiMP: The Benchmark of Linguistic Minimal Pairs for Englishcited by 564
  3. 2021ByT5: Towards a token-free future with pre-trained byte-to-byte modelscited by 509
  4. 2024Better & Faster Large Language Models via Multi-token Predictioncited by 360
  5. 2018Blockwise Parallel Decoding for Deep Autoregressive Modelscited by 323
  6. 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 307
  7. 2020ProphetNet: Predicting Future N-gram for Sequence-to-Sequence Pre-trainingcited by 222
  8. 2023Future Lens: Anticipating Subsequent Tokens from a Single Hidden Statecited by 121
  9. 2025Findings of the BabyLM Challenge: Sample-Efficient Pretraining on Developmentally Plausible Corporacited by 88
  10. 2023The MiniPile Challenge for Data-Efficient Language Modelscited by 75
  11. 2024Findings of the Second BabyLM Challenge: Sample-Efficient Pretraining on Developmentally Plausible Corporacited by 48
  12. 2020Best Fit Bin Packing with Random Order Revisitedcited by 4

Built on by

Cited by year (2026 to 14 Oct)

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

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025FastMTP: Accelerating LLM Inference with Enhanced Multi-Token Prediction
  2. 2025On multi-token prediction for efficient LLM inference
  3. 2026Multi-Token Prediction via Self-Distillation
  4. 2025Parallel Token Prediction for Language Models
  5. 2025Fast and Expressive Multi-Byte Prediction with Probabilistic Circuits
  6. 2025Direct Multi-Token Decoding
  7. 2026Distribution-Aware Companding Quantization of Large Language Models
  8. 2024FIRP: Faster LLM inference via future intermediate representation prediction