← All papers  /  Oct 3, 2026
Efficiency · Agents

SHarP: Saliency-based Pruning of Agent Harnesses

First page
SHarP: Saliency-based Pruning of Agent Harnesses
The curator’s take

Xinyi Gao, Shiyu Chang (UC Santa Barbara), Kaizhi Qian and Yang Zhang (MIT-IBM Watson AI Lab) and Handong Zhao (Adobe) propose SHarP, which applies neural-network pruning ideas to agent harnesses by ablating each tool, instruction block or mechanism and removing the least useful ones.

Ask this paper

Key points
01

Method. Harnesses are partitioned into modules along existing boundaries, with a tool and its usage instructions kept together. Each module is ablated alone on a development set to measure its performance and token-cost saliency, and modules are pruned by a performance-oriented or efficiency-oriented rule.

02

Redundancy. All four harnesses studied keep comparable performance with at least a 10% token reduction after pruning.

03

OpenHands on GAIA. Success rises from 29.44% with all 27 modules to 35.00% with 24 of them pruned, then falls to 14.44% when all 27 are removed.

04

Other cases. Efficiency-oriented pruning on one harness keeps match rate at 76.2% against 75.8% for the full harness with 39.0% fewer tokens. In one case model calls drop from 43 to 14 and token cost by 74% at the same 100% match rate.

Abstract

Agent harnesses are systems that coordinate model calls, tool use, and task execution to help large language models complete complex tasks. To meet task requirements and address failures, these systems are often iteratively refined by amending and patching their instructions, tools, and workflows, continuously increasing harness complexity. It is therefore unclear whether some resulting harness modules are redundant, introducing substantial token overhead with little, if any, performance gain. Inspired by neural network pruning, in this paper, we study harness pruning as a means of striking a better balance between task performance and token cost. We propose SHarP (Saliency-based Harness Pruning), a simple yet effective pruning strategy based on the saliency of each harness module with respect to performance and efficiency. Specifically, we first identify tools, instructions, and supporting mechanisms as components that can be individually disabled. We then estimate the saliency of each module by ablating it and assessing its task performance and token cost relative to the full set of single-module ablations. Modules with the smallest contribution to performance or largest computational overhead are subsequently pruned. Our evaluation across various harnesses on held-out validation sets reveals a surprising finding: most harnesses that we studied are highly redundant and can maintain comparable performance and efficiency even after a substantial portion of their modules are pruned. Our pruning approach and empirical findings provide new perspectives on agent harness design and optimization.

Every Monday
Get next week’s papers.
Subscribe on Substack