- Rating
- 3(+1)
- Confidence
- 2(−1)
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes S-TD-MPC, which directly propagates physical states while recomputing learned latent features at each imagined step. It also introduces MPC-based value targets and selective reanalysis. The main contribution is maintaining competitive control performance while making predicted trajectories available for reward changes and deployment-time constraints. The latent-decoder comparison provides useful evidence for the architectural choice. Although the component ablations and benchmark coverage could be stronger, the results support a practical contribution. I lean toward weak acceptance.
Critical strengths
- The paper addresses a clear limitation of latent TD-MPC models: imagined trajectories are difficult to use for objectives defined in physical coordinates. S-TD-MPC retains competitive performance on challenging control tasks while supporting reward changes and deployment-time constraints without model retraining. This flexibility is more consequential than the modest improvement in average benchmark return.
- The latent-decoder comparison provides meaningful support for direct state propagation. The baseline retains the same planner-based learning and reanalysis framework, but performs substantially worse on the more dynamic Dog tasks. The downstream comparisons further demonstrate that the representation choice matters beyond standard training returns.
Critical weaknesses
- The ablations do not fully separate the architectural and training contributions. The latent-decoder comparison is useful, but the paper does not establish whether auxiliary latent features improve over a comparable state-only model. It also lacks an explicit-state variant trained with the original TD-MPC2 objectives. Consequently, the respective contributions of state propagation, feature augmentation, and planner-based training remain unclear.
- The evidence for prediction quality and generality is limited. The evaluation covers seven tasks from two dynamical systems, without directly reporting one-step or multi-step state prediction errors. Such measurements would be particularly useful because the downstream experiments extend the planning horizon substantially beyond the training horizon. Constraint handling also relies on penalties and exhibits a return–constraint trade-off, so the results should not be interpreted as establishing reliable constraint satisfaction.
Questions for authors
- Do you have results for a state-only variant without auxiliary latent features, using comparable network capacity and the same training procedure? This would clarify the contribution of the combined representation.
- How does the explicit-state architecture perform with the original TD-MPC2 value and policy objectives? This comparison would help distinguish architectural gains from changes to training.
- Can you provide multi-step physical-state prediction errors for S-TD-MPC and the latent-decoder baseline, particularly over the longer horizons used in downstream evaluations? This would help explain the observed differences and assess their practical limits.