Pith. sign in

REVIEW 3 major objections 5 minor 166 references

Learning Task-Sufficient World Models by Synergizing Agentic Exploration and Structured Modeling

T0 review · 3 major / 5 minor · reviewed 2026-07-11 · grok-4.5

Pith's one-line read Agents that actively probe environments and distill only control-relevant latents learn world models that transfer across skills and new tasks.

desk verdict Solid closed-loop recipe for task-sufficient latents with real multi-suite gains; formal MIST claim is oversold relative to the surrogate objectives. read the letter →

arxiv 2607.04409 v1 pith:BUYAGZ6J submitted 2026-07-05 cs.LG

classification cs.LG
keywords worldmodelsmodel-basedRLtask-sufficientrepresentationsminimalsufficientstatesagenticexplorationskilldiscoveryadaptivecurriculumroboticmanipulation
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Standard world models keep too many visual or latent factors that do not matter for control, which hurts sample efficiency and transfer. This paper argues that agents can instead recover task-specific, minimal, and sufficient latent states—called MIST states—by closing a loop between purposeful exploration and structured model learning. The agent actively probes each new environment with skills chosen to expose latent factors that affect observations and rewards, under a curriculum that prioritizes hard tasks. From that data the world model learns a soft mask that keeps only the coordinates needed to predict rewards while discarding the rest. Policies that act only on these compact states reuse control-relevant factors and generalize to new skill combinations and previously unseen tasks on continuous-control and robotic-manipulation benchmarks.

What carries the argument

MIST states: the coordinates of a Dreamer-style latent vector selected by a soft mask that maximizes reward likelihood (sufficiency) while maximizing mutual information with a task descriptor and penalizing L1 mass (minimality); the data that train this mask come from skills chosen by InfoNCE segment separability under an adaptive curriculum.

What would settle it

In a simulator where ground-truth factored states are known, train MIST-WM and check whether linear probes of the masked latents recover every ground-truth parent of the reward (and its one-step parents) with high R-squared while discarding non-intervenable factors; if key reward parents remain unaligned or non-intervenable factors are retained, the recovery claim fails.

Watch

Extended reading notes

Core claim

A closed-loop synergy of agentic active probing (under an adaptive curriculum) and structured world-model learning recovers task-specific minimal sufficient (MIST) latent representations that capture all control-relevant factors; policies conditioned on those representations achieve improved sample efficiency and generalization across skills, object–skill compositions, and previously unseen tasks.

Load-bearing premise

That the practical mask-and-mutual-information objectives, plus contrastive skill selection, actually recover the formal minimal set of reward-relevant latent factors rather than a merely useful but incomplete subspace.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper proposes MIST-WM, a closed-loop framework that couples agentic exploration with structured world-model learning to obtain task-specific, minimal, and sufficient latent states for control. On the agent side, a skill library (DIAYN/METRA) is refined by an InfoNCE segment-separability objective and an adaptive UED-style curriculum to collect informative trajectories. On the model side, Dreamer-v3 latents are gated by a soft mask optimized for reward likelihood (sufficiency) and mutual information with a task descriptor minus an L1 penalty (minimality), with an expandable latent dimension across a task sequence. The authors evaluate representation recovery via linear probes to simulator factors on RoboSuite, single-task sample efficiency on Meta-World and DMControl, and skill/compositional/unseen generalization on RoboSuite, Franka-Kitchen, and Meta-World, with multi-seed results and ablations over exploration, structure terms, backbone, and curriculum.

Significance. If the empirical claims hold, the work is a useful contribution to model-based RL: it targets task-sufficient rather than generic or fully factored latents, and shows that closed-loop data curation plus structure-aware masking can improve sample efficiency and transfer on standard continuous-control and manipulation suites. Strengths include multi-benchmark evaluation (DMControl, Meta-World, RoboSuite, Franka-Kitchen), five-seed reporting, direct R² probing against ground-truth factors, and ablations that isolate exploration, mask/MI/sufficiency terms, backbone, and curriculum. The formal MIST definition (DBN parents of reward and one-step parents) is a clear conceptual target even if the learning objectives are surrogates. The package is of interest to the world-model and unsupervised-skill communities, provided claims about recovering all control-relevant factors are calibrated to the evidence.

