Weight-space programming treats a network’s weights as something a language model can inspect and rewrite by reasoning, in place of an optimiser. The term was introduced in November 2026 by researchers at MIT CSAIL, who used a frontier model to identify what small networks had been trained to do, to write small game-playing networks from zeros, and to remove a looping fault from a 0.8-billion-weight language model by changing 0.016% of its weights.
Early evidence suggests it works as automated interpretability surgery: it can remove a specific fault that hides an ability a model already has, but it has not been shown to add abilities a model lacks, and results on larger models are small and vary between runs.
