Can a Linear Program Do Weight-Space Programming?

An author investigates MIT CSAIL's weight-space programming experiments and demonstrates that an automated linear program can perform the same weight edits as an AI agent with significantly fewer changed weights. By framing weight selection as an L1-norm minimization problem under linear constraints, the author replaces an eight-hour agentic search with a GPU-based linear program solver that matches or exceeds benchmark improvements. Open article →