Meta paper: branching harness search lifts Olympiad math +34.8% over Meta-Harness
dair_ai · x · 2026-10-02
A new Meta paper improves on Meta-Harness-style agent harness optimization.
- The baseline uses one development set and one proposal policy, so every edit follows a single path and can get stuck in a local optimum.
- The new approach splits the search into branches: each branch keeps dev cases its harnesses solve better than other branches, drops cases every branch already solves, and rewrites its own proposal policy from its history. A router picks one branch's harness per new input before it runs.
- Gains over Meta-Harness: +34.8% on Olympiad-level math, +11.6% on Terminal-Bench 2.0, +3.8% on SWE-bench Lite.
- Harness selection and the router rely only on development data.
More from coding & agent
- Generic API-catalog MCP server vs one tool per job: a token-efficiency tradeoff — MandeepKaur9407 · 2026-11-16
- sessionwiki turns your past coding-agent sessions into a searchable local wiki for agents — Cold_Past7184 · 2026-11-16
- Developer hits 700+ commits/day with AI, asks how to manage parallel agent work — blixt · 2026-11-16
- Alibaba's G-CAST: governed continual self-training keeps e-commerce agents fresh in production — Yuechun Yu · 2026-11-16
- harness-evals: open-source library to compare agent versions with success-vs-cost plots — slavadubrov · 2026-11-16
- Developers poll real costs of running coding agents on remote VMs for work — radim11 · 2026-11-16