Learning to Learn-at-Test-Time: Language Agents with Learnable Adaptation Policies
About
Test-Time Learning (TTL) enables language agents to iteratively refine their performance through repeated interactions with the environment at inference time. At the core of TTL is an adaptation policy that updates the actor policy based on experience from previous episodes, thereby improving future behavior. Existing methods rely on fixed, hand-crafted adaptation policies rather than optimizing them for downstream improvement. We argue that optimal adaptation policies should be learned from task environments, not hand-engineered based on human intuition. To achieve this, we introduce Meta-TTL, a framework that formulates the discovery of effective adaptation policies as a bi-level optimization problem. Within this framework, the inner loop executes the standard TTL process, measuring how effectively a candidate adaptation policy helps an agent correct errors across sequential episodes. Guided by the agent's performance, the outer loop employs evolutionary search over a diverse distribution of training tasks to continually optimize the adaptation policy. We evaluate Meta-TTL on Jericho, WebArena-Lite, and $\tau^2$-bench across both in-distribution (ID) and out-of-distribution (OOD) settings. Results on all three show that Meta-TTL consistently outperforms single-agent, prompt-optimization, and unoptimized meta-agent baselines, suggesting that the optimized adaptation policy encodes transferable strategies that generalize beyond the training task distribution.