What Does a Harness Repair? A Preregistered Study of Visibility, Baseline Adequacy and Evaluation Defects
cs.LG, cs.AI, cs.CL
Submitted: 2026-10-04
Updated: 2026-10-04
Comments: 43 pages, 2 figures, 35 tables. Ancillary files in anc/: the frozen preregistration, its addenda (row keys of five rows withheld) and the aggregate analysis report, with a README
Code: https://github.com/vllm-project/vllm
License: http://creativecommons.org/licenses/by/4.0/
The gist: Harness search keeps a change to the prompts, reasoning switches, token budgets or parsers around a frozen model if the change raises a score.
Abstract
Harness search keeps a change to the prompts, reasoning switches, token budgets or parsers around a frozen model if the change raises a score. Such a gain can come from answers the parser could not read before, a weak comparison, or a defect in the evaluation. We preregistered a study of where these gains come from, with three small models, three benchmarks, replication and test partitions, a GEPA search arm and six evaluation defects injected one at a time, and we report all 47 primary endpoints. Turning thinking off raised accuracy over a capped thinking setting in 5 of 9 model-benchmark cells, and in each the gain came mostly from questions where the capped setting gave no readable answer. The thinking-off setting was not meaningfully worse than a rescue configuration or four GEPA-selected harnesses in 11 of 13 comparisons, and lost to the rescue on GSM8K for two models. GEPA repaired its broken starting points, but none of its selected harnesses was more accurate than the thinking-off setting. A thinking budget in the serving engine, which also allows a longer answer, lowered truncation and raised the parse rate in 6 of 9 cells. In 6 of 15 evaluable defect-model pairs, replication through the same pipeline reproduced the defect's distortion instead of revealing it. On the LongevityBench multiple-choice tasks, only the longevity-tuned model beat the strongest constant-label baseline.
Sources
- GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning
- Intern-S1: A Scientific Multimodal Foundation Model
- Do Agent Benchmarks Do What They Say? An Executable-Contract Audit of Tool-Using Agent Environments
- Benchmark Scores Are Pipeline-Dependent: A Reliability Audit of Cybersecurity LLM Benchmarks
- Shorter Reasoning, Earlier Answers? An Evaluation of Reasoning Interfaces
- Naive Prompt Optimization: Rethinking the Need for Complex Prompt Search
- The Calibration Floor: Format Repair Can Masquerade as Self-Correction at Small-to-Mid Scale
- Training Verifiers to Solve Math Word Problems
- Accuracy is Not All You Need
- Model Equality Testing: Which Model Is This API Serving?
- When the Ruler is Broken: Parsing-Induced Suppression in LLM-Based Security Log Evaluation
- Simple Baselines are Competitive with Code Evolution
- Mind the Cap: Output-Budget Regimes Change the Measured Multilingual Reasoning Gap
- Safety Under Scaffolding: How Evaluation Conditions Shape Measured Safety
- Beyond Accuracy: Decomposing the Reasoning Efficiency of LLMs
- AI Agents That Matter
- DSPy: Compiling Declarative Language Model Calls into Self-Improving Pipelines
- When LLMs get significantly worse: A statistical approach to detect model degradations
- Repair, Not Improvement: Decomposing Constrained Decoding in Tool-Call Abstention
- DART: Draft-Agreement Routing for Training-Free Adaptive Thinking Budgets in Hybrid Reasoning Models
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks