arXiv AI

When and What to Teach: Budget-Aware Online Adaptation for Web Agents

Hugging Face Trending Papers
Jun 1

OpenWebRL: Demystifying Online Multi-turn Reinforcement Learning for Visual Web Agents

Building capable visual web agents requires long-horizon reasoning, precise grounding, and robust interaction with dynamic real-world websites. Despite rapid progress, the strongest systems remain largely proprietary, while open agents still depend heavily on supervised post-training over large collections of curated web trajectories.

arXiv AI
Sep 10

SCAFFOLD: Self-Improving Web Agents via Recursive Parametric Skill Abstraction

SCAFFOLD is a self‑improving framework for visual web agents that automatically induces parametric, executable skills from successful trajectories and organizes them into a recursively composed hierarchy. It compresses the skill library using a minimum‑description‑length criterion and behavioral equivalence checks, and periodically distills these skills back into model weights to internalize the abstractions. Experiments on WebArena, VisualWebArena, and Online‑Mind2Web show that SCAFFOLD raises success rates by 11.1–17.2 absolute points over the best skill‑augmented baseline and continues to improve across five self‑improvement iterations without collapsing the library.

By Bowei He, Xiaokun Zhang, Meng Ding, Xue Liu
arXiv AI
Aug 11

WebChoreArena: Evaluating Web Browsing Agents on Realistic Tedious Web Tasks

arXiv:2506. 01952v2 Announce Type: replace-cross Abstract: Powered by large language models (LLMs), web browsing agents operate graphical user interfaces in a human-like manner, offering a transparent and general framework for automating web-based tasks.

By Atsuyuki Miyai, Zaiying Zhao, Kazuki Egashira, Atsuki Sato, Tatsumi Sunada, Shota Onohara, Hiromasa Yamanishi, Mashiro Toyooka, Kunato Nishina, Ryoma Maeda, Kiyoharu Aizawa, Toshihiko Yamasaki
Hugging Face Trending Papers
Jul 6

Multi-Turn On-Policy Distillation with Prefix Replay

We study on-policy distillation (OPD) for agentic tasks, where an LLM agent interacts with an environment over multiple turns and a student imitates a teacher over these multi-turn interaction histories. Fully online OPD is costly because each update requires fresh student rollouts through the environment and teacher queries at visited histories.

arXiv AI
Aug 28

Naive Prompt Optimization: Rethinking the Need for Complex Prompt Search

Naive Prompt Optimization (NPO) is a lightweight, single‑lineage method that iteratively refines prompts using a teacher model’s rollout feedback. It matches or surpasses the performance of more complex optimizers like GEPA while requiring fewer rollouts, and its advantage grows with stronger teacher models. In interactive games, NPO remains competitive, and prompts optimized by NPO transfer well to other student models within the same family.

By Yuan Chang, Xiaoqi Chen
arXiv Computation and Language
Sep 3

CORAL: An LLM-Native Harness for Production Recommender Systems

CORAL is an LLM‑native harness that automates continual optimization of production recommender systems. It operates in a closed loop: an agent observes system signals, reasons over past decisions, and uses tools—including a numerical optimizer—to reconfigure the recommender while staying within a fixed operating budget. In A/B experiments on two large social platforms, CORAL improved engagement without extra serving cost on one platform and reduced serving cost without harming engagement on the other, demonstrating that a single agentic loop can replace manual engineering for ongoing system tuning.

By Muhammad Rafay Azhar, Yuhang Zhou, Gilbert Jiang, Yuchen Wang, Rahul Sharma, Matthew DeSousa, Jiayi Liu, Xin Guo, Lizhu Zhang, Xiangjun Fan