- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper introduces a new method named AtomWorld-Mirror for simulating atomic dynamics. Instead of capturing fine-grained events at small time scales, the authors present a world model that operates at a macro scale, predicting atomic changes together with the physical time needed for those changes. The underlying model is described as an adaptation of DreamerV4.
Critical strengths
- The method seems well aligned with the underlying dynamics problem considered in the paper.
Critical weaknesses
As a non-expert in atomic simulation, I assess the paper mainly from a general time-series modeling perspective. From this perspective, I have the following concerns:
-
What is the benefit of the latent space used here? In addition, why use a graph encoder rather than a CNN (or more particularly 3D CNN), given that the main problem operates on a regular lattice? The intuition behind these choices and the adaptations from DreamerV4 is insufficiently explained.
-
The overall framework looks quite complicated, with seven loss terms, each with its own weight. Figure 3 provides component ablations, but how sensitive is the method to these weights, and how were they chosen?
-
The comparisons mainly involve KMC variants and simplified versions of the authors’ own model. I am not convinced that these comparisons sufficiently justify the chosen learning model. Since the method's goal is to learn a stochastic dynamical system on a macro time scale, a diffusion model seems relevant. I believe a discussion of why the diffusion model is not considered here is necessary or better, a direct comparison on the same prediction task, including prediction quality and computational cost.
Questions for authors
See weaknesses.
9 comments
Response to Reviewer WbtK (2/4): what is new relative to DreamerV4 (W1) and loss weights (W2)
What is new relative to DreamerV4. DreamerV4 contributes one general principle: learn a world model and roll it out in latent space. Mirror keeps this principle but changes what the world model models. DreamerV4 imitates an environment frame by frame at a fixed time step. Mirror is built around the critical evolution backbone (Sec. 3.1, Eq. 1): the long-term evolution of an atomic system is carried by a sparse sequence of key states, such as Cu-cluster growth and connectivity milestones in RPV steel or topology-changing cage swaps in the MD systems, separated by many low-impact micro events. Mirror predicts the next physically reachable backbone state together with the physical time needed to reach it, and skips the micro events in between. This backbone state–time target has no counterpart in DreamerV4, and every component is redesigned around it. These components are the contributions of Mirror:
| Component | DreamerV4 | Mirror (this work) | What it enables |
|---|---|---|---|
| Supervision | rewards and observations from an environment | distillation from a step-wise teacher simulator (KMC or MD) with continuous-time labels (Sec. 4.1) | the latent space inherits the teacher's physical laws |
| State encoding | image frames | graph and equivariant encoder over the lattice, defect graph and active patch (Eq. 12) | cost tied to the candidate patch; a -trained model runs on – |
| Transition | one fixed time step | horizon-conditioned macro transition to the next backbone state, with a path latent, up to 8192 (Eqs. 13–15) | one step replaces 480 micro events on average (Table 7) |
| Output | reconstruction of the full observation | sparse edit on the reachable support with inventory-conserving projection (Eqs. 16–19) | zero reachability and inventory violations |
| Time | step index, no physical clock | path-conditioned expected and realized durations built on the CTMC estimate (Eqs. 20–22) | cumulative clock ratio (Table 6) |
| Decision | action policy | horizon selection in latent space: latent reward and duration heads score each horizon, Eq. 24 picks the largest energy decrease per unit time | each macro step ends at the next key event |
Together, these components turn a generic latent world model into a simulator-to-world-model distillation framework for atomistic state–time evolution. The key difference is that Mirror is designed as a distillation method rather than as a world model of one environment. Step-wise atomistic simulators that provide sparse structural states and physical-time supervision can expose the same teacher interface and be distilled into Mirror (Sec. 4), so the framework carries over readily to new systems and new teachers. DreamerV4 was only the starting point that inspired this design.
W2. Seven loss terms: sensitivity and choice of weights
The seven terms are not seven free knobs. The easiest way to read the loss is to ask what Mirror must output at each macro step. It has two main outputs that the simulation depends on: the structural change, and the time it takes. Every other term either helps the model learn these two outputs or keeps its latent variable well behaved, and the weights follow these roles (Table 1):
| Role | Term | What it teaches the model | Weight |
|---|---|---|---|
| Main output | sparse edit | which sites change, and into which species | 1.0 |
| Main output | expected duration | how long the step takes on average | 1.0 |
| Helper | reward | the energy drop of the step, used to rank horizons (Eq. 24) | 0.5 |
| Helper | latent | the predicted next latent should match the encoding of the true teacher endpoint | 0.5 |
| Helper | projection consistency | the state after the physical projection should match it too | 0.5 |
| Helper | realized duration | the spread of the actual, random duration | 0.25 |
| Regularizer | KL; prior edit; prior latent | the rollout prior must imitate the training posterior, and the model is also trained in the mode it is used in | 0.05; 0.25; 0.25 |
Response to Reviewer WbtK (3/4): weight sensitivity (W2) and why not diffusion (W3)
The weights encode a simple priority. The two main outputs get the full weight of 1.0. Helpers get half weight, because they support the main outputs rather than being the goal. The realized duration gets 0.25 because its target is random by nature: even a perfect model cannot predict a single random draw, so a larger weight would mostly add noise to training. The KL weight is small (0.05), the usual choice for latent-variable models: large enough for the prior to learn from the posterior, small enough not to erase the path information carried by the latent.
Sensitivity. Fig. 3 already covers the most extreme setting of each weight. Across both Cu concentrations and all four temperatures, removing a term degrades the failure metric that term is responsible for (for example, removing the duration losses raises the time error), while the full model stays best. The weights therefore matter where they should, and the full configuration is not a fragile optimum: the same architecture and training loop carry over to KMC and MD teachers on five systems (Sec. 5.1, Appendix D).
W3. Diffusion models: discussion and direct comparison
Diffusion is in fact where Mirror started. DreamerV4, the latent world model that inspired Mirror, is itself a diffusion world model: its dynamics are trained with flow matching, and shortcut forcing reduces sampling to a few denoising steps. We deliberately replaced this diffusion dynamics with a single-pass, horizon-conditioned macro transition, because Mirror is built around one requirement: every macro step must be far cheaper than the micro events it replaces. The comparison the reviewer asks for is therefore also a comparison with the DreamerV4-style design, and it shows that this choice pays off in both quality and cost. The reasons are:
- Target. Mirror is built around the critical evolution backbone (Sec. 3.1, Eq. 1): each macro step goes directly to the next physically reachable key state, and the horizon is chosen in latent space so that the step ends at a key event (Eq. 24). This target is sparse and structured, since only a few sites along the backbone change. A diffusion model treats the endpoint as a generic high-dimensional sample and spends its denoising steps on every candidate site, including the many low-impact micro events that Mirror deliberately skips.
- Cost. Even with shortcut forcing, a diffusion world model needs several network passes per prediction, and Mirror must score every candidate horizon at every macro step. Mirror needs exactly one forward pass per horizon.
- Physical constraints. Mirror decodes a sparse edit on the reachable support and projects it inside the loop. A diffusion model samples all candidate sites and can only be corrected afterwards.
- Physical time. Mirror's duration head is built on the CTMC estimate plus a learned residual (Eq. 20), so the rate dependence on temperature is carried by physics. A diffusion model has to learn the time scale from data alone, which generalizes poorly to unseen temperatures.
Response to Reviewer WbtK (1/4): latent space and graph encoder (W1)
Thank you for the review and for noting that the method is well aligned with the underlying dynamics problem. Below we explain the design choices behind the latent space and the graph encoder (W1) and the loss weighting (W2), and we report a direct comparison with a conditional diffusion model on the same prediction task, covering both quality and cost (W3). Since the submission we have continued to iterate on Mirror, and the new results will be included in the revised paper.
W1. Latent space, graph encoder, and adaptations from DreamerV4
Why a latent space. The latent space is where the teacher's physics lives inside Mirror. Training distills the atomistic laws encoded in the teacher simulator, namely which local events are possible, how fast they occur and how the energy changes, into Mirror's latent space, and aligns that space with the atomic physical world: the encoder maps a configuration to zt, the macro dynamics predict where the system will be after k events, and the latent and projection-consistency losses tie this prediction to the encoding of the true teacher endpoint (Eq. 23). Once the latent space is aligned with the physics, Mirror evolves the system directly in it, and there it learns and selects the transitions that truly matter, the key events of the evolution backbone, instead of replaying every low-impact micro event. This selection itself happens in latent space: the reward and duration heads score each candidate horizon from the latent states, and Eq. 24 picks the one with the largest predicted energy decrease per unit time. Three concrete consequences follow.
Why a graph encoder rather than a 3D CNN.