不要再把大语言模型仅仅视为“下一个词预测器”
“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)——从根本上改变了这种动态。模型不再仅仅是预测数据集中接下来会出现什么文本,而是开始探索新的序列,并强化那些能带来成功结果的序列。 作者用国际象棋做类比来阐明这一点:一个预测大师走法的系统只是“下一步棋预测器”,但一个通过评估棋局位置以最大化胜率的引擎则是一个“战略求解器”。同样地,现代大语言模型利用“下一个词元”循环作为载体,其所编码的内容远超简单的模仿;它们模拟出乐于助人的助手,并运用通过主动探索所获得的知识。归根结底,将先进的大语言模型仅仅描述为“下一个词元预测器”,是将工具的形式误认为是其功能,忽略了蕴含在过程中的推理及目标导向行为。

关于“下一个词预测器”(next-token predictor)是否足以作为大语言模型(LLM)的心理模型,这场争论揭示了技术机制与行为表现之间的巨大分歧。 支持该标签的人认为,这是对推理过程事实准确的描述:大语言模型根据其上下文窗口派生出的概率分布,一次输出一个词元(token)。从这个角度来看,将该术语斥为还原论是片面的,这就好比将人脑称为“化学物质袋”——虽然属实,却忽略了由此产生的复杂性和实用价值。 批评者则认为,“下一个词预测器”常被轻蔑地用来贬低大语言模型的能力。他们主张,现代后训练技术(如RLHF/RLVR)已将模型的功能从简单的模仿转变为目标导向的策略执行。在此框架下,模型不仅是在从训练数据中猜测下一个“真理”,而是在执行一种旨在最大化奖励函数的策略。 归根结底,这场分歧源于人们如何定义“预测”:是将其视为统计机制,还是有意识的目标。尽管底层架构仍是自回归的,但这场争论凸显了人们在看待这些工具时,在“高级自动补全”与“复杂的目标导向智能体”这两种认知之间存在的持续张力。
相关文章

原文

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