ASH: Agents that Self-Hone in
Long-Horizon Worlds

1University of Waterloo 2National Research Council Canada
NeurIPS 2026

Abstract

Long-horizon visuomotor tasks remain a fundamental challenge in AI, as current methods rely on hand-engineered rewards or action-labeled demonstrations, neither of which scales. We introduce ASH, an agentic system that learns a long-horizon policy from unlabeled, noisy internet video, without reward shaping or expert annotation. ASH follows a self-improvement loop; when it gets stuck, ASH learns an Inverse Dynamics Model (IDM) from its own trajectories, and uses its IDM to extract supervision from relevant internet video. ASH uses unsupervised learning to identify key moments from large-scale internet video and retains them as long-term memory — allowing it to tackle long-horizon problems. We evaluate ASH on two complementary environments demanding multi-hour planning: Pokémon Emerald, a turn-based RPG, and The Legend of Zelda: The Minish Cap, a real-time action-adventure game. In both games, behavioral cloning, retrieval-augmented and zero-shot foundation-model baselines plateau, while ASH sustains progression across our 8-hour evaluation. ASH reaches an average of 11.2/12 milestones in Pokémon Emerald and 9.9/12 in Legend of Zelda, while the strongest baseline gets stuck in both environments at an average of 9.3/12 and 7.8/12 milestones, respectively. We demonstrate that self-improving agents are a scalable recipe for learning in long-horizon worlds.

Skills ASH learns: battling trainers, catching Pokémon, healing Pokémon, collecting key items, sword fighting, blocking projectiles, finding power-ups and solving puzzles.
ASH self-improves over the course of a multi-hour playthrough by retrieving and learning from relevant internet video. In Pokémon Emerald, ASH learns to battle trainers, catch Pokémon, and heal its team at Pokémon centers. In Zelda, ASH discovers how to wield a sword and apply game mechanics to solve puzzles. These skills compound, allowing ASH to achieve sustained progression.

Introduction

Developing agents capable of mastering long-horizon, open-ended tasks remains a fundamental challenge in artificial intelligence: long-horizon agents must navigate complex, open-ended worlds over millions of steps, requiring multi-hour planning, fine-grained motor control, and the ability to adapt to new visual contexts. Behavioral Cloning (BC) methods learn a policy from massive offline datasets, but assembling high-quality data at this scale requires domain knowledge and extensive human annotation, and a single trajectory may span hours, making it intractable to model dependencies across the full sequence. Reinforcement Learning (RL) remains heavily dependent on dense reward engineering, and manually designing a reward function for every intermediate milestone is brittle, domain-specific, and labor intensive. To address these limitations, we introduce ASH, an agentic system that follows a dynamic bootstrap loop. When ASH gets stuck, it searches for helpful demonstrations on the internet, and learns from them, using its IDM to label retrieved video and retaining key moments as long-term memory.

ASH

ASH is analogous to a human that plays the game, gets stuck, and finds helpful video on the internet. We deploy N agents under a single shared policy π conditioned on short- and long-term memory. A key-moment classifier, derived from internet data, is used to determine if an observation is a new key moment. When an observation is classified as a new key moment, it gets added to an agent's long-term memory and resets a per-agent stuck-timer. When any timer exceeds threshold Δ, ASH dynamically bootstraps: it uses the agents' trajectories to update the IDM, and to retrieve visually similar internet video. These observation-only videos are used to update the key-moment classifier. The IDM then labels the videos with pseudo-actions, producing trajectories that are used to update π.

Step 1: Inference

  1. Infer N agents in parallel under shared policy π, conditioning each action on per-agent short-term and long-term memory.
  2. On each step, detect new key moments and append them to that agent's long-term memory.
  3. Halt when any agent fails to find a new key moment for Δ steps (stuck).

Step 2: Retrieval

  1. Embed agent trajectories with DINOv2.
  2. Retrieve top-k visually similar videos from the internet corpus per trajectory, and union them into the retrieved dataset.

Step 3: Bootstrapping

  1. Update the key-moment classifier on the retrieved videos to discover new key moments.
  2. Update the IDM on the agents' trajectories.
  3. Update π on the retrieved videos, using the IDM for pseudo-actions and key moments to construct long-term memory.

  Go to Step 1.

Dual memory. In the long-horizon setting, a decision can hinge on information from many steps ago. ASH resolves this with a dual memory: a short-term memory of the most recent observation-action pairs for reactive control, and a long-term memory of observations that are the most recent key moments. Key moments are discovered by applying HDBSCAN clustering over the embeddings of retrieved internet video; each cluster aims to be a single key moment in the environment.

Experiments

We evaluate ASH on two complementary long-horizon environments: Pokémon Emerald, a strategic turn-based RPG with a deep skill tree and dozens of hours of content, and The Legend of Zelda: The Minish Cap, an action-adventure game that demands real-time dexterity and puzzle solving. We evaluate our agents using milestones, which are human-defined markers of progress derived from online walkthroughs. We compare against Voyager+Opus 5, VPT, Offline BC, and a Retrieval-augmented Embodied Agent (RAEA).

