Sign inGet started
Paper · arXiv

Redundant or Necessary? A Benchmark for Detecting Redundant Steps in Agent Trajectories

Computation cost is a critical challenge for LLM agent systems, as their long-horizon trajectories continuously accumulate computational overhead. While existing studies focus on improving the overall efficiency of agent systems, the efficiency of individual steps remains largely unexplored. In this paper, we propose and formulate a new research problem: \textbf{redundant step detection}, aiming to detect these steps that consume substantial computational resources while contributing little or nothing to task completion. To support this initiative, we introduce \textbf{RedundancyBench}, a new benchmark that contains 1,920 trajectories collected from 6 different LLMs with 3,613 step-level ...

AuthorsLiang Zhu, Bo Yang, Zhinuo Zhou et al.
Primary categorycs.AI
Published28 May 2026
Last updated at source14 October 2026
cs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/d95def1e-3225-4cb3-8c63-5e78e260b09b" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Connected in the knowledge graph

Explore this entry in the graph

Models and datasets referencing this paper

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.