- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper proposes MCFV (Minimal Common Field-of-View), a training-free selection rule for multi-view GUI grounding. Given a frozen grounding model, it first predicts a point on the full screenshot, then crops three nested windows with side ratios of 1/8, 1/4 and 1/2 around that point and queries the model on each. MCFV keeps every candidate paired with the view that produced it and selects the finest view whose window contains all candidate points, returning that view’s prediction, which automatically balances detail against context. The same containment structure yields Lazy MCFV, which queries views from coarse to fine and stops as soon as an observed point falls outside the next finer window; the authors prove that it returns exactly the same output as the full rule and that every query it issues is necessary. On ScreenSpot-Pro with GUI-Actor-7B and Qwen2.5-VL-7B, MCFV outperforms mean, medoid and token-confidence aggregation on the same observations and beats UI-Zoomer and AutoFocus with far fewer requests, while Lazy cuts model requests by about 16% with identical outputs.
Critical strengths
The most notable strength is that answer selection and query pruning follow from a single containment structure, with exact guarantees rather than heuristics. The stopping condition of Lazy MCFV is a geometric certificate: Proposition 1 proves that both the coordinate and the selected scale match the full selector, and Proposition 2 shows that any always-correct deterministic algorithm must issue every query Lazy MCFV issues. The experiments confirm this: all 1,581 outputs agree between Full and Lazy execution, whereas confidence-based and agreement-based early stopping on the same recorded predictions alter tens to hundreds of outputs. Lossless pruning of this kind is rare among inference-time acceleration methods.
Critical weaknesses
Weakness 1 Limited novelty. The pipeline is a standard native-anchored multi-scale crop scheme that is essentially the same as existing iterative zoom and multi-view methods (Iterative Narrowing, GUI-Lens, MVP, etc.); what is new is a single containment rule and the early-stopping condition it implies. Propositions 1 and 2 are nearly immediate for nested windows, and the exactness is only relative to the MCFV heuristic itself, which the paper never justifies as a principled proxy for correctness. The gain attributable to the new rule is small: 1.8 to 3.9 points over medoid, and 1.27 points over max token score in the point setting with an interval crossing zero, while most of the improvement comes from cropping itself (a single fixed 1/8 crop already lifts the box setting from 18.47% to 41.56%); Lazy pruning saves only about 16% of requests. The paper also neither compares with nor discusses trained iterative zoom methods such as GUI-Spotlight.
Weakness 2 Questionable evaluation validity. Only one benchmark and two 7B models are used. Appendix B.3 acknowledges that method development used labels from 1,016 of the 1,581 tasks and that the final evaluation reuses the same population with no held-out split, and the intervals are not adjusted for method selection, so the crop ratios and the rule itself may be tuned to this benchmark. All baselines are the authors’ own HF reproductions with mismatched image budgets and prompts; the reproduced UI-Zoomer (39.53%) and MVP (32.64%) fall below a single fixed 1/8 crop, which raises doubts about whether they were properly tuned. Finally, the rule cannot recover from a wrong coarse prediction (Fig. 5b), reverses on large targets, and it remains unknown whether it still helps with stronger grounding models.
Questions for authors
See Weaknesses