General
BOXBOX: Recursive Harness Self-Improvement for Long-Running Performance Optimization
arXiv cs.SE0 views
arXiv:2611.09218v1 Announce Type: new Abstract: Automated harness optimization improves agents by learning from trajectories and task feedback. Existing offline methods use reference answers to optimize harnesses for reuse on held-out tasks. However, many real-world tasks are open-ended, while long runs expose new difficulties that offline-optimized harnesses may not address. To study harness optimization in these settings, we introduce PerfRace, a benchmark for long-running performance optimization of software projects, and investigate whether agents can use task-specific experience to recursively improve their harnesses during an ongoing task. To this end, we introduce BOXBOX, which enables agent-triggered harness revision and kernel-managed hot reloading while preserving execution context. We evaluate BOXBOX on PerfRace under matched test-time budgets, comparing it with Frozen Harness, offline Harness Evolution, and Harness Scaling. BOXBOX achieves higher speedup with more efficient use of task time and model cost, reaching a Speedup@4h of 1.70x, compared with 1.54x for the strongest baseline.
Source:https://arxiv.org/abs/2611.09218PreviousOn the Limits of Execution Traces for Repairing Assertion Failures in LLM-Generated CodeNextIntegrating MBSE Principles with AI to Improve the Quality of Requirements in SMEs Context
Related posts
Supabase .NET DevLog #18
0dev.to OpenSource
13,000-Fold Frequency Down Conversion From 280 MHz to 21 kHz Using Mechanical Frequency Combs
0arXiv eess.SP
An Asymptotic Framework for Closed-Form Estimators from Surrogate Estimating Equations
0arXiv stat.TH
Graphical Analysis of Lifted Product Code Constructions
0arXiv math.IT
An Efficient Synchronization Scheme for Distributed Bandits
0arXiv math.IT
The Finite Difference Method, for the heat equation on Sierpi\'{n}ski simplices
0arXiv cs.NA