- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper presents LAMP, an extension of latent model predictive control that augments TD-MPC2 with an auxiliary state potential for guiding candidate trajectory selection. The potential is trained from adaptive high- and low-reward bin labels on transition endpoints, together with a Lyapunov-inspired non-increase objective on sampled reward-improving transitions. It is learned on detached latent representations without Bellman-return targets. During planning, an EMA copy of the potential produces a scheduled cumulative hinge penalty over latent rollouts, which is subtracted from the original TD-MPC2 candidate scores. The paper also analyzes how the penalty changes MPPI candidate weights, distinguishes absolute score-error reduction from relative ranking-error reduction, and discusses limitations caused by distribution shift, label ambiguity, and misalignment between the potential and return-estimation errors. Experiments are conducted on 28 state-based DeepMind Control Suite tasks using five random seeds, with comparisons against TD-MPC2, DreamerV3, and SAC. The reported gains are most pronounced on the seven Dog and Humanoid locomotion tasks. Additional ablations examine the penalty schedule and the PD hidden-layer parameterization.
Critical strengths
-
LAMP provides a clear and reasonably simple extension to latent MPC. The method adds an auxiliary potential and a planning-time hinge penalty while retaining the TD-MPC2 world model, value targets, and candidate sampler. The use of detached latents gives the auxiliary a clear optimization role: it changes action selection without directly modifying the backbone’s representation or return-learning objectives.
-
The evaluation covers a reasonably broad set of control tasks. The paper evaluates LAMP on 28 DMControl tasks with five random seeds and reports both aggregate and per-task learning curves. The separate analysis of the seven Dog and Humanoid locomotion tasks is useful because this is where the reported differences from TD-MPC2 are most visible. The paper also reports a modest training-time overhead and uses shared LAMP-specific hyperparameters across the benchmark.
Critical weaknesses
-
The methodological novelty is not sufficiently differentiated from existing planning extensions. The central contribution is an auxiliary reward-bin-supervised potential combined with a scheduled hinge penalty on TD-MPC2 rollouts. The paper itself relates these ingredients to prior work on Lyapunov-inspired structure, reward shaping, and model-based planning, but it does not clearly establish a distinct algorithmic principle beyond their combination. In addition, recent alternatives discussed in the related-work section, including TD-M(PC)2, MRS.Q, EfficientTDMPC, and Dream-MPC, are not included as experimental baselines. Therefore, the paper does not establish whether LAMP offers a meaningful advantage over other recent approaches to model-based planning errors.
-
The experiments do not isolate the source of the reported performance gains. The main results evaluate episode return, but do not directly measure candidate-score calibration, pairwise ranking accuracy, or the error-alignment conditions used in the analysis. The two-task diagnostics in Figure 1 provide motivation but do not establish that the proposed penalty corrects the relevant errors across the benchmark. The ablations compare a dynamic versus constant penalty schedule and the PD hidden-layer parameterization against a matched MLP, but they do not independently remove the decrease objective, remove the reward-bin classification term, or compare against a penalty derived directly from the existing reward head. Consequently, the experiments demonstrate the behavior of the complete configuration without providing a clear causal explanation for why it improves performance.
-
The scope and robustness of the proposed state potential remain limited. The potential is state-only and is trained from immediate reward-bin labels. When reward depends strongly on the action, the same latent state can be associated with conflicting high- and low-reward transition labels. Similarly, a low-reward transition may be necessary for reaching a valuable future state. The paper acknowledges these limitations, but does not report label-consistency diagnostics, sensitivity to the reward thresholds or penalty strength, or performance across different planning horizons and reward scales. Evaluation is also limited to state-based DMControl tasks and a single TD-MPC2 backbone, so the generality of the approach to other latent MPC methods, visual observations, or more complex environments is not established.
Questions for authors
-
Can the authors provide ablations that separately remove the reward-bin classification term and the decrease term, while also comparing against a penalty constructed from the existing TD-MPC2 reward head?
-
Can the authors directly evaluate whether LAMP improves candidate selection, for example through candidate-return calibration, pairwise ranking accuracy, or the centered score-error criterion discussed in the analysis?
-
How sensitive are the results to the penalty weight, threshold , reward-bin thresholds, schedule milestones, and planning horizon? Are the reported gains robust across different reward scales?
-
Can the authors compare LAMP with the recent planning alternatives discussed in Section 2, or clarify which properties of those methods are complementary to LAMP?