Certainly not the best argument, but an intuitive one that I find at least somewhat compelling: When doing next-token prediction for prompts that ask reasoning questions, during training the model can minimize its training loss by 1) overfitting and memorizing the answer to every data point in the training set, 2) learn a set of heuristics that functionally looks like reasoning on the training set but is in reality a bunch of shortcuts that won't generalize OOD, or 3) become a model that is capable of reasoning so that it can fill in the likely next token without having to memorize the entire training set. Regularization / not being overparameterized w.r.t. the training data can make 1) less likely. Frontier models train on far more tokens than they have parameters, mostly seeing each example once, so wholesale memorization isn’t really an option. Grokking kind of shows something like this; e.g. models memorize modular arithmetic first, then shift to an interpretable generalizing algorithm under weight decay.
On the other hand, learning some heuristics that allow the model to do well on the training data without actually being "reasoning", where these heuristics might not generalize to OOD data, is also possible. It comes down to how "easy" learning reasoning is vs how easy learning a set of satisfactory heuristics is. I don't really know the answer to that.
But if the transformer architecture is capable of modeling reasoning, fitting the model with next token prediction wouldn't necessarily be a terrible approach at least.
This is definitely my favorite one I've seen so far! I think this is a great argument for being able to capture statistical structure that is actually present and available to the machine via training data or RL.
It still doesn't *quite* explain how that process produces open-ended general intelligence. I think this is a great mechanistic explanation for a powerful tool, though.