SPADE: Self-Play in Adaptive Synthetic Executable Environments
Bo Liu, Simon Yu, Yiding Jiang, Ao Qu, Andrew Zhao, Zichen Liu, et al.
arXiv:2608.19197v1Today’s standout paper is SPADE, a self-play reinforcement learning framework for language agents. The problem it tackles is a big one: if you train an agent only in a fixed set of tasks, it can get good at that set, but it stops improving once the environment stops changing. SPADE flips that around by making the environment itself learnable. A single language model plays two roles: one writes new executable environments, complete with state, rewards, and verification code, while the other learns to solve them. The designer is trained to create tasks that sit right at the edge of the agent’s current ability, using a regret signal that measures how much better the agent performs when given hints. That keeps the curriculum challenging but still solvable. Why it matters is simple: this is a concrete step toward open-ended self-improvement, and it works across math, science, code, reasoning, and tool use, with strong gains at larger model scales.
Also spotted that day
Previous daily papers