- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper addresses the problem of robot learning. To the best of my knowledge, it tries to solve this by trying to understand what are the best ways to group different potential actions. This is tested in HM3D and Habitat.
Critical strengths
None
Critical weaknesses
- Hard to understand the abstract.
- action identity through task-conditioned epistemic consequences
- What does action identity mean?
- What does task-conditioned epistemic consequences mean?
- “for a demand when they induce the same distribution over task-
- projected belief updates”, what does task-projected belief updates mean?
- “epistemic identity repeatedly differs from motor similarity and changes with the demand; a sensor pan and a whole-body yaw fall into the same class in all 20 seeds“, what does fall into the same class mean?
- “satisfying the realized-branch analogue of”, what does realized-branch mean?
- action identity through task-conditioned epistemic consequences
- Unclear beyond the example it gives
- “can pan its camera, yaw its whole body, or take a small step forward”, what are other applications of this approach
- I read the abstract and introduction multiple times and it has been very hard for me to understand the motivation of the work and problem setting (e.g. beyond the initial example, what are other example applications of the problem), the approach (e.g. it is unclear to me why a complex approach is needed when motor similarity seems to be able to handled easily with a cost-based optimizer and some heuristic costs with different motions).
- I feel like for this task, there are much simpler methods. For example, by associating some budget of different actions (can be heuristic, where different motor travel distance is associated to some cost, yaw is some cost…), and then using a LLM planner can solve this. Or a cost-based optimizer and some heuristic costs with different motions.
- It is hard to understand the approach, and how it solves the problem. I had a hard time understanding the first paragraph and what demand is and what task projection is. In the approach, to aid in understanding, it is always helpful to start with some intuitive description of the approach. For example, have some running example, and use that to ground key parts of the approach (for example, demand q, task projection).
- Suspicion of AI-generated text that is not reviewed
- “We separate task-triggered refresh from the three-predictor consensus while keeping the seed-8603 initialization fixed.”
Questions for authors
- Please see above and clarify the abstract and motivation. It has been very hard for me to understand the motivation of the work and problem setting (e.g. beyond the initial example, what are other example applications of the problem), the approach (e.g. it is unclear to me why a complex approach is needed when motor similarity seems to be able to handled easily with a cost-based optimizer and some heuristic costs with different motions).
5 comments
[2/2] Motivation and Supporting Evidence
To W2 and W3: Other applications and motivation
Beyond the corridor example, EAQ may apply to next-best-view selection, where candidate viewpoints can provide similar information about a region, and experimental design, where measurement schemes can induce similar belief updates about a target parameter. These connect to the active perception and experimental design literature discussed in Section 2 (page 3). They are potential applications; the empirical evidence reported in this paper comes from controlled synthetic experiments and Habitat/HM3D settings.
To W3, W4 and Q1: Heuristic costs, optimizers, and LLM planners
Execution costs, such as movement distance or turning cost, can guide action selection. They do not by themselves establish whether two actions provide similar task-relevant information or bound the regret from merging them. EAQ provides this grouping criterion; a planner then selects an action from the representatives.
In Table 1 (page 7), sensor pan and body yaw are separated by the motor partition but belong to the same information-consequence group under both tested tasks in all 20 seeds at .
Table 2 (page 8) and Appendix H (pages 19–20) report the following results in a strongly separated, controlled synthetic setting over 20 seeds:
| Method | Candidates evaluated | Mean normalized regret |
|---|---|---|
| All actions | 64 | 0 |
| Motor grouping | 8 | 0.331 |
| EAQ | 8 | 0 |
Both grouping methods use the same candidate budget and select representatives with the same task-independent cost proxy before evaluating task values. EAQ has no observed regret in any of the 20 seeds. These controlled results illustrate that motor-based grouping can discard valuable candidates at the same evaluation budget.
Our guarantees concern the defined consequence-only utility under the stated assumptions; execution costs and other constraints belong in the subsequent selection problem. We did not evaluate LLM-planner integration, and fewer candidate evaluations do not imply proportional savings in total runtime.
Section 5.4 (pages 9–10) and Appendix M (pages 29–33) now report a 30-step closed-loop evaluation with one-step selection. The visited states contain compressible reference structure, but the current Online EAQ implementation does not improve cumulative proxy utility or reduce model calls relative to Full-7. The common scorer still predicts all seven actions at every step. These results do not establish navigation success or safety.
To W6 and Ethics Concern: AI use and the experimental description
Page 10 of the original manuscript (page 11 of the revision) discloses the use of ChatGPT, Codex, and Claude for feedback on the conceptual framework, experiment design, software implementation, analysis scripts, manuscript writing, and figure preparation, and states the authors' responsibility for the manuscript.
The quoted seed-8603 sentence describes a controlled comparison: all variants start from identical partitions generated by the seed-8603 predictor, so initialization differences do not confound the comparison of refresh and predictor aggregation (Table 4, page 9; Appendix L.2, page 26). We have rewritten the sentence in Section 5.3 (page 8) as: "All ablation variants start from the same seed-8603 partition, so their differences reflect refresh and consensus rather than initialization." Task-triggered refresh with a single predictor reduces pairwise partition error (PPE) from 0.3971 (Static) to 0.3452, matching full Online EAQ on this metric. This supports the paper's attribution of the main improvement in partition agreement to task-triggered refresh.
Thank you for your feedback. We are happy to clarify any remaining points.
Dear Reviewer FYgn,
We hope this revision addresses your concerns. Please let us know if there is anything further we can clarify; we would be happy to discuss any remaining issues.
[1/2] Abstract and Method Clarification
Thank you for identifying points in the abstract, motivation, and method that need clarification, and for suggesting a running example to explain the demand and task projection. We address related comments together below.
To W1 and Q1: Abstract and research question
Given the available information and the current task, we ask which sensing actions can serve as informational substitutes, and how much decision value is lost when one representative replaces the other actions in its group.
We have rewritten the abstract on page 1 around this question and the corridor example from the Introduction:
The revised abstract no longer relies on the five terms you identified. For reference, their meanings in the paper are:
To W5: Demand, task projection, and a running example
Section 3 now opens with the following example before the formal definitions (page 3):
A roadmap immediately after the example identifies the roles of Sections 3.1–3.3: exact equivalence, approximate grouping, and regret/stability conditions. The added examples in Sections 3.1 and 3.2 (page 4) distinguish equality of consequence distributions from operational co-membership at a specified threshold and numerical tolerance.
The example also continues in Section 3.3 (page 5): for a fixed task, a positive separation margin and sufficiently small drift are sufficient for stability; switching tasks changes the projection and requires reconsidering the groups. Online EAQ does not test this condition at runtime.