Feed 0% source
AI/ML AI-generated

NITP: Next Implicit Token Prediction for LLM Pre-training

Generated by a local model (nvidia/Gemma-4-26B-A4B-NVFP4) from a scientific paper, claim-checked against the full text. Provenance is open by design.

Standard large language model pre-training relies almost entirely on predicting the next discrete token in a sequence. This process rewards the model for picking the right word from a massive dictionary. However, it does not necessarily care how the model's internal "brain" organizes information. Because the supervision is so sparse—using a one-hot vector (a vector where only one element is 1 and others are 0) representing a single word—the model's internal representations can become messy.

Most engineers accept this as the cost of Next-Token Prediction (NTP). We assume that decreasing cross-entropy loss means the model is getting smarter. But a new paper argues this assumption is incomplete. They suggest NTP leaves the latent space (the hidden mathematical space where the model stores meaning) under-constrained. This allows internal representations to drift into "degenerate" configurations. To fix this, they propose Next Implicit Token Prediction (NITP). This method teaches the model to predict the underlying meaning of the next token using its own internal layers as a guide.

The Problem

The status quo is Next-Token Prediction (NTP). This optimizes the likelihood of the next discrete token. The authors argue this objective creates a structural "blind spot." The loss only cares about the correct logit ranking (the order of probabilities assigned to each word). Consequently, the model is free to let its hidden states wander into any configuration in the vast subspace orthogonal (mathematically perpendicular) to that target.

This lack of constraint leads to representation degeneration. As shown in, standard NTP causes the "Effective Rank"—a measure of the dimensionality of the subspace the model actually uses—to collapse rapidly.

Figure 1
Figure 1. Top: Representation geometry of the last hidden states under NTP and NITP. Bottom: Average downstream performance of 9B MoE and 2B dense models (details in Appendix B). Team et al., 2025; He & Su, 2025; Chen et al., 2024).

Simultaneously, the average cosine similarity (a measure of how much two vectors point in the same direction) between token representations rises. This signals high anisotropy (a state where vectors cluster in a narrow, cone-like direction). This geometric collapse means the model sacrifices expressive power for discriminative efficiency. Essentially, the model learns to pick the right word while losing the nuanced semantic details needed for complex downstream tasks.

How It Works

The authors propose NITP to augment NTP with continuous, dense supervision in the representation space. Instead of just predicting a discrete ID, the model must also predict the "implicit semantic content" of the next token.

The mechanism works through these primary steps:

  1. Semantic Anchoring: The model identifies "implicit tokens" using its own shallow layers. The authors found that early layers (around 20% of the total depth) act as stable, semantically rich encoders. These layers resolve lexical ambiguity better than the specialized, task-focused deep layers.
  2. Temporal Shifting: To create a predictive task, the model uses a temporal shift. The final hidden state at time $t$ must predict the shallow-layer representation of the token at time $t+1$.
  3. Continuous Supervision: As illustrated in, the model uses a projection head (an MLP or Multi-Layer Perceptron) to map the deep hidden state to the target dimensionality.
Figure 2
Figure 2. Overview of NITP. Next Implicit Token Prediction supervises hidden states by predicting temporally shifted implicit tokens, i.e. shallow-layer representations, and is jointly optimized with the standard next-token prediction objective.

It then minimizes the cosine similarity between this projection and the shallow-layer "anchor." 4. Stop-Gradient: Crucially, the authors apply a stop-gradient operator to the shallow-layer targets. This prevents the targets from moving in response to the prediction error. This ensures they remain stable "anchors" for the deeper layers to chase.

The total loss is a weighted sum of the standard NTP cross-entropy loss and this new NITP cosine loss.

Numbers

For an engineer, the most important takeaway is the efficiency profile. The authors report that NITP adds approximately 2% to the total training FLOPs (floating-point operations) for a 9B MoE model. In practical runs, they measured a wall-clock overhead of about 1.8%. Most importantly, because the projection head is discarded after pre-training, there is zero additional cost during inference.

The performance gains are substantial. On a 9B MoE model, the authors report a 5.7% absolute improvement on MMLU-Pro. They also measured a 6.4% gain on the C3 benchmark. Even on smaller dense models, the benefits persist. For a 2B dense model, the average score across benchmarks improved by 1.79 points. The authors also demonstrate that this isn't just a trick to boost benchmark scores. In evaluations of frozen hidden states on MTEB tasks, NITP improved 23 out of 25 tasks. This proves the underlying representations themselves are higher quality.

What's Missing

The paper is mathematically rigorous. It provides a formal proof that NITP acts as a "spectral lifter" to mitigate the optimization null space. However, some gaps remain for practitioners.

First, the method introduces new hyperparameters. These include the specific target layer index and the loss weight $\lambda$. While the authors suggest a target layer around 20% depth and $\lambda \approx 1.0$ is stable, these are not universal constants. Finding the optimal "sweet spot" for a custom architecture might require more tuning than the 2% FLOP overhead suggests.

Second, the paper does not explore how NITP interacts with advanced training techniques. It does not cover extreme quantization (reducing numerical precision) or massive-scale distributed optimizations. While they tested on MoE architectures, the complexity of routing in extremely large clusters might introduce unforeseen synchronization issues.

Should You Prototype This

Yes, but wait until you are defining your pre-training recipe. If you are currently in the middle of a massive run, do not attempt to inject this. The hyperparameter sensitivity regarding the target layer and the weight $\lambda$ makes it a risky mid-flight change.

However, if you are architecting a new pre-training run, NITP is a high-leverage move. The "bang for your buck" is excellent. You get measurable reasoning and knowledge gains for a negligible increase in compute. You pay none of that cost during the inference phase where your margins live. The implementation is reportedly available at https://github.com/aHapBean/NITP. Try it on a small scale model first to calibrate your target layer and weight.

Figures from the paper

Figure 3
Figure 3. Loss comparison between whether temporal shift or not
Figure 4
Figure 4. Average performance under different NITP loss. MoE model in Table 4, trained on 200B tokens. Importance of temporal shift. To distinguish NITP from static layer-wise alignment, we ablate the temporal structure of the implicit prediction objective.
Figure 5
Figure 5. Training dynamics of the NITP loss. Evolution of LNITP during pre-training, exhibiting a characteristic three-phase behavior: an initial collapse induced by random initialization, a transient hump caused by the emergence of structured shallow-layer targets, and a long-term stable convergence.
Novelty
0.0/10
Overall
0.0/10
#LLM Pre-training#Representation Learning#Mixture-of-Experts#Optimization
How this was made
Generation

Model: nvidia/Gemma-4-26B-A4B-NVFP4
Persona: habr_engineer
Refinement: 0
Pipeline: forge-1.0

Verification

Evaluator: nvidia/Gemma-4-26B-A4B-NVFP4
Score: 97% (passed)

Translation

Model: nvidia/Gemma-4-26B-A4B-NVFP4

Hardware & cost

NVIDIA GB10 · 128 GB unified · NVFP4 · 100% local · $0 cloud
Tokens: 122,692
Wall-time: 392.6s
Tokens/s: 312.5

Next up

LoRA-α: Unlocking Low-Rank Adaptation via Principled Scaling Factor Optimization

8.3/10· 6 min