HERA: Harness-Environment Co-Evolution for Reliable Agentic Abstention

Han Luo, Bingbing Wen, Guang Yang, Zora Zhiruo Wang, Pan Lu, Lucy Lu Wang

University of Washington · University of Leeds · Carnegie Mellon University · Stanford University · Allen Institute for AI

Published October 5, 2026 · on the feed October 20, 2026 · ▲ 6 · arXiv 2610.06563

The abstract

Large language model (LLM) agents are increasingly capable of acting in complex tool-use environments, yet they often fail to recognize when tasks are infeasible and no valid solution exists. Recent work has formalized this reliability gap as the problem of agentic abstention, and existing approaches typically optimize a model or agent harness against a fixed set of tasks, leading to limited generalization to unseen failure modes. We introduce HERA, a framework for harness-environment co-evolution for agentic abstention. HERA consists of (i) a pipeline to automatically construct verifiable pairs of feasible and infeasible tasks by applying controlled environment mutations that transform solvable tasks into cases requiring abstention, and (ii) a co-evolution procedure in which performance failures on previous tasks are used to drive harness adaptation and generate new execution environments and tasks geared towards previous weaknesses. On held-out evaluation tasks, an evolved harness from HERA improves abstention accuracy from 61.7% to 83.3% while improving feasible-task completion from 68.3% to 76.7%, achieving the highest abstention and feasible-task completion among the compared methods. The resulting best harness transfers across 19 other LLMs, improving abstention accuracy by 15.3 percentage points on average without any model-specific optimization, and enabling smaller models to match the performance of more powerful models at an estimated 85% lower cost.

The Brief

2:29

A short podcast summary of the paper. Written and voiced by AI.

Transcript

HERA. Harness-Environment Co-Evolution for Reliable Agentic Abstention. By Han Luo and five others, from the University of Washington, the University of Leeds, and three other institutions. Published on the fifth of October. Its code repository is public and real: fifteen source files.

Language model agents are getting better at acting in complex tool-use environments. What they often fail to do is recognise when a task is infeasible, when no valid solution exists and the right move is to stop. Recent work has formalized this reliability gap as agentic abstention. Existing approaches tend to optimize a model, or the agent harness around it, against a fixed set of tasks. A fixed set only contains the failure modes someone thought to include, and the result is limited generalization to failure modes that were never seen.

HERA treats the task set as something that should move too. It is a framework for co-evolution: the harness and the environment evolve together. As the harness improves, the environments it is tested in change to target where it is still weak.

There are two parts. The first is a pipeline that automatically constructs verifiable pairs of tasks, one feasible and one infeasible. It does this by applying controlled mutations to the environment, which transform a solvable task into a case where abstention is the correct answer. The second part is the co-evolution procedure itself. Performance failures on previous tasks are used in two ways: they drive adaptation of the harness, and they drive the generation of new execution environments and tasks aimed at those same weaknesses.

On held-out evaluation tasks, an evolved harness from HERA raises abstention accuracy from sixty-one point seven percent to eighty-three point three percent. It does this without becoming timid: feasible-task completion also rises, from sixty-eight point three percent to seventy-six point seven percent. Both figures are the highest among the compared methods.

The best harness also travels. Applied to nineteen other language models, it improves abstention accuracy by fifteen point three percentage points on average, with no model-specific optimization. It also lets smaller models match the performance of more powerful ones, at an estimated eighty-five percent lower cost.

Knowing when to refuse a task and being able to finish a task usually pull against each other, and in these results both numbers went up together. The method's answer to unseen failure modes is not a bigger fixed set of hard cases but a generator of them, steered by the harness's own mistakes, and the improvement it buys lives in the harness, which is why it carries over to models it was never tuned on.

More with an account

Listen to every day’s papers

Daily playlists, deep dives, quests for the papers, and quizzes on their key terms.

Join free
KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.