TAP: Efficient Long-Horizon Agent Pruning via Trajectory-Anchored Recovery

Yuanzhe Li, Pengxin Wang, Yuxin Ren, Jianing Deng, Jingtong Hu +3 more
10/6/2026
cs.LG

No confident code implementation found for this paper.

Abstract

Emerging long-horizon agentic tasks require repeated model calls, worsening the inference cost of already-costly language models. While narrow agentic tasks suggest potential for aggressive model pruning without performance drop, empirical results show existing methods proposed for question answering tasks severely degrade task performance when applied to agentic models. We trace this failure to two decisions: what to prune and how to recover. For pruning, one-shot importance estimates fail to track how the pruned model adapts. For recovery, offline distillation covers only teacher prefixes, while full-trajectory on-policy distillation causes student errors to compound across turns. In this work, we propose Trajectory-Anchored Pruning (TAP), the first structural pruning framework for reinforcement learning (RL)-trained agents. TAP couples structural pruning with efficient on-policy recovery, anchoring interactions to teacher trajectories while allowing the student to generate each reasoning-action response. A frozen dense teacher supervises the student's response prefixes, addressing within-response training-inference mismatch while preventing student-induced deviations from propagating across training turns. Instead of one-shot pruning, TAP re-scores channels using gradients of the recovery objective on the recovered student, connecting iterative channel selection to the evolving policy. With 60% of FFN channels removed, TAP retains 99.2% and 88.0% of the dense 7B agents' task success rates on ALFWorld and WebShop, respectively, while reducing GPU time per successful task by approximately 22% and 17%. These results demonstrate effective structural compression of long-horizon agents under a limited recovery budget.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{li2026tap,
  title  = {TAP: Efficient Long-Horizon Agent Pruning via Trajectory-Anchored Recovery},
  author = {Yuanzhe Li and Pengxin Wang and Yuxin Ren and Jianing Deng and Jingtong Hu and Song Wang and Jingdi Chen and Huanrui Yang},
  year   = {2026},
  eprint = {2610.09074},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2610.09074v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2610.09074.svg)](https://codeofpaper.com/paper/2610.09074)

Discussion