about
Meta-Harness: End-to-End Optimization of Model Harnesses (arxiv.org)
3 points by kstonekuan 182 days ago | hide | past | pdf | discuss on HN

In plain words: A system that writes and tests the code deciding what a model stores, retrieves, and sees, with a builder agent reading past attempts' code, scores, and traces. It beat the best hand-built memory system on text classification by 7.7 points using far fewer tokens.

Abstract

The performance of large language model (LLM) systems depends not only on model weights, but also on their harness: the code that determines what information to store, retrieve, and present to the model. Yet harnesses are still designed largely by hand, and existing text optimizers are poorly matched to this setting because they compress feedback too aggressively. We introduce Meta-Harness, an outer-loop system that searches over harness code for LLM applications. It uses an agentic proposer that accesses the source code, scores, and execution traces of all prior candidates through a filesystem. On online text classification, Meta-Harness improves over a state-of-the-art context management system by 7.7 points while using 4x fewer context tokens. On retrieval-augmented math reasoning, a single discovered harness improves accuracy on 200 IMO-level problems by 4.7 points on average across five held-out models. On agentic coding, discovered harnesses surpass the best hand-engineered baselines on TerminalBench-2. Together, these results show that richer access to prior experience can enable automated harness engineering.

Yoonho Lee, Roshen Nair, Qizheng Zhang, Kangwook Lee, Omar Khattab, Chelsea Finn
arXiv:2603.28052 · cs.AI · submitted Mar 30, 2026
abstract · pdf · html

add comment on HN