- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper introduces TierCEM, a variant of the Cross-Entropy Method (CEM) for optimisation problems with conflicting, priority-ordered constraints. Unlike conventional penalty-based approaches, which require carefully tuned numerical weights to encode constraint importance, TierCEM explicitly specifies a lexicographic ordering over constraints. It sequentially filters candidate solutions by priority; when a constraint eliminates all remaining candidates, it returns to the previous nonempty set and selects candidates that minimise violations of the blocking constraint while preserving all higher-priority constraints.
The paper evaluates TierCEM on two-dimensional navigation and contact-rich Push-T robotic manipulation tasks, comparing it against scalarised CEM, hierarchical scalarised CEM, and constrained cross-entropy (CCE). Experiments using exact simulator states demonstrate that reversing constraint priorities changes which constraint is violated, while prioritising task progress prevents the optimiser from stalling to preserve all constraints. Further experiments using a learned DINO-WM world model and MLP-based constraint predictors show that this behaviour persists under imperfect predictions, although model errors can cause overly conservative behaviour or unsafe violations. Overall, the results support TierCEM as a simple, weight-free mechanism for priority-aware constraint relaxation in sampling-based planning. However, the evaluation is limited to simulated environments and does not establish formal safety guarantees or real-world robotic performance.
Critical strengths
-
Explicit priority-based constraint relaxation. TierCEM integrates lexicographic constraint handling directly into CEM’s elite-selection mechanism, avoiding the need to tune numerical penalty weights to encode constraint priorities. When constraints conflict, it preserves higher-priority constraints and minimises violations of the first lower-priority constraint that cannot be satisfied. This is a practical and clearly articulated contribution that addresses a genuine limitation of scalarised optimisation.
-
Consistent empirical validation across planning settings. Experiments in 2D navigation and Push-T manipulation demonstrate that reversing constraint priorities changes which constraints are violated, including when constraint evaluations rely on a learned world model. Comparisons with scalarised CEM and constrained cross-entropy further illustrate the trade-off between task completion and constraint satisfaction. These results provide convincing evidence that the proposed mechanism behaves as intended in the tested simulated environments, although they do not establish formal safety guarantees or real-world effectiveness.
Critical weaknesses
-
Limited evidence for robustness and safety under learned-model errors: The evaluation of the learned world model shows that TierCEM’s behaviour can deteriorate when predicted constraint margins or dynamics are inaccurate, potentially resulting in constraint violation. Since the method is motivated by prioritising constraints, the absence of stronger evidence characterising when its priority guarantees hold and when model errors undermine them limits the strengths of the conclusions. The paper acknowledges these limitations, but the current evaluation does not establish reliable constraint satisfaction under realistic model uncertainty.
-
Limited scope of empirical validation and uncertain advantage over existing methods. The experiments are confined to simulated navigation and the Push-T manipulation task. Although they demonstrate that TierCEM follows the specified priority ordering, they provide limited evidence that the approach offers a substantial practical advantage over existing constrained or hierarchical optimisation methods across a broader range of problems. In particular, the paper does not establish that its benefits persist in real-world robotics or more diverse settings where constraint conflicts and model errors may be more complex. This limits confidence in the generality and practical significance of the contribution.
Questions for authors
-
Clarification on constraint-priority behaviour under model errors. The method sequentially filters candidates using predicted constraint margins. When using the learned world model, what guarantees, if any, remain that higher-priority constraints are preserved when a lower-priority constraint is relaxed? Given the reported constraint violations under dynamics mismatch, can the authors quantify how prediction errors affect the frequency and severity of higher-priority constraint violations? This would help establish the conditions under which TierCEM’s priority-based behaviour is reliable.
-
Clarification of the empirical advantage over existing methods: The experiments show that TierCEM changes which constraints are violated when their priorities are reversed. Beyond demonstrating that the mechanism behaves as intended, can the authors provide evidence that it achieves a meaningful advantage over the scalarised and constraint CEM baselines in task completion and constraint violations, or robustness across random seeds? In particular, how sensitive are the results to the choice of constraint margins and the sampling budget?