major comments (3)
  1. [Abstract; Sec. 3.1, Eqs. (2)–(3); Def. 1; App. B.1] Abstract and Sec. 1 claim empirical recovery of task-sufficient latents that 'capture all control-relevant factors,' with MIST formally defined via DBN parents of reward and their one-step parents (Def. 1; App. B.1 Defs. 2–3). Sec. 3.1 instead optimizes practical surrogates—reward likelihood under a soft mask (Eq. 2) and MI(masked states, gi) − λ_M‖m‖1 (Eq. 3)—and explicitly calls this a 'practical surrogate' for a 'MIST-aligned subspace rather than exact latent DBN variables.' These objectives do not enforce the conditional independencies of Defs. 2–3, do not target one-step dynamics parents of reward parents, and depend on gi (RoBERTa embeddings when available, else rewards). The central claim should be restated as recovery of a useful task-aligned subspace, or the paper should add a direct residual-sufficiency check (e.g., reward prediction error with vs. without discarded coordinates
  2. [Sec. 5, RQ1; Fig. 4; Table A9] Fig. 4 and Table A9 show incomplete factor recovery on the controlled RoboSuite stack: gripper openness R²≈0.21 and size≈0, while cube mass/position/orientation and gripper pose are high. The text notes that static or fine-grained factors are hard to identify with contrastive pairs, yet still asserts that the subspace 'retains what matters for the task.' For the 'all control-relevant factors' claim, the paper should either (i) demonstrate that residual unprobed factors are irrelevant for return under the evaluated policies (e.g., policy performance when those coordinates are ablated or when ground-truth residual factors are added), or (ii) qualify the claim to the factors that are intervenable and reward-linked under the probing design. Incomplete recovery is not fatal to the empirical story, but it currently undercuts the strongest wording.
  3. [Sec. 3.2; App. D.2] The adaptive curriculum and active-probing design rely on environment scaffolding that places objects with controlled factor differences (App. D.2: multi-cube mass/friction/orientation variants; multi-object Meta-World/Kitchen setups). Baselines receive the same phase-one budget, which is fair for comparison, but the method’s ability to expose latent factors may depend on this design. The paper should clarify how much of the representation recovery is attributable to the probing objective (Eq. 5) versus the curated multi-object scenes, and discuss applicability when such scaffolding is unavailable (e.g., single-object or real-world settings without factor-controlled variants).
minor comments (5)
  1. [Fig. 2–3; Table A2] Fig. 2(b) and Fig. 3 are dense; a short caption walkthrough of which modules are frozen vs. updated (cf. Table A2) would help readers follow the closed loop.
  2. [Sec. 2, Def. 1] Notation for MIST indices mixes I^{(t)}_{i,1}, I^{(t)}_{i,2}, and U_i; a single consistent symbol for the selected subspace S^{min}_i in the main text would reduce load.
  3. [Sec. 5, RQ2; Fig. 5] Reacher-Hard is the main single-task underperformance vs. TD-MPC2 (Fig. 5, Table A11); a brief discussion of when structure-aware Dreamer objectives lose to model-free control objectives would strengthen the analysis.
  4. [Sec. 6; App. A] App. A limitations correctly flag simulation-only evaluation and scaling to diffusion world models; a sentence in the main conclusion pointing to these would set expectations for practitioners.
  5. [Abstract; Fig. 7] Typos/consistency: 'task-specific, minimal, andsufficient' spacing in abstract; 'w/o su ciency' in Fig. 7; occasional Dreamer-V3 vs Dreamer-v3 capitalization.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular derivation: formal MIST is defined independently of the learning objectives; claims are empirical recovery via surrogates and external benchmarks, not results forced by construction or self-citation.

full rationale

The paper’s load-bearing chain is methodological and empirical, not a first-principles derivation that collapses into its inputs. Definition 1 and Appendix B.1 define MIST indices from DBN parents of reward and their one-step parents via conditional independence; Section 3.1 then introduces separate practical surrogates (reward likelihood under a soft mask, Eq. 2; MI of masked states with task descriptor minus L1, Eq. 3; InfoNCE segment separability, Eq. 5) and explicitly labels them a “practical surrogate … rather than exact latent DBN variables.” That gap is an approximation/correctness issue, not circularity: the formal object is not defined as the surrogate optimum, and the paper does not claim the surrogate equals Def. 1 by construction. Downstream claims (sample efficiency, skill/compositional/unseen generalization) are evaluated on external suites (DMControl, Meta-World, RoboSuite, Franka-Kitchen) against external baselines (Dreamer-V3, DINO-WM, TD-MPC2, METRA, Plan2Explore, etc.), with representation quality checked by linear probes to simulator ground truth. Related-work citations to prior factored/causal RL (including some author overlap) position the contribution; they are not uniqueness theorems or load-bearing premises that force the empirical outcomes. Task-descriptor MI and curriculum proxies are modeling choices, not fitted parameters renamed as predictions of the same quantity. No self-definitional loop, no fitted-input-as-prediction, no uniqueness imported from the authors, and no renaming of a known closed-form result. Score 0 is therefore appropriate.

Assumptions & free parameters 7 free parameters · 6 assumptions · 3 invented entities

The central empirical claim rests on standard MBRL/POMDP machinery plus several paper-specific modeling choices and many tuned coefficients. Formal MIST is defined cleanly from DBN parents; almost all experimental success depends on surrogate losses, skill libraries, curriculum proxies, and expandable latent heuristics rather than identification theorems.

free parameters (7)
  • minimality L1 coefficient λ_M / minimal-score coef = 1e-3 / 1e-2 by suite
    Balances MI vs sparsity in the mask objective; set to 1e-3 (DMControl) or 1e-2 (others).
  • sufficiency score coefficient = 1e-3 / 1e-2 by suite
    Weights reward-likelihood term used to train the mask.
  • latent expansion increment Δd = 32
    Heuristic growth of Dreamer latent dim when a new task arrives; not identified from data.
  • initial latent dimensionality d1 = 512 or 256
    Suite-specific overparameterized start (512 visual suites, 256 DMControl).
  • MI annealing schedule (α_start, α_end) and sparsity target schedule = cosine anneal; sparsity target 0.35 at adaptation
    Cosine schedules control when MI and gate sparsity become active; chosen for training stability.
  • curriculum temperature η, domain-randomization prob p_DR, ensemble size M = η=0.1, p_DR=0.3, M=5
    UED-style environment selection hyperparameters.
  • skill/contrastive and RL hyperparameters (lr, entropy coef, network sizes, steps) = see Tables A4–A7
    Large set of training knobs for MISL, InfoNCE, SAC/PPO, and world-model training budgets.
assumptions (6)
  • domain assumption Environment is a factored POMDP with expandable latent state factors and a task-specific DBN whose reward parents define control-relevant structure.
    Sec. 2 formal setup; without factorization/expandability the MIST index set is not well-defined as stated.
  • ad hoc to paper Soft-mask sufficiency (reward likelihood) and minimality (MI with task descriptor − L1) are adequate surrogates for formal MIST indices.
    Sec. 3.1 explicitly labels this a practical surrogate for DBN-defined MIST states.
  • ad hoc to paper Skills that maximize InfoNCE separability of observation segments under different latent-factor values yield data informative enough to identify task-relevant factors.
    Sec. 3.2 information-gain construction; no identification guarantee.
  • domain assumption Task descriptors (RoBERTa-encoded instructions when available, else rewards) are available at train and test and carry the right task identity for MI.
    Sec. 3.1; performance of minimality depends on this side information.
  • domain assumption Dreamer-v3 RSSM latents form a usable unstructured basis that can be frozen while masks and skills are learned, then expanded by fine-tuning.
    Sec. 3.1 and Appendix C.4–C.5 backbone assumptions.
  • standard math Standard variational world-model, SAC/PPO, MINE, and MISL training theory apply as used.
    Background optimization tools imported from cited literature.
invented entities (3)
  • MIST states / MIST index set U_i
    purpose: Name the minimal sufficient task-specific latent coordinates (reward parents and their one-step parents) used for policy and reward decoding.
    Definition 1; operationalized via learned masks rather than recovered DBN nodes.
  • MIST-WM closed-loop framework
    purpose: Couple active probing skill library + adaptive curriculum with structured masking world-model learning.
    Core proposed system (Fig. 1, Sec. 3); evaluated only inside this paper's experiments.
  • Active probing skills selected by segment separability
    purpose: Collect trajectories that expose latent factors for structure learning.
    Sec. 3.2; built on MISL but specialized via InfoNCE on latent-factor contrasts.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Learning Task-Sufficient World Models by Synergizing Agentic Exploration and Structured Modeling." pith.science (2026). https://pith.science/paper/BUYAGZ6J

@misc{pith2026260704409,
  author       = {Pith},
  title        = {Pith review of: Learning Task-Sufficient World Models by Synergizing Agentic Exploration and Structured Modeling},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/BUYAGZ6J}},
  note         = {Machine review of arXiv:2607.04409}
}
read the original abstract

Learning and planning in imagination using world models provides an effective paradigm for training agents for decision-making. However, existing approaches often rely on high-dimensional latent spaces or generic visual embeddings that retain many factors irrelevant to control, limiting efficiency and generalization across tasks. To this end, we study how agents can learn world models with representations that are task-specific, minimal, and sufficient for decision-making. We achieve this via a closed-loop synergy between the agent and the world model, in which structured world-model learning distills task-sufficient representations from informative interaction data. On the agent side, agents actively probe the environment to collect informative trajectories that expose task-relevant latent factors, guided by an adaptive curriculum. On the world-model side, we learn structured representations over observations to distill compact, task-sufficient latent states from the collected interaction data. This synergy enables the empirical recovery of task-sufficient latent representations that capture all control-relevant factors. Leveraging these representations, the resulting policies achieve improved sample efficiency and generalization, including generalization across skills, object-skill compositions, and previously unseen tasks on standard continuous-control and robotic-manipulation benchmarks.

