cs.AINov 14, 2026

Zero-Shot Weight-Space Programming for Prediction and Classification of Target Variables in Structured Datasets

Authors: Eduardo C. Garrido-Merchán

Organizations: Universidad Pontificia Comillas (IIT, DIGNUM), Madrid, Spain

Abstract

Weight-space programming fixes every parameter of a feed-forward network by hand, with no gradient descent anywhere in the construction. Every demonstration so far starts from a target function handed to the model as a rule system, making it a compilation problem. A supervised dataset withholds that specification, so the procedure must do the statistical inference itself and then express the result in the parameterisation it was given. We ask whether a large language model can do both. It is shown a small dataset in full, with the architecture of a feed-forward network, and writes out every weight and bias as a literal number, with no optimizer, no gradient, no code execution, and no chance to evaluate it first. Each construction is sealed and pre-registers its expected score. The graded suite runs from two toy problems, through nine synthetic problems disguised by a hidden rotation, to the classical benchmarks and one real engineering regression. The frozen network matches the closed-form optimum wherever that optimum is linear, reaches the irreducible error of the generating process on three rungs where it is not, and beats every fitted baseline on two of those, including the same architecture trained by gradient descent. It fails on two rungs, both times because the structure to be found is oblique to the coordinates it analysed. Three further constructors separate two failure modes a single score conflates: one returns no parameter vector at all on the hardest rungs, another delivers everywhere while writing networks worse than predicting the mean. One of those failures proves avoidable: another constructor solves the oblique-hinge rung by a margin that survives multiple-comparison correction. What predicts whether the hidden layer earns its keep is the training error of a linear separator, which the composite complexity index misses.

Figures & tables

Explore similar work

CardsList
  1. Weight-Space Programming Doesn't Need Transformers

    Nov 17, 2026Hyunjong Ok, Jaeho Leeweight-space programmingAssociative Memory

  2. WeightBench: Evaluating Language Models as Weight-Space Programmers

    Nov 13, 2026Aayush Marasini, Barsat Khadka, Nick Rahimiweight-space programmingLLM Evaluation

  3. Zero-Shot Weight-Space Programming Across a Difficulty-Graded Ladder of Two-Player Games

    Nov 6, 2026Eduardo C. Garrido-Merchánweight-space programmingWeight-Space Learning