WebClipper: Efficient Evolution of Web Agents with Graph-based Trajectory Pruning
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911660252332032 |
|---|---|
| author | Wang, Junjie Xie, Zequn Yang, Dan Feng, Jie Shen, Yue Sun, Duolin Long, Meixiu Jiao, Yihan Tan, Zhehao Wang, Jian Wei, Peng Gu, Jinjie |
| author_facet | Wang, Junjie Xie, Zequn Yang, Dan Feng, Jie Shen, Yue Sun, Duolin Long, Meixiu Jiao, Yihan Tan, Zhehao Wang, Jian Wei, Peng Gu, Jinjie |
| contents | Deep Research systems based on web agents have shown strong potential in solving complex information-seeking tasks, yet their search efficiency remains underexplored. We observe that many state-of-the-art open-source web agents rely on long tool-call trajectories with cyclic reasoning loops and exploration of unproductive branches. To address this, we propose WebClipper, a framework that compresses web agent trajectories via graph-based pruning. Concretely, we model the agent's search process as a state graph and cast trajectory optimization as a minimum-necessary Directed Acyclic Graph (DAG) mining problem, yielding pruned trajectories that preserve essential reasoning while eliminating redundant steps. Continued training on these refined trajectories enables the agent to evolve toward more efficient search patterns and reduces tool-call rounds by about 20% while improving accuracy. Furthermore, we introduce a new metric called F-AE Score to measure the model's overall performance in balancing accuracy and efficiency. Experiments demonstrate that WebClipper compresses tool-call rounds under excellent performance, providing practical insight into balancing effectiveness and efficiency in web agent design. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_12852 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | WebClipper: Efficient Evolution of Web Agents with Graph-based Trajectory Pruning Wang, Junjie Xie, Zequn Yang, Dan Feng, Jie Shen, Yue Sun, Duolin Long, Meixiu Jiao, Yihan Tan, Zhehao Wang, Jian Wei, Peng Gu, Jinjie Artificial Intelligence Deep Research systems based on web agents have shown strong potential in solving complex information-seeking tasks, yet their search efficiency remains underexplored. We observe that many state-of-the-art open-source web agents rely on long tool-call trajectories with cyclic reasoning loops and exploration of unproductive branches. To address this, we propose WebClipper, a framework that compresses web agent trajectories via graph-based pruning. Concretely, we model the agent's search process as a state graph and cast trajectory optimization as a minimum-necessary Directed Acyclic Graph (DAG) mining problem, yielding pruned trajectories that preserve essential reasoning while eliminating redundant steps. Continued training on these refined trajectories enables the agent to evolve toward more efficient search patterns and reduces tool-call rounds by about 20% while improving accuracy. Furthermore, we introduce a new metric called F-AE Score to measure the model's overall performance in balancing accuracy and efficiency. Experiments demonstrate that WebClipper compresses tool-call rounds under excellent performance, providing practical insight into balancing effectiveness and efficiency in web agent design. |
| title | WebClipper: Efficient Evolution of Web Agents with Graph-based Trajectory Pruning |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2602.12852 |