- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Spatial Credit Assignment (SCA), a modification of group-relative reinforcement learning for GUI agents. The motivation is that binary success rewards discard useful spatial information where all-miss groups receive no relative reward signal at all. SCA-Residual uses leave-one-out spatial regression over sampled click coordinates to predict reward and constructs credit from the prediction residual, gated by estimated predictive quality. SCA-Prox assigns relative credit based on distance to the annotated target. The method is evaluated using a Qwen2.5-VL-3B backbone on GUI grounding and offline action-prediction benchmarks.
Critical strengths
- The paper identifies a concrete limitation of reward-only group-relative credit that is particularly relevant to GUI grounding. Binary reward treats spatially distinct failures identically, and all-miss groups provide no group-relative learning signal. I find the decomposition into mixed-hit and all-miss regimes conceptually clean. However, many papers tried to solve the same problem.
- The paper makes a meaningful effort to analyze the credit estimator rather than relying only on downstream benchmark accuracy.
Critical weaknesses
-
The main downstream experiments do not isolate the source of the reported improvement. SCA combines two qualitatively different interventions: Residual and Prox. However, the paper does not report matched downstream ablations for Residual-only, Prox-only, or a simple target-distance/dense-reward baseline.
-
The gains are relatively small. For example, the ScreenSpot-Pro average improves from 25.2 for GUI-R1 to 26.1 for SCA, and many individual grounding improvements are around 1 percentage point. Given the possible difference of the training data, this gain is not significant.
-
The baselines are too old. Only Qwen2.5-VL is used as backbone model, and later contributions such as GUI-Actor and SE-GUI are not compared.
Questions for authors
Can the authors provide matched downstream ablations for (i) the base binary GRPO objective, (ii) SCA-Residual only, (iii) SCA-Prox only, (iv) simple target-distance/Gaussian reward shaping, and (v) full SCA, using the same initialization, data, evaluator, compute budget, and preferably matched seeds?