WebSTAR: Scalable Data Synthesis for Computer Use Agents with Step-Level Filtering (2026.acl-long)
Copied to clipboard
| Challenge: | Existing datasets rely on human demonstrations, limiting scalability. |
| Approach: | They propose a scalable data synthesis pipeline that transforms noisy rollouts into reliable supervision without human annotation. |
| Outcome: | The proposed pipeline transforms noisy rollouts into reliable supervision without human annotation. |
Similar Papers
Explorer: Scaling Exploration-driven Web Trajectory Synthesis for Multimodal Web Agents (2025.findings-acl)
Copied to clipboard
Vardaan Pahuja, Yadong Lu, Corby Rosset, Boyu Gou, Arindam Mitra, Spencer Whitehead, Yu Su, Ahmed Hassan Awadallah
| Challenge: | Recent success in large multimodal models (LMMs) has sparked promising applications of agents capable of autonomously completing complex web tasks. |
| Approach: | They propose a scalable recipe to synthesize the largest and most diverse trajectory-level dataset to date. |
| Outcome: | The proposed model synthesizes the largest and most diverse trajectory-level dataset to date, with 94K successful multimodal web trajectories, 720K screenshots, and 33M web elements. |
GTA: Generating Long-horizon Tasks for Web Agents at Scale (2026.acl-long)
Copied to clipboard
Tenghao Huang, Kung-Hsiang Huang, Prafulla Kumar Choubey, Yilun Zhou, Muhao Chen, Jonathan May, Chien-Sheng Wu
| Challenge: | Existing benchmarks provide only coarse start–goal annotations without intermediate trajectories . Existing frameworks provide no supervision over the agent's latent decision process . |
| Approach: | They propose a framework that integrates crawling, retrieval-based seeding, in-context generation and automated quality control to produce realistic tasks paired with executable trajectories. |
| Outcome: | The proposed framework decouples crawling from generation for greater efficiency and ensures dense supervision through deterministic replays and systematic validation. |
From Off-Policy to On-Policy: Enhancing GUI Agents via Bi-level Expert-to-Policy Assimilation (2026.acl-long)
Copied to clipboard
| Challenge: | Vision-language models are increasingly deployed as computer-use agents that operate desktops and browsers. |
| Approach: | They propose a method that turns static expert traces into policy-aligned guidance . they propose RLVR with a per-task, dynamically updated cache to decompose planning and execution . |
| Outcome: | The proposed model improves UITARS1.5-7B success from 22.87% to 32.13% on OSWorld-Verified and raises a held-out split from 5.74% to 10.30% on MMBench-GUI and Online-Mind2Web. |
HelpSteer3: Human-Annotated Feedback and Edit Data to Empower Inference-Time Scaling in Open-Ended General-Domain Tasks (2025.acl-long)
Copied to clipboard
Zhilin Wang, Jiaqi Zeng, Olivier Delalleau, Daniel Egert, Ellie Evans, Hoo-Chang Shin, Felipe Soares, Yi Dong, Oleksii Kuchaiev
| Challenge: | Inference-Time Scaling is critical to the success of recent models such as OpenAI o1 and DeepSeek R1 . however, many techniques require tasks to have answers that can be verified . |
| Approach: | They use data to train dedicated Feedback and Edit Models capable of inference-time scaling for open-ended tasks. |
| Outcome: | The proposed model can reach SoTA performance on Arena Hard at 92.7 as of 5 Mar 2025. |
Procedural Environment Generation for Tool-Use Agents (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to curation of tool-use training data are non-interactive and/or non-compositional. |
| Approach: | They propose a pipeline for the procedural generation of interactive tools and compositional tool-use data. |
| Outcome: | The proposed pipeline improves on a range of tool-use benchmarks and sets the new SoTA for two metrics on the NESTFUL dataset. |
WebSynthesis: World Model-Guided Monte Carlo Tree Search for Efficient WebAgent Trajectory Synthesis (2026.acl-long)
Copied to clipboard
| Challenge: | Recent advances in large language models have enabled increasingly capable web agents . however, training such agents at scale still relies on high-quality interaction trajectories that are difficult to obtain at scale. |
| Approach: | They propose a framework for scalable trajectory synthesis that simulates state transitions without network dependencies and integrates Monte Carlo Tree Search to enable reversible exploration over the simulated state space. |
| Outcome: | Experiments on WebArena, WebVoyager, and Mind2Web-Online show that agents trained exclusively on synthesized trajectories outperform those trained on real-world data. |
Anchor: Branch-Point Data Generation for GUI Agents (2026.acl-long)
Copied to clipboard
| Challenge: | Existing GUI agents for real desktop environments require large amounts of high-quality interaction data, but collecting human demonstrations is expensive. |
| Approach: | They propose a framework that bootstraps scalable desktop supervision from seed demonstrations. |
| Outcome: | Experiments on standard desktop benchmarks show that the framework improves on zero-shot agents and representative synthesis baselines. |
ChartVerse: Scaling Chart Reasoning via Reliable Programmatic Synthesis from Scratch (2026.acl-long)
Copied to clipboard
Zheng Liu, Honglin Lin, Xiaoyang Wang, Xin Gao, Yu Li, Mengzhang Cai, Yun Zhu, Zhanping Zhong, Qizhi Pei, Zhuoshi Pan, Xiaoran Shang, Conghui He, Bin Cui, Wentao Zhang, Lijun Wu
| Challenge: | Existing open-source vision language models lack high-quality training data for chart reasoning . current models are simplistic and repetitive, while associated QA pairs are prone to hallucinations . |
| Approach: | They propose a framework to synthesize complex charts and reliable reasoning data from scratch. |
| Outcome: | Experimental results show that ChartVerse-8B surpasses existing models in QA and difficulty . lack of high-quality training data hampers development of open-source models . |
RaDA: Retrieval-augmented Web Agent Planning with LLMs (2024.findings-acl)
Copied to clipboard
| Challenge: | Agents powered by large language models inherit important limitations such as the restricted context length, dependency on human-engineered exemplars, and insufficient generalization. |
| Approach: | They propose a novel planning method for Web agents that disentangles planning into two stages: for a new given task, it decomposes tasks into high-level subtasks; and then iteratively synthesizes actions based on dynamically retrieved exemplars. |
| Outcome: | The proposed method decomposes tasks into high-level subtasks and iteratively synthesizes actions based on dynamically retrieved exemplars. |
WebCoT: Enhancing Web Agent Reasoning by Reconstructing Chain-of-Thought in Reflection, Branching, and Rollback (2025.findings-emnlp)
Copied to clipboard
Minda Hu, Tianqing Fang, Jianshu Zhang, Jun-Yu Ma, Zhisong Zhang, Jingyan Zhou, Hongming Zhang, Haitao Mi, Dong Yu, Irwin King
| Challenge: | Web agents powered by Large Language Models lack the ability to perform in uncertain web environments. |
| Approach: | They propose to reconstruct web agents' reasoning skills into chain-of-thought rationales by fine-tuning their LLM backbone into a web-based model. |
| Outcome: | The proposed approach significantly improves the agent self-improving benchmark OpenWebVoyager, demonstrating that it can be used to improve the agent's reasoning skills. |