权重空间编程：将已知规则编译为紧凑神经网络智能体以泛化到未见游戏

View PDF HTML (experimental)

Abstract:Weight-space programming (WSP) uses language models to construct neural network weights without training. We test whether known game mechanics can be compiled into compact agents that generalise to held-out levels, renderings and start states within a game family. Writers receive simulator source with held-out level data removed for 20 privately authored, unpublished ARC-AGI-3-style game families. With a fixed 57k-parameter recurrent architecture, the strongest writer reaches 56% held-out-level success with feedback, while the four main writers' Python players reach 97-100%. An exploratory free-architecture condition reaches 68-90%. Learning from support-level examples transfers much less well, but these learners lack the source information given to writers. Written networks have a program-like structure: 93% of parameters are zero, and 90% of the rest are small integers or powers of two. NumPy players under comparable computation caps reach 91%, versus the networks' 79%. Training the strongest writer's architectures from scratch yields about 1% success within our budget. Written fixed-network weights are fragile, and standard PPO removes most of their success. Prompts for noise robustness increase tolerance by about four orders of magnitude for two of three writers, but PPO makes larger updates and still removes most success. These results demonstrate rule-to-network compilation in this setting, while showing limited benefits over Python programs and no successful combination with the tested PPO fine-tuning.

Comments:	32 pages, 4 figures. Code: this https URL
Subjects:	Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
Cite as:	arXiv:2611.16981 [cs.AI]
	(or arXiv:2611.16981v1 [cs.AI] for this version)
	https://doi.org/10.48550/arXiv.2611.16981 arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Jens Lehmann [view email]
[v1] Thu, 12 Nov 2026 15:49:00 UTC (112 KB)