- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies sampling-budget allocation for flow-matching robot manipulation policies. Existing methods usually use the same number of function evaluations (NFE) at every policy call, but free-space motion, approach, contact, and precision manipulation may need different amounts of sampling computation. The authors introduce counterfactual state branching, which restores the same simulator state, policy history, and sampler noise, changes the NFE only at selected calls, and compares success and computation under a common continuation budget. They use these paired outcomes to train FlowBudgetAllocator (FBA), which selects the sampling budget from the current history while keeping the action policy frozen. Experiments show that budget responses vary strongly across policies and decision states, and that uniformly increasing NFE throughout an episode does not always improve closed-loop success and can even reduce it. FBA achieves good success and latency with lower sampling budgets in simulation and on a real robot, but strict counterfactual state branching is implemented only in simulation, while the real-robot results depend on scene-specific offline adaptation data.
Critical strengths
- The problem is meaningful. Keeping the action policy at a fixed NFE throughout an episode is not always optimal, so this problem is worth studying.
- The design of FlowBudgetAllocator (FBA) for adaptive sampling-budget allocation is generally reasonable, and the experiments show some effect.
Critical weaknesses
W1. A testbed that saves and restores the robot or simulator state at a given time is already supported by the underlying systems of many simulators. The technical contribution here is therefore mainly to package an existing capability into an experimental framework for budget interventions. Besides, counterfactual state branching seems difficult to deploy on the real robot. To address this limitation, the authors first train FBA on simulation tasks and then offline fine-tune it with real-robot data, but this raises concerns about the generalization ability and ease of use of the method.
W2. The authors find that “uniformly higher budgets often fail to improve closed-loop success or degrade it” and give some explanations, but the explanation is not fully convincing and the theory is not sufficiently rigorous. For example, “Expert-state probes characterize changes in mean-action agreement and sampling variance alongside numerical refinement” seems to explain this phenomenon. The authors roughly argue that there are two types of error: the model's action error relative to the expert action, and the error caused by using a small number of integration steps. If the latter happens to cancel the former, the total error is reduced. This seems accidental, because the two errors could also add together and make the result worse.
Questions for authors
-
For weakness 1: When counterfactual states cannot be restored precisely on the real robot, how can the authors show that FBA trained in simulation and offline fine-tuned with real-robot data generalizes to real scenes with reasonable data and deployment costs?
-
For weakness 2: Can the authors provide a more rigorous theory or controlled experiments showing that the relationship between finite-step integration error, model action error relative to the expert, action-mean bias, and sampling variance is sufficient to explain why a higher NFE can sometimes reduce closed-loop success?