- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper proposes PACE, a lightweight executor that grounds next-step plans from a large VLM into GUI actions. It reports low grounding latency and reduced main-model calls and execution time on OSWorld.
Critical strengths
-
The paper addresses a practical bottleneck: high first-token latency in GUI agents.
-
PACE achieves a promising speed–accuracy trade-off, with evaluations covering both standalone grounding and end-to-end task execution.
Critical weaknesses
-
The acceleration mechanism is confusing. Sections 3.1 and 3.4 describe invoking the main VLM at every step before delegation, which would retain its prefill cost. Appendix D.1 instead suggests executing a previously generated plan on the next screenshot without another VLM call. This inconsistency obscures the central mechanism and the reported reduction in model calls.
-
Plan reliability is insufficiently addressed. Under the latter interpretation, the planner predicts the next action before observing the outcome of the current action. Unexpected interface changes can invalidate this plan. Although Appendix D.2 analyzes errors, the paper does not clearly describe how stale plans are detected and rejected before execution. The planner’s own delegation flag provides limited assurance.
-
The contribution appears incremental. The method reduces the frequency of expensive inference rather than improving prefill itself. Its advantage over inference optimizations, such as prefix/KV-cache reuse, remains unclear. If the main idea is to generate an additional plan during an existing call, the paper should also explain why it predicts only one subsequent step and compare against generating several future plans.
Questions for authors
-
Can you provide pseudocode showing exactly which environment steps invoke the main VLM? How should Equations (1)–(3) be reconciled with Appendix D.1?
-
Why generate only one future plan? How does this compare with producing multiple plans per VLM call?
-
How does PACE detect that a plan is no longer valid after the interface changes? What triggers recovery, and what is its latency cost?
-
Is prefix caching enabled in the baselines? Can you separate visual encoding, prefill, and decoding costs to establish the remaining bottleneck?
-
Why does Figure 1 report 16.28 s per step for the 32B model, whereas Table 2 reports 7.29 s for its baseline? Do the models, settings, or timing definitions differ?
-
Appendix E.3 cites ScreenSpot to a 2008 smart-space paper and Android in the Wild to a 2016 text-watermarking paper. Can these be corrected to the relevant ScreenSpot and Android in the Wild sources?