Accurate and Efficient World Modeling with Masked Latent Transformers

Maxime Burchi, Radu Timofte
7/5/2025
cs.LGcs.AIcs.CV

No official code found. Best implementation: burchim/EMERALD (5 stars, last commit 2026-01-15).

Abstract

The Dreamer algorithm has recently obtained remarkable performance across diverse environment domains by training powerful agents with simulated trajectories. However, the compressed nature of its world model's latent space can result in the loss of crucial information, negatively affecting the agent's performance. Recent approaches, such as $Δ$-IRIS and DIAMOND, address this limitation by training more accurate world models. However, these methods require training agents directly from pixels, which reduces training efficiency and prevents the agent from benefiting from the inner representations learned by the world model. In this work, we propose an alternative approach to world modeling that is both accurate and efficient. We introduce EMERALD (Efficient MaskEd latent tRAnsformer worLD model), a world model using a spatial latent state with MaskGIT predictions to generate accurate trajectories in latent space and improve the agent performance. On the Crafter benchmark, EMERALD achieves new state-of-the-art performance, becoming the first method to surpass human experts performance within 10M environment steps. Our method also succeeds to unlock all 22 Crafter achievements at least once during evaluation.

View on arXivView PDF

Code Implementations(1)

burchim/EMERALDCommunity61%

[ICML 2025] Accurate and Efficient World Modeling with Masked Latent Transformers (EMERALD)

51Shell, PythonJan 7, 20269 months agoNOASSERTION

Similar Papers

Cite this paper

@article{burchi2025accurate,
  title  = {Accurate and Efficient World Modeling with Masked Latent Transformers},
  author = {Maxime Burchi and Radu Timofte},
  year   = {2025},
  eprint = {2507.04075},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.04075v1},
  journal = {ICML 2025 2025}
}

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/2507.04075.svg)](https://codeofpaper.com/paper/2507.04075)

Discussion