CLAIAug 1

AdaMTP: An Adaptive Training Paradigm for Multi-Token Prediction

arXiv:2608.0043411.1h-index: 9
Predicted impact top 9% in CL · last 90 daysOriginality Highly original
AI Analysis

This work addresses the problem of noisy training signals in Multi-Token Prediction for Large Language Models, which can degrade the model's core capabilities.

The paper introduces AdaMTP, an adaptive training paradigm for Multi-Token Prediction (MTP) that dynamically adjusts the prediction horizon based on sequence predictability. By using an entropy-based segmentation algorithm to detect semantic boundaries and a dynamically masked MTP objective, AdaMTP suppresses noisy gradients, leading to consistent performance improvements and inference speedups across various benchmarks and backbones compared to standard MTP.

Multi-Token Prediction (MTP) has emerged as an effective paradigm that augments a shared Large Language Model backbone with auxiliary heads, training the model to predict several future tokens in parallel to enrich its supervision signal and accelerate inference. However, existing training frameworks adopt a rigid, fixed-length prediction horizon, disregarding the highly non-uniform information density of natural language and code. Forcing the auxiliary heads to predict across high-entropy semantic boundaries injects noisy, conflicting training signals; because these heads share the backbone's latent representations, the resulting gradients backpropagate and interfere with the model's core capabilities. We propose AdaMTP, an adaptive training paradigm that dynamically aligns the prediction horizon with the intrinsic predictability of the sequence. At its core, an entropy-based segmentation algorithm leverages the base model to detect sudden surges in uncertainty as semantic boundaries, partitioning sequences into variable-length groups. Each token is assigned an adaptive prediction depth, and a dynamically masked MTP objective suppresses the loss for predictions that cross these boundaries, attenuating the noisy gradients that degrade the backbone. Across mathematical reasoning, code generation, and general benchmarks on three backbones (Llama-3.1-8B, Qwen-2.5-7B, Gemma-3-12B), AdaMTP consistently outperforms standard MTP in both task performance and inference speedup.

Foundations

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

Your Notes