Performance on Milestones

Milestone success rates for ASH and baselines in Pokémon Emerald and Legend of Zelda.
Agent progress in Pokémon Emerald (top) and Legend of Zelda (bottom), measured using milestone completion rates. ASH is able to adapt and continue progressing throughout the 8-hour gameplay period. While all methods are able to complete early milestones, only ASH can adapt to new areas, objectives, and mechanics.

Self-improvement is necessary for sustained progression. Over the 8-hour evaluation, ASH reaches milestone 12 in both environments, while no baseline exceeds milestone 8 in Pokémon or 6 in Zelda. VPT and offline BC plateau once the games introduce dynamics that are underrepresented in their training distribution.

ASH adapts to changing dynamics. The Zelda castle entrance is the cleanest example of a distribution-shift moment: the visual dynamics change abruptly, and VPT and offline BC, frozen at training time, devolve into random button-mashing and never exit the castle. ASH's policy also falters, but after a bootstrap is able to continue making progress. The same pattern appears in Pokémon the moment the agent leaves the starting town and encounters the Pokémon battling interface.

Bootstrapping evolves new skills. ASH's initial checkpoint does not exhibit any ability to battle with Pokémon. However, through bootstrapping, ASH becomes an adept battler. After hour 4, ASH wins 87% of the Pokémon battles it engages in. In the Legend of Zelda, ASH kills enemies with its sword in 75% of trajectories. This capability is absent from its initial checkpoint and is not observed in any of our baselines.

Outside vs. inside of the Zelda castle.
Outside (top) vs. inside (bottom) of the Zelda castle: offline policies collapse on this dynamics shift; ASH bootstraps and continues.

Component Ablations and IDM Adaptation

Component ablation on Pokémon Emerald. IDM accuracy across bootstraps.
(Left) Component ablation on Pokémon Emerald: each addition (long-term memory, dynamic bootstrapping) yields a clear gain in milestones completed per GPU hour of online training. Shaded regions are one standard deviation over 4 trajectories per method. (Right) IDM accuracy across bootstraps, evaluated on a test set. The dashed line is the pre-bootstrap initialization checkpoint.

By the end of the evaluation, ASH's long-memory component contributes 2.5 average milestones, and dynamic bootstrapping allows ASH to deploy compute more efficiently by only training when it gets stuck, contributing an additional 1.5 milestones. The IDM also becomes better at labeling environment dynamics across bootstraps: the initialization checkpoint has just 60% accuracy on our test set, whereas our final IDM checkpoint achieves 81%.

Playthrough Examples

Examples of how ASH uses dynamic bootstrapping and long-term memory to overcome roadblocks.

Dynamic bootstrapping example: ASH learns to battle a wild Zigzagoon.
Dynamic bootstrapping example. To complete milestone 2, the player must rescue the Professor from a wild Zigzagoon (Panel 1). To accomplish this, the player must use their starter Pokémon to defeat the Zigzagoon in battle (Panel 2). However, ASH's initial policy does not know how to use the battle interface to command their Pokémon. After being stuck for Δ steps (20 minutes), ASH dynamically bootstraps, and finds relevant examples of battling from internet video (Panel 3). After updating its policy, ASH is able to attack and defeat the Zigzagoon (Panels 4 & 5). After learning how to battle, ASH is unstuck and continues on its journey (Panel 6).
Long-term memory example: ASH chooses the correct path in Oldale Town.
Long-term memory example. When the player arrives in Oldale town (Panel 1), they are presented with 3 possible next paths. Option A: The player heads north to Route 103 to meet their rival, May. Option B: The player has already met May, and should head back to the lab to meet the professor. Or Option C: The player has obtained the Pokédex and should proceed to Route 102. However, short-term memory is insufficient for this decision, as short-term observations are nearly identical. From inspecting the agent's long-term memory (Panel 3), it is clear that the player has just obtained their starter Pokémon, and therefore ASH chooses Option A unambiguously (Panel 4). After meeting May, the player's long-term memory has been updated with their encounter (Panel 5), so it knows to choose Option B and head back to the lab (Panel 6).

Conclusion

We introduced ASH, an agent that self-improves by retrieving and learning from relevant internet video, without reward engineering or human annotation. Across Pokémon Emerald and The Legend of Zelda, ASH continues to adapt beyond the point where behavioral cloning, retrieval-augmented, and foundation-model baselines stall, developing new skills such as battling, catching Pokémon, and using a sword and shield. These results show that self-improving agents are a scalable path toward open-ended, long-horizon learning.

BibTeX

@misc{schneider2026ashagentsselfhonelonghorizon,
      title={ASH: Agents that Self-Hone in Long-Horizon Worlds}, 
      author={Benjamin Schneider and Xavier Schneider and Victor Zhong and Sun Sun},
      year={2026},
      eprint={2605.14211},
      archivePrefix={arXiv},
      primaryClass={cs.AI},
      url={https://arxiv.org/abs/2605.14211}, 
}