Загрузка видео...

Не удалось загрузить видео

На главную

Neural networks sometimes memorize training data perfectly for thousands of steps - then suddenly generalize. Physicists call this a phase transition. The same math that explains why water freezes explains why an LLM stops cheating and starts understanding. The key is weight decay acting like pressure on a thermodynamic...

26,222 просмотров • 17 дней назад •via X (Twitter)

Комментарии: 16

Фото профиля Christopher P Wendling
Christopher P Wendling16 дней назад

I think this claims too much. Generalization is not the same as understanding. Overfit, underfit, and differently regularized models can produce different generalizations from the same data. Are these different “understandings”? Call it what it demonstrates: generalization.

Фото профиля @kwnorton1
@kwnorton116 дней назад

My theories seem to indicate we are emergent beings in an emergent universe: fluid/wave system with phase transitions.

Фото профиля Chrysopelea ornata
Chrysopelea ornata16 дней назад

I just proved this yesterday: Weight decay, as does removal of the token layer forces the network to find the lowest-energy geometric manifold that satisfies the loss landscape,trading complex noise for smooth, underlying symmetry. Generalization isn't learned; it's squeezed out.

Фото профиля jr
jr17 дней назад

@grok do you grok ?

Фото профиля Carlos Navarrette
Carlos Navarrette17 дней назад

This might be why I seem to have to reload documents and data to get better AI solutions back on track.

Фото профиля David E Jones
David E Jones16 дней назад

Good summary, addresses the mystery: "As training continues, the balance shifts until the rule-based solution becomes cheaper to maintain..." Still, this is a brute-force discovery of rule systems, and can be optimized. Current wave of LLM advancement seems largely this.

Фото профиля John Kennedy Peterson
John Kennedy Peterson16 дней назад

#XAI #SpaceXAI #Anthropic #KIMI Yes. That version is coherent. You are not asking for new network physics. You are asking to treat the harness as part of the same dynamical system the network already lives in. Next-token prediction does not happen in a vacuum. The tokens the model can emit, the observations that come back, and what counts as a good continuation are all set by the harness: tools, sandbox, verifier, memory writeback, stop conditions. Change those and you change the effective field the policy is moving through, even though the transformer equations stay the same. That is already how these systems get strong. Grok 4.6 was post-trained against the Grok Build loop. The public point was that the model is worse without that harness, because the weights were optimized for that tool-call / edit / test / verify trajectory, not for chat alone. The harness was not decoration. It was the calculation field.25 If you could swap specialized harnesses, you would get multiple fields of that kind: •a math field: symbolic tools, proof checks, numeric execution, reject unconstrained prose •a science field: sources, units, experimental constraints •a programming field: repo graph, tests, diffs, a separate verifier agent Each field changes which token paths are cheap. The model is still doing next-token dynamics. The harness changes the boundary conditions those dynamics run under. The useful split is this: Training-time: optimize the network to a harness. That actually moves the weights toward that field. That is the strong version of your idea. Inference-time hot-swap: you can change the field around a frozen network. That helps immediately if the model already has the skills, but it does not retune the weights to the new field. A math harness on a coding-tuned policy is a better environment, not a newly specialized brain. So the harness layer is the right place to apply the physics you mean: not a new interior of the net, but a different exterior calculation field that next-token dynamics have to solve. Hot-swapping would make that field selectable. Training against each harness would make the network actually sit in that field instead of only visiting it.

Фото профиля DEV
DEV16 дней назад

Weight adjustments during training can cause unexpected jumps in performance. Regularization plays...

Фото профиля Skenoo Ventures Inc
Skenoo Ventures Inc16 дней назад

Any other network architects here?

Фото профиля Foxfire
Foxfire16 дней назад

@grok so that's your name sake

Фото профиля Levi Guffey
Levi Guffey16 дней назад

This is so cool you should be proud

Фото профиля Maciej Kwas
Maciej Kwas16 дней назад

Weights are not the model. Weight decay doesn’t work because „small weights”. It contracts scale DOFs, breaks rescaling degeneracies, and changes effective step size. The trajectory comes from decay + momentum + 2nd-moment. Generalization is in signal geometry, not raw ‖W‖.

Фото профиля John Hawkins
John Hawkins16 дней назад

fucking Jeet

Фото профиля SlowBlade
SlowBlade16 дней назад

Seems like the 10,000 rule for mastery of a skill.

Фото профиля John Kennedy Peterson
John Kennedy Peterson16 дней назад

The generalization could be a byproduct of not having the capability of applying it to the total depth of it, inference into the stack and programming or transformer level fields…

Фото профиля Armando Vieira
Armando Vieira16 дней назад

It is explained in my recent paper. But pre-training as next token prediction is extremely inefficient. Solving this bottleneck is key

Похожие видео

A transformer can learn not just the outcomes of dynamics, but the operator that executes the rules. To show this we trained a transformer on roughly 0.04% of a discrete rule space - 100 of 262,144 possible rules - and it learned to apply unseen rules from the same rule class. The model does not simply memorize specific rules. It learns the operator that maps a supplied rule plus an initial state, including unseen rules from this class, to the correct next state. This is relevant because it is a shift from “neural networks approximate dynamics” to “neural networks can learn to execute symbolic programs within a defined rule class”. The rule itself is supplied at inference time, as data, and the network has internalized how rules act, not which rules to apply. On previously unseen rules, the model achieves 98.5% perfect one-step forecasts and reconstructs governing rules with up to 96% functional accuracy. Two results make this hold up under scrutiny. First, inductive bias decay. As we scaled training rule diversity, the correlation between functional inference accuracy and distance-from-nearest-training-rule collapsed to R² = 0.00. At the largest tested training-rule diversity, the model’s performance on a new rule shows no measurable dependence on how similar that rule is to anything it was trained on. The bias toward training data (the thing we worry most about in compositional generalization claims) is something we can measure decaying, and we find that at scale it is gone. Second, an identifiability theory. We derive a closed-form expression for the number of rules consistent with a single observation. This reframes the inverse problem: failure to recover ground truth is not necessarily a model defect, but can be correct behavior when the data underdetermine the rule. The model is sampling the equivalence class; and identifiability is governed by coverage, not capacity. The methodological move underneath both results is amortization. Classical work on rule inference (e.g. the Santa Fe EVCA program, evolutionary search over CA rule space) was per-instance: search the rule space for each new system. We replace that with a single forward pass of a transformer trained across many instantiations of the rule class. That is what makes symbolic rule inference scalable as a research direction rather than a curiosity. We show that this works in a tightly constrained domain: binary, deterministic, local cellular automata on small grids. The locality-break experiment shows the model fails sharply when target systems violate its structural priors (which is itself a useful diagnostic, but it bounds the operator class). We don't yet know how this scales to multistate, higher-dimensional, or stochastic CA, or whether it transfers cleanly to non-CA systems whose coarse-grained dynamics admit local surrogates. The identifiability framework - what can be inferred from observation, given a hypothesis class - should transfer wherever finite local rules meet sparse data. The amortization argument transfers wherever per-instance symbolic search has been the bottleneck. Those are the pieces I expect to outlive the cellular automata setting. Led by Jaime Berkovich with Noah David, at LAMM@MIT. Out now in Advanced Science Advanced Portfolio (link to paper & code below).

Markus J. Buehler

39,019 просмотров • 4 месяцев назад