Long Zhang
Author directoryOther people with similar names: Long Zhang, Long Zhang, Long Zhang
Unverified author pages with similar names: Long Zhang
2026
STEP: Success-Rate-Aware Trajectory-Efficient Policy Optimization
Yuhan Chen | Yuxuan Liu | Long Zhang | Pengzhi Gao | Jian Luan | Wei Liu
Findings of the Association for Computational Linguistics: ACL 2026
Yuhan Chen | Yuxuan Liu | Long Zhang | Pengzhi Gao | Jian Luan | Wei Liu
Findings of the Association for Computational Linguistics: ACL 2026
Multi-turn interaction remains challenging for online reinforcement learning. Current GRPO-based methods—either at the trajectory level or the step level—still suffer from fundamental challenges in multi-turn settings: they allocate sampling uniformly across tasks regardless of difficulty, propagate misleading learning signals that penalize correct intermediate actions in failed trajectories, and incur high sample-collection costs under long-horizon environments. Step-level variants (e.g., GIGPO) mitigate some interaction-cost constraints by decomposing trajectories, yet they retain GRPO’s sampling imbalance and still struggle with heterogeneous multi-turn tasks. To address these issues, we propose STEP (Success-rate-aware Trajectory-Efficient Policy Optimization), a framework that dynamically allocates sampling based on per-task success rates and performs fine-grained step-level optimization. STEP maintains a smoothed success-rate record to guide adaptive trajectory resampling, allocating more effort to harder tasks. It then computes success-rate-weighted advantages and decomposes trajectories into step-level samples, followed by a step-level GRPO augmentation that strengthens updates on low-success tasks. Experiments on OSWorld and AndroidWorld show that STEP substantially improves sample efficiency and training stability over both trajectory-level and existing step-level GRPO variants, converging faster and generalizing better under the same sampling budget.
GSAR: Goal-State-Anchor Rewards for Mobile GUI Agents with Self-Evolving Data Synthesis
Long Zhang | Yuhan Chen | Chaoran Zhang | Wanxia Cao | Kun Huang | Pengzhi Gao | Wei Liu | Jian Luan | Chenliang Li | Lixin Zou
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Long Zhang | Yuhan Chen | Chaoran Zhang | Wanxia Cao | Kun Huang | Pengzhi Gao | Wei Liu | Jian Luan | Chenliang Li | Lixin Zou
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Vision-Language Models (VLMs) based GUI agents stand to benefit significantly from online reinforcement learning (RL). However, their training is bottlenecked by two fundamental issues: current data synthesis methods for GUI Agents rely on specific environments and struggle to generate diverse data, while existing evaluators either suffer from limited scalability or provide inaccurate and unreliable reward signals. To overcome these challenges, we introduce GSAR (Goal-State-Anchor Reward), a RL reward framework that supports scalable task generation and delivers reliable reward signals for stable and efficient policy optimization. Our approach features self-evolving data synthesis, which produces multiple environments through task execution and generates diverse tasks and goal states. Complementing this, a state-anchor mechanism automatically annotates task-relevant UI elements in successful goal states as reference anchors. During RL training, these reference anchors provide accurate, scalable reward signals that substantially enhance efficiency. Extensive evaluations demonstrate that our framework achieves over 90% accuracy on offline trajectory verification and performs closest to rule-based methods. Furthermore, agents trained using our reward framework exhibit strong performance on both AndroidWorld and our constructed benchmark, establishing a scalable approach for GUI agent training.