不要再把大语言模型仅仅视为“下一个词预测器”
"Next-token predictor" is the wrong mental model for LLMs

原始链接: https://gmcgoldr.github.io/2026/09/04/llm-next-token-predictors.html

虽然大语言模型(LLM)从技术上讲是通过自回归方式输出词元(token)的“下一个词元预测器”,但这种定义是不完整的。它准确描述了其“机制”(即循环的形式),却未能涵盖模型实际在“做什么”。 在预训练阶段,模型通过模仿训练数据中已有的序列来进行学习。然而,现代的后训练技术——特别是带有可验证奖励的强化学习(RLVR)——从根本上改变了这种动态。模型不再仅仅是预测数据集中接下来会出现什么文本,而是开始探索新的序列,并强化那些能带来成功结果的序列。 作者用国际象棋做类比来阐明这一点:一个预测大师走法的系统只是“下一步棋预测器”,但一个通过评估棋局位置以最大化胜率的引擎则是一个“战略求解器”。同样地,现代大语言模型利用“下一个词元”循环作为载体,其所编码的内容远超简单的模仿;它们模拟出乐于助人的助手,并运用通过主动探索所获得的知识。归根结底,将先进的大语言模型仅仅描述为“下一个词元预测器”,是将工具的形式误认为是其功能,忽略了蕴含在过程中的推理及目标导向行为。

Hacker News 上的讨论揭示了关于将大语言模型(LLM)描述为“下一个词预测器”(next-token predictors)这一观点存在的巨大分歧。 批评该标签的人认为,这是一种试图淡化人工智能涌现能力的简化论。他们将这种表述比作仅仅把人类意识描述为生物“电路”,或者声称复杂的多细胞生命只是“下一次有丝分裂”的优化。他们认为,现代“代理”系统——利用递归循环、工具使用和强化学习——已经超越了其架构简单的统计预测本质。 相反,另一些人坚持认为该术语在技术上是准确的。他们认为,无论训练、强化学习或推理变得多么复杂,其核心机制仍然是计算下一个词概率分布的数学过程。虽然一些人认为这种简单的基础通过数据压缩产生了涌现出的“智能”,但怀疑论者认为,将这些机械过程与真正的理解或“正确性”混为一谈是一种危险的范畴错误。最终,许多参与者得出的结论是:尽管大语言模型在概念上只是简单的下一个词预测器,但它们代表了一种难以被简单定义的强大且复杂的系统。
相关文章

原文

Strictly speaking, the statement “LLMs are next-token predictors” isn’t wrong, but it’s incomplete. It’s a fine zeroth-order approximation, and it is grounded in something real: transformer-based language models emit tokens autoregressively:

while not done:
    tokens.append(model.sample_next_token(tokens))

This certainly has the shape of something you might call a next-token predictor. During pre-training, the model repeatedly takes some prior tokens, looks at the token that actually followed them, and makes that token more likely to be sampled next. Conceptually, the training loop looks something like this:

for tokens in training_data:
    for position in range(1, len(tokens)):
        prior_tokens = tokens[:position]
        actual_next_token = tokens[position]
        model.make_more_likely(
            actual_next_token,
            after=prior_tokens,
        )

make_more_likely is, of course, doing a heroic amount of work here. Under the hood are loss functions, gradients, and parameter updates, but for this post we only care about their combined effect: the token that actually came next becomes more likely.

Crucially, every actual_next_token comes from an existing sequence in training_data. It’s probably fair to say that the base model also behaves as a next-token predictor: it is trained to predict next tokens as they occur in its training data.

But the LLMs we use are not just base models. They are post-trained, and a key part of modern post-training is reinforcement learning with verifiable rewards (RLVR). During pre-training, the model learns only from sequences that already exist in the training data. During RLVR, the model explores by generating new sequences and learning from their outcomes. Conceptually, the RLVR training loop looks something like this:

for task in training_tasks:
    for explored_tokens in model.explore(task):
        reward = evaluate_outcome(task, explored_tokens)
        for position in range(len(explored_tokens)):
            prior_tokens = task + explored_tokens[:position]
            explored_next_token = explored_tokens[position]
            model.make_more_likely(
                explored_next_token,
                after=prior_tokens,
                according_to=reward,
            )

make_more_likely is doing the same kind of work in both loops, but for a fundamentally different reason. During pre-training, it makes an actual_next_token more likely because that token appeared in the training data. During RLVR, it makes an explored_next_token more likely because the explored sequence containing it earned a high reward.

So while a post-trained LLM still has the shape of a next-token predictor, emitting tokens one at a time, it no longer learns only by predicting existing text. It also learns from new sequences produced through its own exploration.

Chess Analogy

A chess engine makes this distinction easier to see. Imagine two chess systems.

The first is trained on a large database of grandmaster games. It learns patterns in how grandmasters respond to different board positions. Given a new position, it predicts the move a grandmaster would most likely play next. That is a next-move predictor.

The second is an idealized chess engine that has explored every possible game. From that exhaustive exploration, it knows the probability of winning from every possible board position. Given a position, it chooses the move that leads to the highest probability of winning. Unlike the first system, it is not trained only on games that grandmasters already played. It also learns from games generated by its own exploration.

Calling the second system a “next-move predictor” would be strange. It is not trying to predict what move appeared next in a dataset. It is trying to choose a move that wins.

Closing Thoughts

I didn’t touch on other post-training techniques in this post, but they matter too. Reinforcement learning from human feedback (RLHF), for example, shifts the model away from imitating its pre-training data as a whole and toward simulating a helpful assistant. And as we saw in this post, RLVR goes further still: it allows an LLM to explore and learn from ideas never seen in its training data.

That is why “next-token predictor” is the wrong mental model. It describes the shape of the mechanism, one token emitted after another, while ignoring what that mechanism encodes. A simulation of a helpful assistant and knowledge discovered through exploration can both be encoded in exactly the same next-token loop.

联系我们 contact @ memedata.com