Figures

Figures reproduced from arXiv: 2607.04409 by the authors.

Figure 1
Figure 1. Overview on MIST-WM: co-evolve on the agentic ex￾ploration and structured world models. The agent conducts active interventions to curate meaningful behavior data to identify the key latent factors in each new environment under an adaptive cur￾riculum. With the curated data, a structured world model with minimal, sufficient, and task-specific representation is learned. a closed-loop synergy centered on learning task… view at source ↗
Figure 2
Figure 2. (a) Example DBNs that describe the generative process of two tasks. The grey and white nodes indicate observable and latent variables. The blue nodes are the newly expanded variables for Task 2. Red edges are the links from state variables to rewards. For simplicity, we omit the factorization of the state–observation mapping s → o. (b) Computational flow of our proposed framework compared with the Dreamer-based worl… view at source ↗
Figure 3
Figure 3. Method overview. On the agent side, for each new environment, the agent selects skills from its library to perform active probing, collects informative data, under an adaptive curriculum. Conditioned on these informative data, the structured world model is learned to distill the MIST states. For the minimality score, we encourage the mask to retain only the necessary state dimensions by maximizing the mu￾tual inform… view at source ↗
Figures from the paper (3 more)
Figure 5
Figure 5. Figure 5: Results (across 5 seeds) on single-task learning, including robotic manipulation tasks (Meta World) and locomotion (DMControl). Shaded areas indicate the standard errors. Lift Pick & Place Stacking Door-open Handle-press Light Slide MT-1 MT-2 Coffee-push Drawer-open Bu…
Figure 6
Figure 6. Figure 6: Success rate (across 5 seeds) on skill and compositional generalization, including tasks in Stacking (Robosuite), MT-1 & 2 (kitchen), and Door-open, Door-close, Coffee-push (Meta-World). Error bars indicate the standard errors. Curiosity Replay METRA Random Kitchen Met…
Figure 7
Figure 7. Figure 7: Ablation studies. We consider studies on exploration policy (Row 1); World model terms (Row 2); and Backbones and curriculum (Row 3). Pink bars are original MIST-WM and error bars indicate the standard errors. whereas for Meta-World and RoboSuite, they use Soft Actor￾C…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

166 extracted references · 37 linked inside Pith

  1. [1]

    arXiv preprint arXiv:2402.05052 , year=

    Causal representation learning from multiple distributions: A general setting , author=. arXiv preprint arXiv:2402.05052 , year=

  2. [2]

    International conference on machine learning , pages=

    Interventional causal representation learning , author=. International conference on machine learning , pages=. 2023 , organization=

  3. [4]

    Nature Communications , volume=

    Recurrent neural networks with explicit representation of dynamic latent variables can mimic behavioral patterns in a physical inference task , author=. Nature Communications , volume=. 2022 , publisher=

  4. [5]

    International Conference on Machine Learning , pages=

    Ready policy one: World building through active learning , author=. International Conference on Machine Learning , pages=. 2020 , organization=

  5. [6]

    Advances in Neural Information Processing Systems , volume=

    Discovering and achieving goals via world models , author=. Advances in Neural Information Processing Systems , volume=

  6. [7]

    Nature , volume=

    People construct simplified mental representations to plan , author=. Nature , volume=. 2022 , publisher=

  7. [8]

    Neuron , volume=

    Linking connectivity, dynamics, and computations in low-rank recurrent neural networks , author=. Neuron , volume=. 2018 , publisher=

  8. [9]

    Advances in Neural Information Processing Systems , volume=

    Neural foundations of mental simulation: Future prediction of latent representations on dynamic scenes , author=. Advances in Neural Information Processing Systems , volume=

