- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper analyzes the effects of action subspaces that are unobservable to latent world models and proposes using SVD for constraining action sampling to the observable subspace. The authors of the paper show that sampling-based planners cannot infer the cost of actions along unobservable directions as these directions have no effect on the model’s predicted cost. This potentially can harm the performance of the system as the planner may select arbitrary actions in this unobservable subspace as they uniformly have equivalent cost under the latent model. They validate their approach, showing that by restricting the sampling to the observable subspace, the performance of the planner improves.
Critical strengths
The proposed methodology is straightforward, theoretically grounded, and computationally inexpensive to implement. Performing an SVD of the frozen action encoder correctly identifies the observable action subspace without requiring retraining or fine-tuning of the underlying world model. The analysis on the singular values provides additional insight into which action directions potentially have relatively low sensitivity in the learned representation, and therefore, have little effect on the predicted planning cost. Lastly, there are many existing libraries that efficiently perform the SVD on matrices. For these reasons, the proposed approach is easy to integrate into existing latent world-model planning frameworks with little computational and architectural overhead.
Critical weaknesses
- The proposed methodology has limited improvements over baselines. While the proposed methodology demonstrates statistically significant results on the Cube planning benchmark (Table. 1), the method does not provide the same statistically significant result across the other benchmarks. This limits the generalizability and practical utility of the proposed approach.
- The proposed methodology has limited improvement over execution-only projection. The results in Section 5.2 demonstrate that projecting the selected action into the observable subspace before actuation performs comparably and sometimes better than the proposed subspace-aware sampling method. In cases where the proposed method performs better than the execution-only projection, the results are not statistically significant (many research fields use p <= 0.05). This questions the practical utility of the proposed sampling procedure over the simpler post-optimization projection procedure when it achieves comparable performance.
Questions for authors
Given that the improvement of pruned sampling over execution-only projection is not statistically significant, can the authors provide stronger evidence that doing this pruned sampling will be more beneficial than the simple execution-only projection.
Thank you for the review, and we ran the experiment your questions asked for. The result supports your reading instead of our expectation, and we report it in full below.
Q / W2. Is there stronger evidence that pruned sampling is more useful than execution-only projection?
We do not have such evidence. After the new experiment, we no longer expect it at the standard budget.
The submission compared the two operators only on the visible subspace of W. Its larger gains come from the top eigendirections of the cost-gradient second moment C, where the paper tested only in-loop sampling. We have now run execution-only projection onto those directions, with the ambient CEM planner unchanged. We preregistered the prediction that in-loop sampling would be better on Cube-double. The prediction failed.
On both checkpoints, projection alone gives a gain that is not distinguishable from the in-loop gain. Two comparisons in the paper lean toward the in-loop sampler: +2.3 on Cube at N = 2700, and on PushT a loss of 8.0 points for projection against 2.0 in-loop. Neither difference is resolved (p = 0.12 for both). We will not claim that the sampler is better than the projection.
We believe this result raises the practical value of the paper, for two reasons.
The revision makes two changes that follow from your question.
W1. Limited improvement across benchmarks.
We understand this reading, and our Table 1 caused it. It shows only Cube and PushT, and the second main result is only in Section 5.3. On Cube-double the task tier gains +12.3 points (p < 0.001, all six seeds positive), and the gain holds under MPPI (+16.7) and random shooting (+14.0). The full picture at the standard budget is:
Two checkpoints gain more than 10 points. The other three show no significant change. We agree that the method does not help everywhere, and we do not want to present it as if it did. The paper reports where and why. On Scene the spectrum has no gap, and the criterion says not to cut. On the two full-rank checkpoints the restriction costs nothing measurable. The architectural tier provably cannot lower the best achievable plan (Proposition 4.2), and its measured change is never significantly negative. On Cube the task-tier gain holds for four samplers: +10.7 (CEM), +20.0 (MPPI), +10.7 (shooting), +18.7 (iCEM). On PushT and Two-Room (full rank) the first column prunes the weakest singular directions (Section 4.3). The revision merges these rows and the new results into the main table.
Your question improved the paper. If these answers address your concerns, we would be grateful if you would reconsider your assessment, and we are glad to answer any further question.