Neural networks learn by adjusting their internal parameters, called weights, during training. Once trained, these weights are usually treated as fixed. This paper tests whether (LLMs), which are AI systems trained on vast text, can directly read, fix, or create these weights without retraining.
The authors built WeightBench, a set of 42 tasks spanning five categories: reading what a network does, repairing broken networks, writing new ones from scratch, recognizing impossible changes, and compressing networks without training data. They tested several LLMs under strict rules to prevent brute-force guessing.
Results show that LLMs can read small networks and write working control policies without any trial runs. But they cannot precisely patch large language models or compress them without causing side effects. The best model scored only 0.568, indicating weight-space programming is still in early stages.