Show all 166 references
  1. [10]

    Proceedings of the Eighth international joint conference on Artificial intelligence-Volume 2 , pages=

    Planning using a temporal world model , author=. Proceedings of the Eighth international joint conference on Artificial intelligence-Volume 2 , pages=

  2. [11]

    ACM Sigart Bulletin , volume=

    Dyna, an integrated architecture for learning, planning, and reacting , author=. ACM Sigart Bulletin , volume=. 1991 , publisher=

  3. [12]

    arXiv preprint arXiv:2304.07193 , year=

    Dinov2: Learning robust visual features without supervision , author=. arXiv preprint arXiv:2304.07193 , year=

  4. [13]

    Artificial intelligence , volume=

    Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning , author=. Artificial intelligence , volume=. 1999 , publisher=

  5. [14]

    International conference on machine learning , pages=

    Mutual information neural estimation , author=. International conference on machine learning , pages=. 2018 , organization=

  6. [15]

    Advances in Neural Information Processing Systems , volume=

    Identifying selections for unsupervised subtask discovery , author=. Advances in Neural Information Processing Systems , volume=

  7. [17]

    arXiv preprint arXiv:2301.04104 , year=

    Mastering diverse domains through world models , author=. arXiv preprint arXiv:2301.04104 , year=

  8. [18]

    arXiv preprint arXiv:2402.16354 , year=

    Language-guided skill learning with temporal variational inference , author=. arXiv preprint arXiv:2402.16354 , year=

  9. [19]

    Advances in Neural Information Processing Systems , volume=

    Disentangled unsupervised skill discovery for efficient hierarchical reinforcement learning , author=. Advances in Neural Information Processing Systems , volume=

  10. [20]

    International conference on machine learning , pages=

    Causal curiosity: Rl agents discovering self-supervised experiments for causal representation learning , author=. International conference on machine learning , pages=. 2021 , organization=

  11. [21]

    International Conference on Machine Learning , pages=

    Citris: Causal identifiability from temporal intervened sequences , author=. International Conference on Machine Learning , pages=. 2022 , organization=

  12. [22]

    Uncertainty in Artificial Intelligence , pages=

    Biscuit: Causal representation learning from binary interactions , author=. Uncertainty in Artificial Intelligence , pages=. 2023 , organization=

  13. [23]

    Advances in Neural Information Processing Systems , volume=

    A tale of two features: Stable diffusion complements dino for zero-shot semantic correspondence , author=. Advances in Neural Information Processing Systems , volume=

  14. [24]

    arXiv preprint arXiv:2410.22325 , year=

    Robots Pre-train Robots: Manipulation-Centric Robotic Representation from Large-Scale Robot Datasets , author=. arXiv preprint arXiv:2410.22325 , year=

  15. [25]

    arXiv preprint arXiv:2310.06824 , year=

    The geometry of truth: Emergent linear structure in large language model representations of true/false datasets , author=. arXiv preprint arXiv:2310.06824 , year=

  16. [26]

    arXiv preprint arXiv:2311.03658 , year=

    The linear representation hypothesis and the geometry of large language models , author=. arXiv preprint arXiv:2311.03658 , year=

  17. [27]

    Advances in Neural Information Processing Systems , volume=

    Reft: Representation finetuning for language models , author=. Advances in Neural Information Processing Systems , volume=

  18. [28]

    arXiv preprint arXiv:2502.12179 , year=

    Identifiable Steering via Sparse Autoencoding of Multi-Concept Shifts , author=. arXiv preprint arXiv:2502.12179 , year=

  19. [30]

    International conference on artificial intelligence and statistics , pages=

    Variational autoencoders and nonlinear ica: A unifying framework , author=. International conference on artificial intelligence and statistics , pages=. 2020 , organization=

  20. [31]

    arXiv preprint arXiv:2402.09236 , year=

    Learning interpretable concepts: Unifying causal representation learning and foundation models , author=. arXiv preprint arXiv:2402.09236 , year=

  21. [32]

    UAI 2022 Workshop on Causal Representation Learning , year=

    Intervention design for causal representation learning , author=. UAI 2022 Workshop on Causal Representation Learning , year=

  22. [34]

    ICLR , year=

    Cross-Entropy Is All You Need To Invert the Data Generating Process , author=. ICLR , year=

  23. [35]

    Advances in Neural Information Processing Systems , volume=

    Optimistic active exploration of dynamical systems , author=. Advances in Neural Information Processing Systems , volume=

  24. [36]

    Artificial intelligence , volume=

    Planning and acting in partially observable stochastic domains , author=. Artificial intelligence , volume=. 1998 , publisher=

  25. [37]

    arXiv preprint arXiv:2506.06658 , year=

    Self-Adapting Improvement Loops for Robotic Learning , author=. arXiv preprint arXiv:2506.06658 , year=

  26. [38]

    Advances in Neural Information Processing Systems , volume=

    Text-aware diffusion for policy learning , author=. Advances in Neural Information Processing Systems , volume=

  27. [39]

    Neural computation , volume=

    Improving generalization for temporal difference learning: The successor representation , author=. Neural computation , volume=. 1993 , publisher=

  28. [40]

    arXiv preprint arXiv:2504.15369 , year=

    Solving new tasks by adapting internet video knowledge , author=. arXiv preprint arXiv:2504.15369 , year=

  29. [41]

    Nature , pages=

    Mastering diverse control tasks through world models , author=. Nature , pages=. 2025 , publisher=

  30. [42]

    International Conference on Machine Learning, PMLR , year=

    Temporal Difference Learning for Model Predictive Control , author=. International Conference on Machine Learning, PMLR , year=

  31. [43]

    Advances in neural information processing systems , volume=

    Mastering atari games with limited data , author=. Advances in neural information processing systems , volume=

  32. [44]

    International Conference on Learning Representations , year=

    Dream to Control: Learning Behaviors by Latent Imagination , author=. International Conference on Learning Representations , year=

  33. [45]

    International Conference on Learning Representations , year=

    Mastering Atari with Discrete World Models , author=. International Conference on Learning Representations , year=

  34. [46]

    Nature , volume=

    Mastering atari, go, chess and shogi by planning with a learned model , author=. Nature , volume=. 2020 , publisher=

  35. [47]

    2024 , url=

    Nicklas Hansen and Hao Su and Xiaolong Wang , booktitle=. 2024 , url=

  36. [49]

    Forty-second International Conference on Machine Learning , year=

    Founder: Grounding foundation models in world models for open-ended embodied decision making , author=. Forty-second International Conference on Machine Learning , year=

  37. [50]

    2025 , url=

    Gaoyue Zhou and Hengkai Pan and Yann LeCun and Lerrel Pinto , booktitle=. 2025 , url=

  38. [52]

    International Conference on Machine Learning , pages=

    Denoised MDPs: Learning World Models Better Than the World Itself , author=. International Conference on Machine Learning , pages=. 2022 , organization=

  39. [53]

    Advances in Neural Information Processing Systems , volume=

    Learning world models with identifiable factorization , author=. Advances in Neural Information Processing Systems , volume=

  40. [54]

    arXiv preprint arXiv:2306.12672 , year=

    From word models to world models: Translating from natural language to the probabilistic language of thought , author=. arXiv preprint arXiv:2306.12672 , year=

  41. [55]

    Artificial Life Conference Proceedings , pages=

    Identifying necessary conditions for open-ended evolution through the artificial life world of chromaria , author=. Artificial Life Conference Proceedings , pages=. 2014 , organization=

  42. [56]

    arXiv preprint arXiv:2107.12808 , year=

    Open-ended learning leads to generally capable agents , author=. arXiv preprint arXiv:2107.12808 , year=

  43. [57]

    arXiv preprint arXiv:2502.08623 , year=

    Robot data curation with mutual information estimators , author=. arXiv preprint arXiv:2502.08623 , year=

  44. [58]

    arXiv preprint arXiv:2506.19121 , year=

    CUPID: Curating Data your Robot Loves with Influence Functions , author=. arXiv preprint arXiv:2506.19121 , year=

  45. [59]

    arXiv preprint arXiv:2403.05110 , year=

    Efficient data collection for robotic manipulation via compositional generalization , author=. arXiv preprint arXiv:2403.05110 , year=

  46. [60]

    The Twelfth International Conference on Learning Representations , year=

    Reward-Free Curricula for Training Robust World Models , author=. The Twelfth International Conference on Learning Representations , year=

  47. [61]

    Advances in neural information processing systems , volume=

    Emergent complexity and zero-shot transfer via unsupervised environment design , author=. Advances in neural information processing systems , volume=

  48. [62]

    Advances in Neural Information Processing Systems , volume=

    Improving environment novelty quantification for effective unsupervised environment design , author=. Advances in Neural Information Processing Systems , volume=

  49. [63]

    Advances in Neural Information Processing Systems , volume=

    Cqm: Curriculum reinforcement learning with a quantized world model , author=. Advances in Neural Information Processing Systems , volume=

  50. [64]

    Probabilistic Graphical Models, M

    Dynamic bayesian networks , author=. Probabilistic Graphical Models, M. Jordan , volume=

  51. [65]

    Artificial intelligence , volume=

    Stochastic dynamic programming with factored representations , author=. Artificial intelligence , volume=. 2000 , publisher=

  52. [66]

    2009 , publisher=

    Causality , author=. 2009 , publisher=

  53. [67]

    International Conference on Learning Representations , year=

    Diversity is All You Need: Learning Skills without a Reward Function , author=. International Conference on Learning Representations , year=

  54. [68]

    Chongyi Zheng and Jens Tuyls and Joanne Peng and Benjamin Eysenbach , booktitle=. Can a. 2025 , url=

  55. [70]

    International Conference on Learning Representations , year=

    Categorical Reparameterization with Gumbel-Softmax , author=. International Conference on Learning Representations , year=

  56. [72]

    Cognition , volume=

    The double-edged sword of pedagogy: Instruction limits spontaneous exploration and discovery , author=. Cognition , volume=. 2011 , publisher=

  57. [73]

    , author=

    Word, thought, and deed: the role of object categories in children's inductive inferences and exploratory play. , author=. Developmental Psychology , volume=. 2008 , publisher=

  58. [74]

    International conference on machine learning , pages=

    Planning to explore via self-supervised world models , author=. International conference on machine learning , pages=. 2020 , organization=

  59. [75]

    arXiv preprint arXiv:2310.06114 , volume=

    Learning interactive real-world simulators , author=. arXiv preprint arXiv:2310.06114 , volume=

  60. [78]

    2025 , eprint=

    Ctrl-World: A Controllable Generative World Model for Robot Manipulation , author=. 2025 , eprint=

  61. [79]

    Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence , pages=

    Dynamic Bayesian multinets , author=. Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence , pages=

  62. [80]

    2024 , url=

    Seohong Park and Oleh Rybkin and Sergey Levine , booktitle=. 2024 , url=

  63. [81]

    2009 , publisher=

    Directional statistics , author=. 2009 , publisher=

  64. [83]

    International Conference on Machine Learning , pages=

    Curious Replay for Model-based Adaptation , author=. International Conference on Machine Learning , pages=. 2023 , organization=

  65. [84]

    Conference on robot learning , pages=

    Meta-world: A benchmark and evaluation for multi-task and meta reinforcement learning , author=. Conference on robot learning , pages=. 2020 , organization=

  66. [85]

    , author=

    Metrics for Finite Markov Decision Processes. , author=. UAI , volume=

  67. [86]

    Software Impacts , volume=

    dm\_control: Software and tasks for continuous control , author=. Software Impacts , volume=. 2020 , publisher=

  68. [88]

    Proceedings of the AAAI Conference on Artificial Intelligence , volume=

    Scalable methods for computing state similarity in deterministic markov decision processes , author=. Proceedings of the AAAI Conference on Artificial Intelligence , volume=

  69. [89]

    International Conference on Learning Representations , year=

    Learning Invariant Representations for Reinforcement Learning without Reconstruction , author=. International Conference on Learning Representations , year=

  70. [93]

    Advances in Neural Information Processing Systems , volume=

    Factored adaptation for non-stationary reinforcement learning , author=. Advances in Neural Information Processing Systems , volume=

  71. [96]

    International conference on machine learning , pages=

    Curl: Contrastive unsupervised representations for reinforcement learning , author=. International conference on machine learning , pages=. 2020 , organization=

  72. [97]

    International Conference on Machine Learning , pages=

    Learning task informed abstractions , author=. International Conference on Machine Learning , pages=. 2021 , organization=

  73. [98]

    Biwei Huang and Fan Feng and Chaochao Lu and Sara Magliacane and Kun Zhang , booktitle=. Ada. 2022 , url=

  74. [99]

    Advances in Neural Information Processing Systems , volume=

    Counterfactual data augmentation using locally factored dynamics , author=. Advances in Neural Information Processing Systems , volume=

  75. [100]

    Proceedings of the 41st International Conference on Machine Learning , pages=

    ACE: off-policy actor-critic with causality-aware entropy regularization , author=. Proceedings of the 41st International Conference on Machine Learning , pages=

  76. [102]

    International conference on machine learning , pages=

    Curiosity-driven exploration by self-supervised prediction , author=. International conference on machine learning , pages=. 2017 , organization=

  77. [103]

    International Conference on Learning Representations , year=

    Exploration by random network distillation , author=. International Conference on Learning Representations , year=

  78. [104]

    PRX Life , volume=

    Intrinsic motivation in dynamical control systems , author=. PRX Life , volume=. 2024 , publisher=

  79. [105]

    Advances in Neural Information Processing Systems , volume=

    Doing experiments and revising rules with natural language and probabilistic reasoning , author=. Advances in Neural Information Processing Systems , volume=

  80. [106]

    arXiv preprint arXiv:2505.22954 , year=

    Darwin Godel Machine: Open-Ended Evolution of Self-Improving Agents , author=. arXiv preprint arXiv:2505.22954 , year=

  81. [107]

    arXiv preprint arXiv:2408.06292 , year=

    The ai scientist: Towards fully automated open-ended scientific discovery , author=. arXiv preprint arXiv:2408.06292 , year=

  82. [108]

    Journal of agricultural research , volume=

    Correlation and causation , author=. Journal of agricultural research , volume=

  83. [109]

    Conference on Robot Learning , pages=

    R3M: A Universal Visual Representation for Robot Manipulation , author=. Conference on Robot Learning , pages=. 2023 , organization=

  84. [111]

    International conference on machine learning , pages=

    Soft actor-critic: Off-policy maximum entropy deep reinforcement learning with a stochastic actor , author=. International conference on machine learning , pages=. 2018 , organization=

  85. [113]

    Advances in Neural Information Processing Systems , volume=

    Scar: Refining skill chaining for long-horizon robotic manipulation via dual regularization , author=. Advances in Neural Information Processing Systems , volume=

  86. [116]

    V-jepa 2: Self-supervised video models enable understanding, prediction and planning

    Mido Assran, Adrien Bardes, David Fan, Quentin Garrido, Russell Howes, Matthew Muckley, Ammar Rizvi, Claire Roberts, Koustuv Sinha, Artem Zholus, et al. V-jepa 2: Self-supervised video models enable understanding, prediction and planning. arXiv preprint arXiv:2506.09985, 2025

  87. [117]

    Back to the features: Dino as a foundation for video world models

    Federico Baldassarre, Marc Szafraniec, Basile Terver, Vasil Khalidov, Francisco Massa, Yann LeCun, Patrick Labatut, Maximilian Seitzer, and Piotr Bojanowski. Back to the features: Dino as a foundation for video world models. arXiv preprint arXiv:2507.19468, 2025

  88. [118]

    Ready policy one: World building through active learning

    Philip Ball, Jack Parker-Holder, Aldo Pacchiano, Krzysztof Choromanski, and Stephen Roberts. Ready policy one: World building through active learning. In International Conference on Machine Learning, pp.\ 591--601. PMLR, 2020

  89. [119]

    Mutual information neural estimation

    Mohamed Ishmael Belghazi, Aristide Baratin, Sai Rajeshwar, Sherjil Ozair, Yoshua Bengio, Aaron Courville, and Devon Hjelm. Mutual information neural estimation. In International conference on machine learning, pp.\ 531--540. PMLR, 2018

  90. [120]

    Dynamic bayesian multinets

    Jeff A Bilmes. Dynamic bayesian multinets. In Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence, pp.\ 38--45, 2000

  91. [121]

    The double-edged sword of pedagogy: Instruction limits spontaneous exploration and discovery

    Elizabeth Bonawitz, Patrick Shafto, Hyowon Gweon, Noah D Goodman, Elizabeth Spelke, and Laura Schulz. The double-edged sword of pedagogy: Instruction limits spontaneous exploration and discovery. Cognition, 120 0 (3): 0 322--330, 2011

  92. [122]

    Stochastic dynamic programming with factored representations

    Craig Boutilier, Richard Dearden, and Mois \'e s Goldszmidt. Stochastic dynamic programming with factored representations. Artificial intelligence, 121 0 (1-2): 0 49--107, 2000

  93. [123]

    Exploration by random network distillation

    Yuri Burda, Harrison Edwards, Amos Storkey, and Oleg Klimov. Exploration by random network distillation. In International Conference on Learning Representations, 2019. URL https://openreview.net/forum?id=H1lJJnR5Ym

  94. [124]

    Towards empowerment gain through causal structure learning in model-based rl

    Hongye Cao, Fan Feng, Meng Fang, Shaokang Dong, Tianpei Yang, Jing Huo, and Yang Gao. Towards empowerment gain through causal structure learning in model-based rl. arXiv preprint arXiv:2502.10077, 2025

  95. [125]

    Scalable methods for computing state similarity in deterministic markov decision processes

    Pablo Samuel Castro. Scalable methods for computing state similarity in deterministic markov decision processes. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 34, pp.\ 10069--10076, 2020

  96. [126]

    Scar: Refining skill chaining for long-horizon robotic manipulation via dual regularization

    Zixuan Chen, Ze Ji, Jing Huo, and Yang Gao. Scar: Refining skill chaining for long-horizon robotic manipulation via dual regularization. Advances in Neural Information Processing Systems, 37: 0 111679--111714, 2024

  97. [127]

    Wow: Towards a world omniscient world model through embodied interaction

    Xiaowei Chi, Peidong Jia, Chun-Kai Fan, Xiaozhu Ju, Weishi Mi, Kevin Zhang, Zhiyuan Qin, Wanxin Tian, Kuangzhi Ge, Hao Li, et al. Wow: Towards a world omniscient world model through embodied interaction. arXiv preprint arXiv:2509.22642, 2025

  98. [128]

    Null counterfactual factor interactions for goal-conditioned reinforcement learning

    Caleb Chuck, Fan Feng, Carl Qi, Chang Shi, Siddhant Agarwal, Amy Zhang, and Scott Niekum. Null counterfactual factor interactions for goal-conditioned reinforcement learning. arXiv preprint arXiv:2505.03172, 2025

  99. [129]

    Emergent complexity and zero-shot transfer via unsupervised environment design

    Michael Dennis, Natasha Jaques, Eugene Vinitsky, Alexandre Bayen, Stuart Russell, Andrew Critch, and Sergey Levine. Emergent complexity and zero-shot transfer via unsupervised environment design. Advances in neural information processing systems, 33: 0 13049--13061, 2020

  100. [130]

    Diversity is all you need: Learning skills without a reward function

    Benjamin Eysenbach, Abhishek Gupta, Julian Ibarz, and Sergey Levine. Diversity is all you need: Learning skills without a reward function. In International Conference on Learning Representations, 2019. URL https://openreview.net/forum?id=SJx63jRqFm

  101. [131]

    Factored adaptation for non-stationary reinforcement learning

    Fan Feng, Biwei Huang, Kun Zhang, and Sara Magliacane. Factored adaptation for non-stationary reinforcement learning. Advances in Neural Information Processing Systems, 35: 0 31957--31971, 2022

  102. [132]

    Metrics for finite markov decision processes

    Norm Ferns, Prakash Panangaden, and Doina Precup. Metrics for finite markov decision processes. In UAI, volume 4, pp.\ 162--169, 2004

  103. [133]

    Learning task informed abstractions

    Xiang Fu, Ge Yang, Pulkit Agrawal, and Tommi Jaakkola. Learning task informed abstractions. In International Conference on Machine Learning, pp.\ 3480--3491. PMLR, 2021

  104. [134]

    Ctrl-world: A controllable generative world model for robot manipulation, 2025

    Yanjiang Guo, Lucy Xiaoyang Shi, Jianyu Chen, and Chelsea Finn. Ctrl-world: A controllable generative world model for robot manipulation, 2025. URL https://arxiv.org/abs/2510.10125

  105. [135]

    Relay policy learning: Solving long-horizon tasks via imitation and reinforcement learning

    Abhishek Gupta, Vikash Kumar, Corey Lynch, Sergey Levine, and Karol Hausman. Relay policy learning: Solving long-horizon tasks via imitation and reinforcement learning. arXiv preprint arXiv:1910.11956, 2019

  106. [136]

    World models

    David Ha and J \"u rgen Schmidhuber. World models. arXiv preprint arXiv:1803.10122, 2 0 (3), 2018

  107. [137]

    Soft actor-critic: Off-policy maximum entropy deep reinforcement learning with a stochastic actor

    Tuomas Haarnoja, Aurick Zhou, Pieter Abbeel, and Sergey Levine. Soft actor-critic: Off-policy maximum entropy deep reinforcement learning with a stochastic actor. In International conference on machine learning, pp.\ 1861--1870. Pmlr, 2018

  108. [138]

    Dream to control: Learning behaviors by latent imagination

    Danijar Hafner, Timothy Lillicrap, Jimmy Ba, and Mohammad Norouzi. Dream to control: Learning behaviors by latent imagination. In International Conference on Learning Representations, 2020. URL https://openreview.net/forum?id=S1lOTC4tDS

  109. [139]

    Mastering atari with discrete world models

    Danijar Hafner, Timothy P Lillicrap, Mohammad Norouzi, and Jimmy Ba. Mastering atari with discrete world models. In International Conference on Learning Representations, 2021. URL https://openreview.net/forum?id=0oabwyZbOu

  110. [140]

    Mastering diverse control tasks through world models

    Danijar Hafner, Jurgis Pasukonis, Jimmy Ba, and Timothy Lillicrap. Mastering diverse control tasks through world models. Nature, pp.\ 1--7, 2025

  111. [141]

    Temporal difference learning for model predictive control

    N Hansen, X Wang, and H Su. Temporal difference learning for model predictive control. In International Conference on Machine Learning, PMLR, 2022

  112. [142]

    Td-mpc2: Scalable, robust world models for continuous control

    Nicklas Hansen, Hao Su, and Xiaolong Wang. Td-mpc2: Scalable, robust world models for continuous control. arXiv preprint arXiv:2310.16828, 2023

  113. [143]

    TD - MPC 2: Scalable, robust world models for continuous control

    Nicklas Hansen, Hao Su, and Xiaolong Wang. TD - MPC 2: Scalable, robust world models for continuous control. In The Twelfth International Conference on Learning Representations, 2024. URL https://openreview.net/forum?id=Oxh5CstDJU

  114. [144]

    People construct simplified mental representations to plan

    Mark K Ho, David Abel, Carlos G Correa, Michael L Littman, Jonathan D Cohen, and Thomas L Griffiths. People construct simplified mental representations to plan. Nature, 606 0 (7912): 0 129--136, 2022

  115. [145]

    Disentangled unsupervised skill discovery for efficient hierarchical reinforcement learning

    Jiaheng Hu, Zizhao Wang, Peter Stone, and Roberto Mart \' n-Mart \' n. Disentangled unsupervised skill discovery for efficient hierarchical reinforcement learning. Advances in Neural Information Processing Systems, 37: 0 76529--76552, 2024

  116. [146]

    Adarl: What, where, and how to adapt in transfer reinforcement learning

    Biwei Huang, Fan Feng, Chaochao Lu, Sara Magliacane, and Kun Zhang. Adarl: What, where, and how to adapt in transfer reinforcement learning. arXiv preprint arXiv:2107.02729, 2021

  117. [147]

    Fine-grained causal dynamics learning with quantization for improving robustness in reinforcement learning

    Inwoo Hwang, Yunhyeok Kwak, Suhyung Choi, Byoung-Tak Zhang, and Sanghack Lee. Fine-grained causal dynamics learning with quantization for improving robustness in reinforcement learning. arXiv preprint arXiv:2406.03234, 2024

  118. [148]

    Ace: off-policy actor-critic with causality-aware entropy regularization

    Tianying Ji, Yongyuan Liang, Yan Zeng, Yu Luo, Guowei Xu, Jiawei Guo, Ruijie Zheng, Furong Huang, Fuchun Sun, and Huazhe Xu. Ace: off-policy actor-critic with causality-aware entropy regularization. In Proceedings of the 41st International Conference on Machine Learning, pp.\ ...

  119. [149]

    Pretrained embeddings as a behavior specification mechanism

    Parv Kapoor, Abigail Hammer, Ashish Kapoor, Karen Leung, and Eunsuk Kang. Pretrained embeddings as a behavior specification mechanism. arXiv preprint arXiv:2503.02012, 2025

  120. [150]

    Curious replay for model-based adaptation

    Isaac Kauvar, Chris Doyle, Linqi Zhou, and Nick Haber. Curious replay for model-based adaptation. In International Conference on Machine Learning, pp.\ 16018--16048. PMLR, 2023

  121. [151]

    Curl: Contrastive unsupervised representations for reinforcement learning

    Michael Laskin, Aravind Srinivas, and Pieter Abbeel. Curl: Contrastive unsupervised representations for reinforcement learning. In International conference on machine learning, pp.\ 5639--5650. PMLR, 2020

  122. [152]

    Roberta: A robustly optimized bert pretraining approach

    Yinhan Liu, Myle Ott, Naman Goyal, Jingfei Du, Mandar Joshi, Danqi Chen, Omer Levy, Mike Lewis, Luke Zettlemoyer, and Veselin Stoyanov. Roberta: A robustly optimized bert pretraining approach. arXiv preprint arXiv:1907.11692, 2019

  123. [153]

    Learning world models with identifiable factorization

    Yuren Liu, Biwei Huang, Zhengmao Zhu, Honglong Tian, Mingming Gong, Yang Yu, and Kun Zhang. Learning world models with identifiable factorization. Advances in Neural Information Processing Systems, 36: 0 31831--31864, 2023

  124. [154]

    Continual reinforcement learning by planning with online world models

    Zichen Liu, Guoji Fu, Chao Du, Wee Sun Lee, and Min Lin. Continual reinforcement learning by planning with online world models. arXiv preprint arXiv:2507.09177, 2025

  125. [155]

    Directional statistics

    Kanti V Mardia and Peter E Jupp. Directional statistics. John Wiley & Sons, 2009

  126. [156]

    Linking connectivity, dynamics, and computations in low-rank recurrent neural networks

    Francesca Mastrogiuseppe and Srdjan Ostojic. Linking connectivity, dynamics, and computations in low-rank recurrent neural networks. Neuron, 99 0 (3): 0 609--623, 2018

  127. [157]

    Discovering and achieving goals via world models

    Russell Mendonca, Oleh Rybkin, Kostas Daniilidis, Danijar Hafner, and Deepak Pathak. Discovering and achieving goals via world models. Advances in Neural Information Processing Systems, 34: 0 24379--24391, 2021

  128. [158]

    Dynamic bayesian networks

    Kevin P Murphy et al. Dynamic bayesian networks. Probabilistic Graphical Models, M. Jordan, 7: 0 431, 2002

  129. [159]

    R3m: A universal visual representation for robot manipulation

    Suraj Nair, Aravind Rajeswaran, Vikash Kumar, Chelsea Finn, and Abhinav Gupta. R3m: A universal visual representation for robot manipulation. In Conference on Robot Learning, pp.\ 892--909. PMLR, 2023

  130. [160]

    Neural foundations of mental simulation: Future prediction of latent representations on dynamic scenes

    Aran Nayebi, Rishi Rajalingham, Mehrdad Jazayeri, and Guangyu Robert Yang. Neural foundations of mental simulation: Future prediction of latent representations on dynamic scenes. Advances in Neural Information Processing Systems, 36: 0 70548--70561, 2023

  131. [161]

    Representation learning with contrastive predictive coding

    Aaron van den Oord, Yazhe Li, and Oriol Vinyals. Representation learning with contrastive predictive coding. arXiv preprint arXiv:1807.03748, 2018

  132. [162]

    METRA : Scalable unsupervised RL with metric-aware abstraction

    Seohong Park, Oleh Rybkin, and Sergey Levine. METRA : Scalable unsupervised RL with metric-aware abstraction. In The Twelfth International Conference on Learning Representations, 2024. URL https://openreview.net/forum?id=c5pwL0Soay

  133. [163]

    Curiosity-driven exploration by self-supervised prediction

    Deepak Pathak, Pulkit Agrawal, Alexei A Efros, and Trevor Darrell. Curiosity-driven exploration by self-supervised prediction. In International conference on machine learning, pp.\ 2778--2787. PMLR, 2017

  134. [164]

    Counterfactual data augmentation using locally factored dynamics

    Silviu Pitis, Elliot Creager, and Animesh Garg. Counterfactual data augmentation using locally factored dynamics. Advances in Neural Information Processing Systems, 33: 0 3976--3990, 2020

  135. [165]

    Recurrent neural networks with explicit representation of dynamic latent variables can mimic behavioral patterns in a physical inference task

    Rishi Rajalingham, Aida Piccato, and Mehrdad Jazayeri. Recurrent neural networks with explicit representation of dynamic latent variables can mimic behavioral patterns in a physical inference task. Nature Communications, 13 0 (1): 0 5865, 2022

  136. [166]

    Improving dictionary learning with gated sparse autoencoders

    Senthooran Rajamanoharan, Arthur Conmy, Lewis Smith, Tom Lieberum, Vikrant Varma, J \'a nos Kram \'a r, Rohin Shah, and Neel Nanda. Improving dictionary learning with gated sparse autoencoders. arXiv preprint arXiv:2404.16014, 2024

  137. [167]

    Reward-free curricula for training robust world models

    Marc Rigter, Minqi Jiang, and Ingmar Posner. Reward-free curricula for training robust world models. In The Twelfth International Conference on Learning Representations, 2024. URL https://openreview.net/forum?id=eCGpNGDeNu

  138. [168]

    Mastering atari, go, chess and shogi by planning with a learned model

    Julian Schrittwieser, Ioannis Antonoglou, Thomas Hubert, Karen Simonyan, Laurent Sifre, Simon Schmitt, Arthur Guez, Edward Lockhart, Demis Hassabis, Thore Graepel, et al. Mastering atari, go, chess and shogi by planning with a learned model. Nature, 588 0 (7839): 0 604--609, 2020

  139. [169]

    Proximal policy optimization algorithms

    John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347, 2017

  140. [170]

    Word, thought, and deed: the role of object categories in children's inductive inferences and exploratory play

    Laura E Schulz, Holly R Standing, and Elizabeth B Bonawitz. Word, thought, and deed: the role of object categories in children's inductive inferences and exploratory play. Developmental Psychology, 44 0 (5): 0 1266, 2008

  141. [171]

    Planning to explore via self-supervised world models

    Ramanan Sekar, Oleh Rybkin, Kostas Daniilidis, Pieter Abbeel, Danijar Hafner, and Deepak Pathak. Planning to explore via self-supervised world models. In International conference on machine learning, pp.\ 8583--8592. PMLR, 2020

  142. [172]

    Dyna, an integrated architecture for learning, planning, and reacting

    Richard S Sutton. Dyna, an integrated architecture for learning, planning, and reacting. ACM Sigart Bulletin, 2 0 (4): 0 160--163, 1991

  143. [173]

    Intrinsic motivation in dynamical control systems

    Stas Tiomkin, Ilya Nemenman, Daniel Polani, and Naftali Tishby. Intrinsic motivation in dynamical control systems. PRX Life, 2 0 (3): 0 033009, 2024

  144. [174]

    dm\_control: Software and tasks for continuous control

    Saran Tunyasuvunakool, Alistair Muldal, Yotam Doron, Siqi Liu, Steven Bohez, Josh Merel, Tom Erez, Timothy Lillicrap, Nicolas Heess, and Yuval Tassa. dm\_control: Software and tasks for continuous control. Software Impacts, 6: 0 100022, 2020

  145. [175]

    What has a foundation model found? using inductive bias to probe for world models

    Keyon Vafa, Peter G Chang, Ashesh Rambachan, and Sendhil Mullainathan. What has a foundation model found? using inductive bias to probe for world models. arXiv preprint arXiv:2507.06952, 2025

  146. [176]

    Wan: Open and advanced large-scale video generative models

    Team Wan. Wan: Open and advanced large-scale video generative models. arXiv preprint arXiv:2503.20314, 2025

  147. [177]

    Denoised mdps: Learning world models better than the world itself

    Tongzhou Wang, Simon Du, Antonio Torralba, Phillip Isola, Amy Zhang, and Yuandong Tian. Denoised mdps: Learning world models better than the world itself. In International Conference on Machine Learning, pp.\ 22591--22612. PMLR, 2022 a

  148. [178]

    Modeling unseen environments with language-guided composable causal components in reinforcement learning

    Xinyue Wang and Biwei Huang. Modeling unseen environments with language-guided composable causal components in reinforcement learning. arXiv preprint arXiv:2505.08361, 2025

  149. [179]

    Founder: Grounding foundation models in world models for open-ended embodied decision making

    Yucen Wang, Rui Yu, Shenghua Wan, Le Gan, and De-Chuan Zhan. Founder: Grounding foundation models in world models for open-ended embodied decision making. In Forty-second International Conference on Machine Learning, 2025

  150. [180]

    Causal dynamics learning for task-independent state abstraction

    Zizhao Wang, Xuesu Xiao, Zifan Xu, Yuke Zhu, and Peter Stone. Causal dynamics learning for task-independent state abstraction. arXiv preprint arXiv:2206.13452, 2022 b

  151. [181]

    Correlation and causation

    Sewall Wright. Correlation and causation. Journal of agricultural research, 20 0 (7): 0 557, 1921

  152. [182]

    Mastering atari games with limited data

    Weirui Ye, Shaohuai Liu, Thanard Kurutach, Pieter Abbeel, and Yang Gao. Mastering atari games with limited data. Advances in neural information processing systems, 34: 0 25476--25488, 2021

  153. [183]

    Meta-world: A benchmark and evaluation for multi-task and meta reinforcement learning

    Tianhe Yu, Deirdre Quillen, Zhanpeng He, Ryan Julian, Karol Hausman, Chelsea Finn, and Sergey Levine. Meta-world: A benchmark and evaluation for multi-task and meta reinforcement learning. In Conference on robot learning, pp.\ 1094--1100. PMLR, 2020

  154. [184]

    Learning invariant representations for reinforcement learning without reconstruction

    Amy Zhang, Rowan Thomas McAllister, Roberto Calandra, Yarin Gal, and Sergey Levine. Learning invariant representations for reinforcement learning without reconstruction. In International Conference on Learning Representations, 2021. URL https://openreview.net/forum?id=-2FCwDKRREu

  155. [185]

    Can a MISL fly? analysis and ingredients for mutual information skill learning

    Chongyi Zheng, Jens Tuyls, Joanne Peng, and Benjamin Eysenbach. Can a MISL fly? analysis and ingredients for mutual information skill learning. In The Thirteenth International Conference on Learning Representations, 2025. URL https://openreview.net/forum?id=xoIeVdFO7U

  156. [186]

    Dino-wm: World models on pre-trained visual features enable zero-shot planning

    Gaoyue Zhou, Hengkai Pan, Yann LeCun, and Lerrel Pinto. Dino-wm: World models on pre-trained visual features enable zero-shot planning. arXiv preprint arXiv:2411.04983, 2024

  157. [187]

    DINO - WM : World models on pre-trained visual features enable zero-shot planning

    Gaoyue Zhou, Hengkai Pan, Yann LeCun, and Lerrel Pinto. DINO - WM : World models on pre-trained visual features enable zero-shot planning. In Forty-second International Conference on Machine Learning, 2025. URL https://openreview.net/forum?id=D5RNACOZEI

  158. [188]

    robosuite: A modular simulation framework and benchmark for robot learning

    Yuke Zhu, Josiah Wong, Ajay Mandlekar, Roberto Mart \' n-Mart \' n, Abhishek Joshi, Soroush Nasiriany, and Yifeng Zhu. robosuite: A modular simulation framework and benchmark for robot learning. arXiv preprint arXiv:2009.12293, 2020

Pith tools

Reviewed July 11, 2026 · model on record in the stance chip above.