mlsanityData to 14 Oct 2026

More Programs or More Rolls? Separating Coverage from Specialization in LLM Harnesses

arXiv 2609.35873 ↗First posted 26 Sep 2026cs.AI cs.LG cs.SEcited by 1

Not on the map. Why?

Abstract (arXiv)

Automated generation of LLM harnesses promises to improve inference through task specialization. Yet additional answer coverage can arise from repeated execution of the same program, making specialization difficult to identify. We introduce a controlled evaluation that separates answer coverage, repeatable task advantages, and gains from pre-execution selection. On 386 MATH-500 tasks, we compare eight generated harnesses plus a baseline with nine byte-identical baseline copies, using three executions per member. Identical programs yield 2.16 percentage points of repeat-averaged oracle headroom. Generated programs exhibit substantially more repeatable score patterns, but these chiefly reveal persistent weaknesses: losses relative to the baseline persist across all three repeats on 100 tasks, while persistent wins occur on only one task and are sensitive to answer extraction. The frozen selector gains 0.00 percentage points, and both populations reach 98.70% oracle coverage at 27 harness executions. Stable complementarity remains unresolved at three repeats. Supporting BIRD traces locate failures in mechanism implementation, activation, and output validity. Together, these findings establish why coverage and repeatability alone cannot justify claims of useful specialization. They motivate an evaluation standard for harness diversity: task advantages should persist across executions, guide usable decisions, and improve on additional fixed-program executions under matched inference budgets.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 26 of its 33 references that are in the map. First posted on arXiv 26 Sep 2026.

Builds on

26 of 33 references.

References · 26

  1. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  2. 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,708
  3. 2023Let's Verify Step by Stepcited by 3,789
  4. 2023Can LLM Already Serve as A Database Interface? A BIg Bench for Large-Scale Database Grounded Text-to-SQLscited by 688
  5. 2024RouteLLM: Learning to Route LLMs with Preference Datacited by 682
  6. 2024Automated Design of Agentic Systemscited by 407
  7. 2024More Agents Is All You Needcited by 180
  8. 2026Agentic Harness Engineering: Observability-Driven Automatic Evolution of Coding-Agent Harnessescited by 142
  9. 2023An Empirical Study of the Non-determinism of ChatGPT in Code Generationcited by 137
  10. 2026Self-Harness: Harnesses That Improve Themselvescited by 107
  11. 2026LLM-as-a-Verifier: A General-Purpose Verification Frameworkcited by 30
  12. 2026From Failed Trajectories to Reliable LLM Agents: Diagnosing and Repairing Harness Flawscited by 29
14 more
  1. 2026HarnessForge: Joint Harness and Policy Evolution for Adaptive Agent Systemscited by 21
  2. 2026TTHE: Test-Time Harness Evolutioncited by 16
  3. 2026JIT-Agent: Scaling Harness Intelligence via Just-in-Time Harness Evolutioncited by 16
  4. 2026HarnessBank: Semantic Gene-Bank Search with Gated Verification for Agent-Harness Self-Evolutioncited by 14
  5. 2026Harness Handbook: Making Evolving Agent Harnesses Readable,Navigable, and Editablecited by 13
  6. 2026GRASP: Gated Regression-Aware Skill Proposer for Self-Improving LLM Agentscited by 11
  7. 2026HELIX: Model-Harness Co-evolution for Recursive Self-Improvementcited by 7
  8. 2026Verify Smarter, Evolve Further: Efficient Harness Evolution through Behavior-Aware Verificationcited by 7
  9. 2026Automated Discovery Has No Universally Superior Harnesscited by 6
  10. 2025Inefficiencies of Meta Agents for Agent Designcited by 5
  11. 2026Select-then-Solve: Paradigm Routing as Inference-Time Optimization for LLM Agentscited by 5
  12. 2026Task-CoEvolve: Efficient Harness Optimization via Adaptive Validation Task Selectioncited by 5
  13. 2026When Should LLMs Search? Counterfactual Supervision for Search Routingcited by 3
  14. 2026It's Not the Capability: Harness Sensitivity Is Non-Monotone Across LLM Agent Tierscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.