Harness-S: learning from sibling harnesses (2611.04277)
TL;DR. A harness is the code around a model: tools, prompts, retries, state. Harness-S observes that harness variants grown from one base fix different failures (locality), cover for each other (complementarity), and change in usefulness as the policy learns (nonstationarity). So rather than searching for one best harness, it builds a fixed pool of sibling harnesses, each evolved along a different repair direction. During agent RL with GRPO (group-relative policy optimization, which scores a group of attempts against each other and learns nothing when all fail), the pool is used only when every base-harness attempt fails. An adaptive router picks the top-k siblings from behavior profiles and votes across several LLMs, the same policy retries there, and those trajectories replace the failed group. The skill then transfers back: under the original harness, Qwen3.5-4B on SWE-Gym goes from 24.38% to 38.75% pass@3. Results hold across AppWorld, SWE-Gym and DBBench, and reusing the router for Rank-1 inference adds gains at the same rollout count.
flowchart LR
T["Task<br/><small>SWE-Gym, AppWorld</small>"] --> H["Base harness<br/><small>k attempts</small>"]
H -->|some pass| G["GRPO update<br/><small>normal signal</small>"]
H -->|all fail| R["Harness router<br/><small>picks top-k siblings</small>"]
R --> S["Sibling pool<br/><small>fixed, repair-specific</small>"]
S --> G
G --> P["Policy<br/><small>works under base harness</small>"]
classDef input fill:#d0ebff,stroke:#1971c2,color:#1b1b1b,stroke-width:2px
classDef core fill:#e5dbff,stroke:#6741d9,color:#1b1b1b,stroke-width:2px
classDef loop fill:#fff3bf,stroke:#f08c00,color:#1b1b1b,stroke-width:2px
classDef exit fill:#d3f9d8,stroke:#2f9e44,color:#1b1b1b,stroke-width:2px
classDef err fill:#ffe3e3,stroke:#e03131,color:#1b1b1b,stroke-width:2px
class T input
class H,S core
class R loop
class G,P exit
linkStyle 2 stroke:#e03131,stroke-width:2px
Relation to prior wiki pages
- Router inside training. The llm-routing page tracks routers at inference. Harness-S puts a router in the RL loop, selecting environments rather than models.
- Contrasts with Harness² (10-15), which edits the harness per task and keeps what helps at test time. Harness-S keeps the harness pool fixed and moves the capability into weights.
- Fits BOXBOX (11-10), mid-run harness hot-reload. Three ways to use harness variation: switch at run time (BOXBOX), edit per task (Harness²), distill into the policy (Harness-S).
Gaps
The sibling pool is built from base-harness failures on the same benchmarks, so held-out transfer is limited. Rescue rollouts cost is not reported per solved task.
Source: arXiv 2611.04277 · code · surfaced via the X Following feed.