Zero-shot World Models via Search in Memory

Federico Malato, Ville Hautamäki
10/17/2025
cs.LG

No official code found. Best implementation: fmalato/zero_shot_world_models (3 stars, last commit 2025-10-15).

Abstract

World Models have vastly permeated the field of Reinforcement Learning. Their ability to model the transition dynamics of an environment have greatly improved sample efficiency in online RL. Among them, the most notorious example is Dreamer, a model that learns to act in a diverse set of image-based environments. In this paper, we leverage similarity search and stochastic representations to approximate a world model without a training procedure. We establish a comparison with PlaNet, a well-established world model of the Dreamer family. We evaluate the models on the quality of latent reconstruction and on the perceived similarity of the reconstructed image, on both next-step and long horizon dynamics prediction. The results of our study demonstrate that a search-based world model is comparable to a training based one in both cases. Notably, our model show stronger performance in long-horizon prediction with respect to the baseline on a range of visually different environments.

View on arXivView PDF

Code Implementations(1)

Implementation of the paper "Zero-shot World Models via Search in Memory", accepted at NeurIPS 2025.

30PythonOct 15, 20251 years ago

Similar Papers

Cite this paper

@article{malato2025zeroshot,
  title  = {Zero-shot World Models via Search in Memory},
  author = {Federico Malato and Ville Hautamäki},
  year   = {2025},
  eprint = {2510.16123},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.16123v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2510.16123.svg)](https://codeofpaper.com/paper/2510.16123)

Discussion