Bellman language models treat an agent's recurring choices as a planning problem. The method reads past conversations into a fixed set of states, solves the best move for each once, and runs that as a controller around the model; unseen states go back to the LLM. On a telecom support benchmark, Qwen3.8-27B rose from 29% to 96% with 93% fewer model calls. It helps little where the hard part is writing content, such as fixing SymPy issues.
UserSWE tests coding agents on fixing repository bugs over several turns with a simulated user who reveals details gradually, with tests run after every turn. Across eleven agents on 72 tasks from 42 repositories, the leader changed with the number of turns allowed. Claude Fable 5.1 solved the most tasks in one turn, GPT-6-Astra the most by the eighth, and Claude Opus 5 led at most budgets in between.
In long agent tasks, training usually only learns whether the whole attempt succeeded, which makes it hard to tell which steps helped. SCALE adds a critic that predicts, at each step, the chance the task will still be completed, and turns changes in that chance into credit for individual actions. Across five agent benchmarks and three model backbones, it beat the compared reinforcement learning baselines in most settings, with gains of up to 4.1 percentage points.