paper-with-me

Papers

ProCUA-SFT Technical Report

2026-06-15 · Jaehun Jung, Ximing Lu, Brandon Cui, Muhammad Khalifa, Shaokun Zhang, Hao Zhang, Jin Xu, Amala Sanjay Deshmukh, Karan Sapra, Andrew Tao, Yejin Choi, Jan Kautz, Mingjie Liu, Yi Dong arxiv

Training computer-use agents (CUAs) -- models that interact with graphical desktops through screenshots and keyboard/mouse actions -- requires large-scale, diverse trajectory data collected in full desktop environments. The largest public resource, AgentNet (22.5K human trajectories), leads to negative transfer when used for supervised fine-tuning (SFT): continuing training UI-TARS 7B on AgentNet causes OSWorld success rate to fall from 26.3% to 8-10%. We present ProCUA-SFT, a dataset of 3.1M step-level SFT samples distilled from 93K synthetic trajectories across 2,484 application combinations. The dataset is produced by a fully automated pipeline that (i) synthesizes grounded tasks on live desktops seeded with real-world content -- 912 spreadsheets from SpreadsheetBench, approximately 10K permissively-licensed presentations from Zenodo10K, and multi-application OSWorld configs -- and (ii) verifies each task's feasibility through binary precondition checking before rollout. A single VLM (Kimi-K2.5) serves as goal generator, precondition judge, and trajectory executor, eliminating planner-actor capability gaps. Each trajectory is expanded into step-prefix samples that exactly reproduce the context layout seen at inference time. Fine-tuning UI-TARS 7B on ProCUA-SFT for one epoch yields 45.0% on OSWorld -- an 18.7 percentage-point improvement over the base model and over 35% above AgentNet-trained counterparts. A subset of ProCUA was incorporated into the training data for the Nemotron 3 Nano Omni model, contributing to its computer-use capabilities.

📄 PDF Abstract BibTeX arXiv:2606.17321

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Spectral Toolkit of Algorithms for Graphs: Technical Report (2)

2024-06-06 · Peter Macgregor, He Sun

Spectral Toolkit of Algorithms for Graphs (STAG) is an open-source library for efficient graph algorithms. This technical report presents the newly implemented component on locality sensitive hashing, kernel density esti…

ClusteringDensity Estimation

Duplicate Bug Report Detection With a Combination of Information Retrieval and Topic Modeling

2013-04-08 · 27th IEEE/ACM International Conference on Automated Software Engineering 2013 4 · Anh Tuan Nguyen, Tung Thanh Nguyen, Tien N. Nguyen, David Lo 외

Detecting duplicate bug reports helps reduce triaging efforts and save time for developers in fixing the same issues. Among several automated detection approaches, text-based information retrieval (IR) approaches have be…

DescriptiveInformation RetrievalRetrieval

Technical Report: The effect of Input Parameters on Falsification of Cyber-Physical Systems

2022-09-15 · Zahra Ramezani, Knut Åkesson

The aim of this technical report is to investigate the effect of input parameters on the falsification of cyber-physical systems (CPSs).

Spectral Toolkit of Algorithms for Graphs: Technical Report (1)

2023-04-05 · Peter Macgregor, He Sun

Spectral Toolkit of Algorithms for Graphs (STAG) is an open-source library for efficient spectral graph algorithms, and its development starts in September 2022. We have so far finished the component on local graph clust…

ClusteringGraph Clustering

Technical Report with Proofs for A Full Picture in Conformance Checking: Efficiently Summarizing All Optimal Alignments

2025-06-12 · Philipp Bär, Moe T. Wynn, Sander J. J. Leemans

This technical report provides proofs for the claims in the paper "A Full Picture in Conformance Checking: Efficiently Summarizing All Optimal Alignments".

All