- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
Branch-Prox optimizes action sequences together with a discrete arrival endpoint in a frozen world model. Each endpoint defines a cost combining elapsed time and a penalty for exceeding a latent goal tolerance. The method solves a proximal subproblem for every endpoint, selects the best local update, and checks it through nonlinear backtracking. The paper proves sufficient decrease under stated assumptions and evaluates the planner on selected LeWorldModel and DINO-WM tasks.
Critical strengths
-
Refining endpoints before choosing one addresses a concrete limitation of optimizing only the current winning branch. An earlier endpoint can look worse under the current actions but become preferable after refinement. The analytical example and recorded planning update explain this mechanism clearly.
-
The box-constrained subproblem has a scalar-dual solution, and the descent analysis supports the proposed backtracking procedure. The authors also distinguish this within-solve guarantee from physical task success and report the additional computation required.
Critical weaknesses
-
The benefit of the branch update is less clear than the benefit of the arrival objective. Comparisons with current-branch refinement and same-objective Projected Adam favor Branch-Prox most clearly on TwoRoom. However, Branch-Prox computes eight endpoint gradients per update, compared with one for Adam, and the comparison does not match planning time. The results therefore leave open how much of the advantage comes from the update rule rather than the additional computation.
-
The tasks were selected after inspecting a broader evaluation. The authors disclose this, but without a summary of the omitted results it is difficult to judge where the method helps and where it fails. This matters because the added benefit of the branch update already varies across the displayed tasks.
Questions for authors
-
Does Branch-Prox retain its advantage over same-objective Projected Adam when planning time is matched? The existing budget sweep is useful, but does not settle this comparison.
-
Why is the goal tolerance defined relative to the current latent distance? As this scale changes at each MPC decision, how does the choice affect behavior near the goal compared with a fixed tolerance?
-
Which tasks were included in the broader evaluation, and how were the displayed tasks selected? Please summarize the omitted results and the main failure cases.