cs.LGNov 13, 2026

WeightBench: Evaluating Language Models as Weight-Space Programmers

Authors: Aayush Marasini, Barsat Khadka, Nick Rahimi

Organizations: The University of Southern Mississippi, Hattiesburg, MS 39401, USA

Abstract

Recent work shows that large language models (LLMs) can operate directly on the parameters of other neural networks. They can read what a network was trained to do, fix a network that fails, and write working networks from scratch, all without gradient descent. This capability has been termed Weight-Space Programming (WSP). Exploring this new paradigm systematically requires a robust benchmark. We introduce WEIGHTBENCH, a benchmark that evaluates LLMs of increasing capability on 42 WSP tasks across five tracks: reading, fixing and writing weights, recognizing edits that are impossible, and data-free compression. The networks whose weights the LLMs read and edit range from 2K-parameter control policies to 7B-parameter language models. Experimental benchmark results show that frontier agents can already read small networks and write working control policies without ever running them, but cannot yet patch language models, compress them without data, or tell an impossible edit from a hard one. On all 42 tasks, Claude Opus 5.5 reaches a macro score of 0.535 (Sonnet 5.5 0.466, Haiku 5.5 0.402, DeepSeek v4-flash 0.215); on the 38 tasks it was run on, GPT-6.1-sol reaches 0.568 against Opus's 0.546. Code, the task registry, our OS-level sandbox harness, and the live leaderboard are publicly available at https://github.com/Aayush-Marasini/WeightBench.

Figures & tables

Explore similar work

CardsList
  1. WeightLoop: Weight-Space Programming with Experimental Feedback

    Nov 5, 2026Mengran Li, Bo Li, Weijing Zhao +6weight-space programmingLanguage Model Self-Improvement

  2. Exploring Weight-Space Programming: Capabilities, Generalization, and Limitations

    Nov 6, 2026Junru Hu, Cheng Tang, Wei Li +5weight-space programmingWeight-Space Learning