betaFeedback

WorksComputer Science

DeltaHarness: Self-Evolving Harnesses for Resource-Adaptive Tool Execution

Abstract

Tool-using agents rely on execution harnesses to organize and schedule tool operations. The same task and resource description can conceal runtime conditions that reverse the latency ordering of valid execution plans. Resolving this uncertainty requires firsthand execution in the target setting. We introduce DeltaHarness, an execution-guided policy-search method that adapts agent harnesses from cold-start measurements. Its QHI loop uses the observed response to update runtime dispatch, revise physical plans, and select experiments for later proposals. An independent confirmation panel controls policy replacement. With fixed dispatch, a revised materialization policy reduces complete-delivery latency by 30.0% on one video-editing task across three fresh pairs. On held-out tasks, the evolved policies reduce latency by 8.2% relative to the best fixed plan in one seed and by 4.6% relative to the initial proposal in another.

Introduction

Tool-using language models execute tasks through harnesses that organize tool operations and control their execution [13, 8] (Wu et al. 2026). Resource-aware execution exposes choices in dataflow structure, input access, and scheduling [14, 1]. A video composition can run as one fused render, as parallel output ranges, or through materialized clips (Yan et al., 2026b,a). Parallel ranges can repeat decoding and add intermediate traffic. Materializing clips spends local compute to change later input access. Source layout, cache state, and interference determine which plan delivers fastest, even across executions with the same visible task and hardware description. When hidden runtime conditions can reverse plan ordering, identifying the faster plan requires firsthand execution in the target setting.

Execution-guided search uses measured performance to revise systems algorithms [3, 6], storage configurations [5], and serving policies [9]. Prior programs and measurements provide an initial cost estimate; the target setting’s physical response updates it. Under a fixed measurement budget, adaptation must also choose which comparisons will inform the next revision.

Experiment selection connects harness evolution to task-aware exploration, which values information by its effect on downstream control [17]. Active video investigation tests competing failure explanations before harness revision [11], while self-improving branches adapt the development cases used for search [4]. We study whether selecting task–resource measurements can improve a successor’s physical execution policy.

DeltaHarness extends this execution-guided loop to physical tool plans with fixed model weights and tool kernels. For a new device, workload, or resource setting, cold start combines inherited programs and experience with measurements of its current physical response. The physical policy HH chooses partitioning, concurrency, fusion, and materialization. The dispatcher QQ uses measured delivery times to update admission decisions, and II selects task–resource comparisons for the next proposal. An independent common panel determines incumbent replacement. Figure 1 shows how experience in the target setting informs these revisions.

Figure 1. Firsthand harness adaptation. (a) A tool interface admits plans with unknown relative cost. (b) II chooses paired trials. (c) The model revises HH from the resulting experience; QQ dispatches the graph. The illustrated revision materializes clips before local fusion.

Program-level recursive self-improvement also makes the improver itself an optimization target [16]. Our recursive variant rewrites its evidence-analysis program, while policy self-evolution updates HH. We compare learned experiment allocation with uniform and balanced panels under matched budgets, followed by frozen held-out evaluation to assess transfer (Wang et al., 2026b; Xia et al., 2026).

In the fixed-dispatch video-editing case, materializing clips before fusion reduces latency by 30.0% and raises average active FFmpeg cores from 0.95 to 1.80. On held-out tasks, the first policy-search seed beats the best fixed plan and the second improves its initial proposal. Additional comparisons examine experiment selection, resource response, and orchestration.

Related Work

Measured Optimization of Computer Systems Scanner exposes compressed-video access and dataflow execution [14], while Murakkab combines workflow profiling with adaptive model and hardware configuration [1]. LLM-driven systems design builds on measured feedback: ADRS evolves performance-oriented algorithms [3]; Glia coordinates reasoning, experimentation, and analysis [6]; STELLAR reruns applications to tune file systems [5]; AUTOPOIESIS evolves serving policies under runtime dynamics [9]; and MaxKernel uses compiler and profiling feedback for TPU kernels (Wang et al., 2026a). DeltaHarness applies this measured-optimization principle to physical tool plans, separating experiment allocation from incumbent confirmation.

Learning and Evolving Agent Harnesses HarnessDev evaluates runnable harness creation and evolution (Wu et al., 2026); HarnessEvolve diagnoses failures through reference trajectories [8]; and multi-task self-evolution uses the same frozen agent as solver and optimizer (Xu, 2026). Specialized harnesses accumulate diagnosis experience in OpsHarness [7], design feedback in AutoDesign [12], and research strategies in ScholarEvolve (Yang et al., 2026a). Learned editors provide another route: Harness Learning trains a proposer from task feedback (Zhang et al., 2026), Harness-R1 trains an engineer through target-agent reruns [15], and Harness-Zero distills harness-induced behavior into solver weights (Ye et al., 2026). Our formulation fixes the model weights and tool kernels while exposing physical policies and measurement locations to the improver.

Active Evidence and Improving Exploration Task-aware experiment design links observation value to its effect on the eventual policy, as in nonlinear system identification for controller optimization [17]. VideoHarness-RSI evolves video-context constructors (Xu and Chen, 2026), and Video-RSI actively revisits videos to test failure explanations [11]. Exploration also improves through historical replay in Dream-RSI (Zheng et al., 2026), self-modification records in SelfSearch (Yang et al., 2026b), shared group experience (Weng et al., 2026), and adaptive development subsets and proposal guidance [4]. AIDE2 evaluates rewritten research agents through downstream research performance [16]. DeltaHarness focuses on fresh candidate–incumbent task/resource pairs: selected measurements inform a successor, while a common panel controls replacement.

Evaluation and Transfer RRSI regularizes harness evolution against development-set overfitting (Xia et al., 2026). Rethinking Harness Evaluation compares evolution with task-level search under matched feedback and inference budgets (Wang et al., 2026b). AutoTuneBench studies how baseline choice, hardware variation, headroom, and infrastructure affect tuning measurements [2]. Controlled agent-scaling experiments further connect architecture benefits to task structure and coordination overhead [10]. These findings motivate our fresh paired measurements, frozen held-out evaluation, and separate reporting of execution gains and policy-acquisition cost.

Problem Formulation

A task xx specifies a logical composition and its delivery contract. The visible resource description ee contains quantities such as CPU eligibility or an input-response limit; observations oo describe measured behavior in the current setting. A harness policy constructs a physical tool graph

G=H(x,e,o),G=(V,E).(1)G = H(x,e,o), \qquad G = (V,E). \tag*{(1)}

Nodes bind fixed tool operations to arguments and resource requests, and edges impose dependencies. The dispatcher QQ schedules ready operations. The optimization target is complete-delivery time T(Q,H;x,e)T(Q,H;x,e), including observation, policy evaluation, compilation, tool execution, and output checks. We write T(H;x,e)T(H;x,e) when the dispatcher is fixed.

Why firsthand evidence is necessary. Let zz denote conditions unresolved by ee, such as cache state or interference. Two plans pp and qq can share the same visible description yet reverse their expected ordering:

E[T(p)−T(q)∣x,e,z1]<0,E[T(p)−T(q)∣x,e,z2]>0.(2)\begin{aligned} \mathbb{E}[T(p)-T(q)\mid x,e,z_1] &< 0,\\ \mathbb{E}[T(p)-T(q)\mid x,e,z_2] &> 0. \tag*{(2)} \end{aligned}

When both runtime states are compatible with the available prior, (x,e)(x,e) leaves the current plan ordering unidentified. Cold-start executions supply observations oo of the target setting. These observations update the evidence used for subsequent dispatch, policy revision, and experiment selection.

Let DrD_r be the information available before proposal rr, H0H_0 the common initial policy, and Hr−1H_{r-1} the incumbent. A fixed model improver MM proposes

(H~r,A~r)=M(H0,Hr−1,Dr),(3)(\widetilde{H}_r,\widetilde{A}_r)=M(H_0,H_{r-1},D_r), \tag*{(3)}

where A~r\widetilde{A}_r names candidate–incumbent comparisons on development task–environment cells. The measurement rule II determines which locations are executed. We compare measurement rules through the final policy they produce under the same proposal and execution budgets.

Policy acquisition has a one-time cost CimproveC_{\mathrm{improve}}. Over nn deployed tasks, its time cost is

Cimprove+∑j=1nT(Q,H;xj,ej).(4)C_{\mathrm{improve}}+\sum_{j=1}^{n}T(Q,H;x_j,e_j). \tag*{(4)}

DeltaHarness

DeltaHarness performs black-box policy optimization with adaptive experiment allocation. In the full loop, HH constructs the physical graph and QQ decides whether to admit a ready operation or wait for an active one to finish. Successful workflows supply decision-to-delivery times for updating QQ. The improver proposes revisions to HH and II from accumulated outcomes. The physical-policy and allocation experiments use fixed dispatch.

Representing Physical Policies

A policy maps task and resource observations to a complete physical plan. The Linux studies implement this map as sandboxed source programs. The Mac adaptation case uses ordered typed rules with a complete default branch: conditions test task or environment features and define missing-value behavior. These are distinct policy interfaces over the same kinds of physical choices. The compiler and tool kernels are fixed within each comparison.

For video editing, the plan chooses range count, range concurrency, even or clip-aware cuts, longest-processing-time ordering, hardware decoding, clip materialization, materialization concurrency, and audio/video insertion order (Appendix § 8). These choices change the physical work. Materialization creates local inputs for a fused render (Figure 1(c)); scheduling controls when the resulting nodes execute.

Obtaining Firsthand Measurements

Cold start acquires response measurements from the current setting and combines them with inherited evidence. An observation includes elapsed time, tool CPU time, input service, work size, and delivery status. Task preparation supplies observations and reusable artifacts, with its cost included in each method’s execution. Additional plan comparisons provide evidence for later decisions.

A comparison cell u=(x,e)u=(x,e) binds a candidate and incumbent to the same task and environment. Each policy executes freshly, consecutively, in randomized order. Even identical plans receive separate executions. The resulting record contains the common task observation, both policies, both delivery outcomes, and both costs. Remeasuring the incumbent controls for drift better than comparison with a stale timing.

Admission limits constrain declared tool pools; FFmpeg retains natural internal threading. Linux CPU-affinity and FUSE-response controls, and Mac admission and HTTP-response controls, retain their respective resource semantics throughout evaluation.

Algorithm 1 Policy evolution with fixed dispatch

Require: Common policy H0H_0, prior D1\mathcal{D}_1, model MM, measurement rule II

Require: Development domain U\mathcal{U}, fixed panel budgets brA,brCb_r^A,b_r^C for RR rounds

  1. for r=1,…,Rr=1,\ldots,R do

  2. (H~r,A~r)←M(H0,Hr−1,Dr)(\widetilde{H}_r,\widetilde{A}_r)\leftarrow M(H_0,H_{r-1},\mathcal{D}_r)

  3. Freeze candidate H~r\widetilde{H}_r and locations A~r\widetilde{A}_r

  4. Ar←I(A~r,Dr,U,brA)A_r\leftarrow I(\widetilde{A}_r,\mathcal{D}_r,\mathcal{U},b_r^A)

  5. Reveal common panel CrC_r of size brCb_r^C

  6. FrC←PAIR⁡(H~r,Hr−1,Cr)F_r^C\leftarrow\operatorname{PAIR}(\widetilde{H}_r,H_{r-1},C_r)

  7. FrA←PAIR⁡(H~r,Hr−1,Ar)F_r^A\leftarrow\operatorname{PAIR}(\widetilde{H}_r,H_{r-1},A_r)

  8. Hr←RETAINORREPLACE⁡(Hr−1,H~r,FrC)H_r\leftarrow\operatorname{RETAINORREPLACE}(H_{r-1},\widetilde{H}_r,F_r^C)

  9. Dr+1←Dr∪{FrC,FrA,Hr}\mathcal{D}_{r+1}\leftarrow\mathcal{D}_r\cup\{F_r^C,F_r^A,H_r\}

  10. end for

  11. Freeze HRH_R for held-out evaluation

Selecting Evidence for the Next Revision

Algorithm 1 describes policy evolution with fixed dispatch. Selected trials ArA_r inform later proposals. Confirmation CrC_r determines whether the current candidate replaces the incumbent. Both panels contribute to the accumulated experience in Figure 2. The allocation experiment uses source policies.

Figure 2. The update loop in Algorithm 1. Selected trials supply feedback; common confirmation controls incumbent replacement. Both panels use fresh randomized-order pairs. Frozen policies are evaluated on held-out tasks and resources.

Measurement allocation. In the allocation study, the three LLM arms share model, prompt structure, sampling settings, and proposal count. UNIFORM samples development cells without replacement within a panel. BALANCED uses a predefined balanced panel. SELECTED executes the model’s locations, including repeats. Invalid locations receive uniform replacement. The model packet omits arm labels. A (1+1)(1+1)-ES baseline mutates resource-bin plan parameters under the same execution budget, without additional LLM calls.

All arms begin from one H0H_0 generated before iterative candidate–incumbent feedback. They share the prior and pilot, then receive their own measurements. Each subsequent input retains the initial policy, incumbent, previous candidates, queries, acceptance decisions, failures, and costs. Pair records contain both outcomes and coordinates.

Incumbent replacement. The common panel is revealed after candidate freezing. For paired losses ℓrj′\ell'_{rj} and ℓrj\ell_{rj} on CrC_r, define

ρr=exp⁡(1∣Cr∣∑j∈Crlog⁡ℓrj′ℓrj).(5)\rho_r = \exp\left(\frac{1}{\lvert C_r\rvert}\sum_{j\in C_r}\log\frac{\ell'_{rj}}{\ell_{rj}}\right). \tag*{(5)}

The plan-search and allocation studies use delivery time as loss for complete pairs and predefined penalties for failed deliveries. Replacement requires ρr≤0.995\rho_r \le0.995 and a one-sided 90% upper bound below 1 from 2,000 cell-bootstrap replicates. In Algorithm 1, only CrC_r enters this decision. Every candidate receives its allocated measurements, including slower candidates.

Feedback and cost. The eight-round allocation study uses 24 confirmation and 24 selected pairs per round, totaling 768 executions per arm and 25 LLM proposals including the common initial proposal. Each proposal receives outcomes from completed previous rounds. The acquisition cost includes the final round’s measurements.

After development, policies are frozen and evaluated once on new tasks and resource conditions. The intended allocation comparisons are SELECTED/UNIFORM and SELECTED/H0H_0, with task-clustered uncertainty and complete delivery.

Recursive variant. Plan search evaluates candidate–incumbent pairs on the full 96-cell development panel each round. Its recursive variant changes the improver’s analyze(data) program and method notes every two rounds. That program summarizes observations for subsequent proposals. Comparison with a policy-only improver measures the additional recursive layer (Appendix § 8).

Evaluation

We evaluate firsthand policy revision, held-out policy search, recursive analysis rewriting, and experiment allocation under fixed dispatch. Each matched comparison fixes the task, resource condition, and tool implementation. Appendix § 10 gives additional server execution, orchestration, and scheduling measurements.

Firsthand adaptation case. One fixed 312-frame task runs on a 12-core Mac with stage-pool cap four and shared HTTP input-response shaping at 4 MiB/s. The valid reference HPH_{\mathrm{P}} uses four clip-aware ranges with LPT ordering. The configured model, gpt-6.1-terra, receives accumulated execution history, compares three alternatives, and revises its policy. Three fresh randomized-order pairs evaluate the frozen revision under the same source bytes, compiler, and resource condition. The predefined development budget allows up to three such rounds; this case finishes in the first round.

Frozen-policy transfer. We freeze the Mac policy and reference before evaluating eight predefined, previously unexecuted edit configurations drawn from known media. Stage cap four crosses local input and shared HTTP response limits of 4 and 1.5 MiB/s, with two fresh randomized-order pairs per task and condition: 48 pairs and 96 executions. The primary panel is 4 MiB/s. The two policies choose the same physical plan on local input, providing a control for measurement variability. Frame completeness, latency, video fidelity, and audio duration are reported separately.

Plan evolution. The plan-search study develops policies on six tasks and sixteen environments: CPU-affinity sizes 2/4/8/16 crossed with local input or FUSE rates 16/4/2 MiB/s. Eight held-out tasks cross 24 environments, adding 8/3 MiB/s, for 192 cells per seed. Qwen3.8-27B generates ten candidates for a policy-only improver with a fixed analysis procedure or a recursive improver that also rewrites its analysis program and method notes. Table-based ES uses the same paired evaluator. The first policy-only proposal is retained for a secondary no-feedback comparison. Two seeds run under different observed CPU contention.

Measurement selection. The Linux allocation study uses eight search and four development-validation tasks over sixteen environments. UNIFORM, BALANCED, SELECTED, and ES each receive eight rounds with 24 confirmation and 24 selected pairs. LLM arms share Qwen3.8-27B, temperature 0.6, and a 16,000-token generation limit. Final evaluation uses sixteen new edit configurations over known media and 24 environments, including new 6/1.5 MiB/s conditions. This experiment uses source policies; it does not evaluate ES over the Mac typed-rule interface.

Fixed plans and inference. Range4, range8, K2p2, and fused form the fixed plan bank; K2p2 uses two ranges with pool two. The bank oracle takes the fastest measured plan per cell. Ratios below 1 favor the numerator. Held-out intervals use 10,000 task-cluster bootstrap replicates, keeping a task’s environments together. Delivery failures are counted separately from physical latency; predefined penalties are used only for search losses. The two plan-search seeds are analyzed within their respective host conditions.

Resource and delivery checks. FFmpeg retains natural internal threading. Affinity controls CPU eligibility, and admission controls declared pools, on shared hosts. The executor checks output properties; full AV decoding follows timing. The retained quality results and contention-retry protocol are in Appendix § 9. Quality coverage includes format, decodability, and selected source/output comparisons.

Results

Firsthand Revision Improves a Valid Plan

Firsthand comparisons identify clip materialization followed by local fusion as an effective alternative to the four-range reference HPH_P under constrained input service. The revised policy uses a materialization pool of four in this setting. Table 1 gives the fresh confirmation results, and Appendix § 10 reports the three alternatives that informed the revision.

TrialOrderHH (s)HPH_P (s)Ratio
1H→HPH \rightarrow H_P9.7414.060.693
2H→HPH \rightarrow H_P9.7514.270.683
3HP→HH_P \rightarrow H9.7313.420.725
Paired geometric mean0.700

Table 1. Three fresh paired confirmations on the fixed task. Both policies deliver all 312 frames with audio; H/HPH/H_P is the complete-delivery latency ratio.

The updated policy wins all three pairs and reduces complete-delivery latency by 30.0%. Average active FFmpeg cores, measured as tool CPU

seconds divided by delivery time, rise from 0.95 to 1.80. Cumulative FFmpeg CPU seconds increase by 32.4%, while source-response payload falls from 44.7–46.9 MB to 19.9–20.1 MB. Materialization mobilizes local compute and approximately halves traffic on the constrained input path.

Transfer, Correctness, and Video Fidelity

The frozen-policy evaluation reveals both latency changes and execution failures (Figure 3). The materialization policy completes 48/48 executions; the reference completes 40/48. Eight reference executions lose frames under input shaping, leaving the all-task primary speed comparison undefined. These incomplete outputs are recorded as execution failures.

Figure 3. Frozen-policy transfer: per-configuration H/HPH/H_P latency, geometric mean of two fresh pairs. Values below one favor HH. Crosses in the lower strip mark reference frame deficits, which leave the full-panel speed ratio undefined. All HH outputs complete.

Conditional on both outputs being complete, latency reductions range from 15.7–37.5% at 4 MiB/s and 39.1–55.3% at 1.5 MiB/s. Local input provides a same-action control: per-configuration ratios span 0.914–1.082, with an aggregate ratio of 1.014 [0.979, 1.044]. This spread shows the measurement variability with two pairs per configuration.

Materialization adds intermediate re-encoding. On fully aligned shaped-input pairs, SSIM is 0.9843–0.9956 and PSNR is 32.8–46.4 dB, so the latency reductions accompany a measurable fidelity loss. Audio sample counts match in all pairs. Appendix § 9 gives the delivery and fidelity breakdown.

Policy Evolution Across Two Seeds

The first plan-search seed obtains an 8.2% reduction relative to range4, the best fixed plan in that run, and a 6.6% reduction on unseen input-response conditions. The evolved/initial ratio is 0.996 [0.988, 1.003] (Figure 4). The evolved and initial policies close 73.0% and 69.0% of the logarithmic bank-oracle gap. The policies select fused execution at low input-service rates and use task features to condition the physical plan.

Figure 4. Within-seed latency ratios and task-clustered 95% intervals on eight held-out tasks and 192 cells per seed. Values below one favor the numerator. Seed B has higher external CPU contention. Recursive denotes analysis rewriting; initial denotes the first policy-only proposal.

The second seed runs under higher external CPU occupancy, approximately 0.69 versus 0.01 on assigned cores. Policy-only iteration reduces latency relative to its initial proposal by 4.6%, with ratio 0.954 [0.933, 0.976]. Figure 4 and Table 4 report the policy and analysis-rewriting comparisons in both seeds. Table 5 gives all fixed-plan references.

Policy| Seed A||Seed B||
Ratio95% CIUnseenRatio95% CIUnseen
Policy-only0.918[0.881, 0.956]0.9341.009[0.986, 1.025]1.076
Initial proposal0.922[0.878, 0.967]0.9391.058[1.020, 1.093]1.107
Recursive analysis0.929[0.897, 0.958]0.9580.999[0.990, 1.009]1.003

Table 4. Plan-search latency relative to range4, eight held-out tasks and 192 cells per seed. Unseen input-response conditions are 8 and 3 MiB/s. Intervals are task-clustered. External CPU occupancy differs between seeds.

Fixed planSeed ASeed B
Range41.0001.000
Range81.0300.967
K2p21.0201.091
Fused1.0701.210
Bank oracle0.8890.848

Table 5. Fixed-plan point estimates and per-cell bank oracle relative to range4. The best fixed plan changes from range4 to range8.

Physical Response and Server Execution

Controlled CPU-affinity measurements reveal different resource responses for the physical plans (Figure 5). Fused execution benefits from larger affinity sets beyond the point where staged execution largely flattens. This plan-dependent response motivates conditioning the harness on both task structure and available resources.

Figure 5. Physical-plan response to CPU affinity. Each point averages six compositions, with one observation per composition, plan, and setting. FFmpeg uses automatic threads under a 128 MiB/s logical read/write service. Affinity-set size specifies eligible CPUs on a shared host.

Additional within-host comparisons cover servers equipped with A100, RTX 3090, and RTX 4090 GPUs. A DAG-aware rule shortens six-task episodes relative to native concurrency-three execution in five host/resource conditions (Appendix § 10). That appendix also separates a model-call orchestration gain from native rendering time and reports a same-program feedback comparison.

Measurement Allocation

Table 2 reports the final policies from uniform, balanced, and model-selected measurement schedules on sixteen held-out tasks and 384 cells. Each schedule receives the same eight-round proposal and measurement budget. Appendix § 9 gives proposal-validity counts, successful-feedback timing, fixed-plan comparisons, and results by resource condition.

ComparisonRatio95% CI
S / Uniform0.984[0.966, 1.001]
S / Balanced1.173[1.103, 1.251]

Table 2. Final allocation-study outcomes on 16 held-out tasks and 384 cells, with task-clustered intervals. S denotes Selected. All three learned policies complete the evaluation; the shared initial policy and ES fail on all 384 cells.

Discussion

Cold-start measurements contribute through the execution choices they change. In the adaptation case, firsthand comparisons lead the improver to materialize clips before fusion. This reduces source traffic and exposes more local concurrency, lowering delivery latency as CPU utilization rises. The transfer measurements also reveal the fidelity effects of intermediate re-encoding. The scheduling comparison quantifies the interaction between useful overlap and interference with active work. These outcomes illustrate how observations from the target setting guide physical harness decisions.

Conclusion

DeltaHarness uses cold-start measurements to learn how execution plans behave under the current task and resource conditions. This information guides dispatch, physical-policy revision, and further measurement. With fixed dispatch and tool kernels, a model-selected materialization plan reduces complete-delivery latency by 30.0% on one task. Held-out policy search beats the best fixed plan in one seed and improves its initial policy in another.

Policy Interfaces and Recursive Variant

Physical policy interface. The Mac policy evaluates ordered conditions, assigns missing-value behavior, and ends with a complete default plan. Task features include source intervals, clip count, output frames, transitions, and estimated decode work. The Linux studies use sandboxed source policies. Table 3 lists the physical choices exposed by the executor; each comparison fixes its compiler and tool implementation.

ParameterPhysical choice
KKNumber of output ranges, 1–32
Range poolConcurrent range operations
Cut modeEven or clip-aware cuts
LPTOrder ranges by estimated work
Hardware decodeRequest when supported
MaterializeCreate intermediate clips
Materialization poolConcurrent intermediates
Audio firstAudio/video insertion order

Table 3. Typed physical policy parameters. CPU-only experiments fix hardware decoding off.

Recursive analysis rewriting. The policy-only improver has a fixed method description and analysis procedure. The recursive improver rewrites both its method description and a sandboxed analyze(data) function every two rounds. This function reads the arm’s accumulated task features, resource observations, plan parameters, wall times, tool CPU times, and I/O counts. Its output enters later policy prompts. If ara_r is that analysis program, the additional update is

ar+1=R(ar,Dr),H~r+1=M(Hr,Dr,ar+1(Dr)).(6)\begin{aligned} a_{r+1} &= \mathcal{R}(a_r, D_r),\\ \widetilde{H}_{r+1} &= M(H_r, D_r, a_{r+1}(D_r)). \tag*{(6)} \end{aligned}

Model weights and the experiment-selection procedure remain fixed in this analysis-rewriting comparison. Rewriting the experiment-selection program II would constitute another recursive layer.

Evaluation Details

Two-seed plan search. The policy-only and recursive arms share Qwen3.8-27B, the paired evaluator, and a 32,000-token generation limit. If generation exhausts its budget before returning code, a direct-answer continuation is used; 32 of 56 first-seed calls use this rule. Both arms make ten candidate proposals. The no-feedback comparator is the first policy-only proposal. Table 4 gives the three LLM policies, and Table 5 gives the fixed-plan references. Recursive/policy-only ratios are 1.012 [0.994, 1.032] in seed A and 0.990 [0.975, 1.011] in seed B. ES has overall ratio 1.006 [1.003, 1.009] in seed A and point estimate 1.004 in seed B. Its unseen-condition ratios are 1.012 and 1.003. Output checks include format validation and sampled SSIM.

Allocation-study validity. Eight search tasks and four development-validation tasks are selected before execution. Final evaluation uses sixteen new complete edit configurations; a separate 32-cell development-validation diagnostic receives no later model feedback. The shared 64-cell pilot has best-fixed geometric mean 32.83 s and bank-oracle mean 27.33 s, a 16.7% gap. Every arm receives the complete pilot. A descriptive best-plan-per-environment combination closes 91.8% of the logarithmic pilot gap.

The common initial source violates its execution contract and is used without a successful initial-policy confirmation. ES mutations inherit the in-valid source; several LLM proposals also fail the response contract. Successful development executions are Uniform 624/768, Balanced 336/768, Selected 48/768, and ES 0/768. Of Selected’s 192 requested locations, 120 are model choices and 72 use uniform replacement. Its successful executions follow proposal eight. Uniform, Balanced, and Selected complete all 384 final cells;

H0H_0 and ES fail on all 384. Their latency ratios to range4 are 1.292 for Uniform, 1.084 for Balanced, and 1.272 for Selected. The Selected/H0H_0 ratio of 0.636 [0.590, 0.686] is a failure-penalty statistic. Selected’s logarithmic bank-oracle gap closure is −120.8% [−161.7%, −89.8%]. Table 6 retains the resource-level outcomes.

Response (MiB/s)S / UniformS / Balanced
Local0.9850.991
160.9471.002
6 (unseen)1.0001.683
40.9711.516
21.0051.008
1.5 (unseen)0.9981.020

Table 6. Measurement-selection results by response condition, 64 cells per row. S denotes Selected. Its largest losses to Balanced occur at 6 and 4 MiB/s.

Mac local-I/O characterization. This pilot uses deepseek-v4.1-flash, distinct from the model in the Mac adaptation case. Four tasks cross stage caps 1/2/4/8. Fixed-plan geometric means are 4.60 s for range4, 5.02 s for range8, 4.73 s for K2p2, and 6.15 s for fused; the oracle is 4.50 s. The 2.1% gap is below the predefined 5% study premise, so this pilot proceeds to no policy-evolution or held-out evaluation.

The contention rule permits two extra whole-block attempts above 10% interference. It retains the first complete attempt with known low contention, or the third attempt with its flag. Unknown contention remains flagged. This produces 180 pilot executions and thirty successful workflow-check executions; actual costs include all attempts.

Transfer outcomes and fidelity. Table 7 and Table 8 report every condition and configuration. Each ratio uses two pairs with complete video on both sides. Reference frame deficits occur on configurations 03, 04, and 06 under input shaping. All local deliveries complete.

InputHHHPH_{P}
Local16/1616/16
4 MiB/s16/1614/16
1.5 MiB/s16/1610/16

Table 7. Complete frozen-policy deliveries. Each condition contains eight new configurations and two pairs per configuration.

TaskLocal4 MiB/s1.5 MiB/s
011.0510.8430.609
021.0360.8050.599
031.0050.718Fail
040.914FailFail
051.0350.6450.447
060.9910.761Fail
071.0040.6250.497
081.0820.6480.477

Table 8. Per-task frozen H/HPH/H_{P} latency ratios. Every HH delivery completes. Fail denotes a reference frame deficit in both repetitions, leaving the speed ratio undefined.

All 96 outputs decode without decoder errors. Frame counts confirm 48 complete HH outputs and 40 complete HPH_P outputs; paired audio sample counts match throughout. Of the 40 complete video pairs, 32 have full-length SSIM/PSNR records; eight metric records end one frame before the decoded output. Table 9 reports the fully aligned subset. The resulting fidelity loss reflects intermediate re-encoding.

Additional Execution Studies

Server execution. Table 10 compares two fixed methods on three server stacks. Native admits ready tool operations through a concurrency-three pool; DAG rule is a graph-dependent physical-plan selector using the revealed dependencies. Five paired blocks contain six-task episodes under each resource sequence. The machine-readable supplement retains the original eight-policy comparison; the table here addresses the defined native-versus-DAG comparison.

PolicyA100 host: CPU driftRTX3090 host: CPU driftRTX4090 host: StableRTX4090 host: CPU driftRTX4090 host: Export drift
Native concurrency three543.25268.55284.64325.80323.66
DAG rule370.92236.92235.85293.76282.91

Table 10. Server execution comparison: mean seconds per six-task episode, five paired blocks per condition. Native uses a concurrency-three pool; DAG rule is a fixed graph-dependent plan selector. Accelerator names identify hosts. Episode times include execution and diagnostics.

Controlled CPU response. Figure 5 covers six compositions at ten CPU-affinity sizes: 120 executions, one observation per case, plan, and setting, in fixed pair order. Every execution completes. A private 128 MiB/s logical read/write service applies to each unit while host resources remain shared. The curves plot workflow time, with setup and diagnostics accounted for separately.

Model-authored orchestration. A render-first harness executes a known composition without routine model round trips. Four development cases match two CPU-affinity settings and two forced physical plans (Table 11). Worker time falls by 29.8%, with 118.0 s of normal generation calls removed. Native rendering time is 275.73 s before and 277.53 s after the change. This gain concerns the model-call path. Revised outputs satisfy the reported twelve-second, 1080p, 30-fps, audio-present checks and decode successfully.

CPUsForced planOriginal (s)Revised (s)
4Parallel119.9782.96
4Direct94.0968.82
16Direct94.5467.33
16Parallel106.1371.84
Total worker time414.73290.95

Table 11. Model-authored render-first orchestration on four matched development cases. Each pair uses the same forced physical plan. Original and revised runs are temporally separated.

Feedback changes plan selection. Whole-plan observations update a selector that can choose Direct or parallel execution. With the same revised source, feedback changes the twelve-clip landscape plan to Direct and leaves the mixed-orientation task unchanged (Table 12). Across eight suffix pairs, worker time falls from 227.85 s to 186.70 s, a reduction of 18.1%. A subsequent eight-suffix control measures 178.14 s for fixed Direct and 179.23 s for feedback. Thus, feedback recovers an effective existing choice; it does not outperform that stronger fixed control. Output checks also identify audio residuals and mixed-orientation geometry errors.

TaskCPUsPrior (s)Feedback (s)
Mixed, 6 clips423.2223.48
Mixed, 6 clips169.6810.17
Landscape, 12 clips460.3243.26
Landscape, 12 clips1620.7016.45

Table 12. Mean suffix worker time with the same revised source, two ordered repetitions per cell on one learning trajectory. Both compositions request 24 seconds. Feedback changes the landscape plan and preserves the mixed-task plan.

InputFull metric pairs / 16SSIM rangePSNR range (dB)
Local16/161.0000∞\infty
4 MiB/s10/160.9843–0.995632.8–46.4
1.5 MiB/s6/160.9843–0.995640.5–46.4

caption: Video fidelity relative to HPH_P on fully frame-aligned transfer pairs. Eight pairs have reference frame deficits; eight additional complete-output pairs have a one-frame-short metric record. Intermediate re-encoding produces measurable image distortion.

:::

Scheduling and overlap. Eight independent wait/admit pairs start from a common prediction state and use the same subsequent FIFO rule. Admit completes the stream sooner in all pairs, with mean saving 0.9%, and brings completion of the queued task forward by 5.09 s. The running task’s remainder increases by 40.16 s. This measures the trade-off between useful overlap and active-task contention.

Comparisons preceding Mac confirmation. The model selects three alternatives on the fixed task: two ranges, three ranges, and materialization followed by fusion. Their candidate/reference times are 15.31/14.21 s, 13.98/14.46 s, and 9.75/14.31 s. All six outputs complete. These observations enter the successor proposal before the separate confirmations in § 5.1.

Delivery-Recovery Diagnostic

A delivery-recovery comparison precedes the performance case. The initial fused H0H_0 produces 240/252/216 of the required 312 frames; HPH_P completes. A feedback successor retains the failing action. Three fresh blocks with the initial policy and an additional-call no-feedback control give nine further failed outputs.

Both branches then receive the same clarified complete-delivery objective. One call receives the execution outcomes; the matched call omits those outcomes. The resulting H2H_2 chooses four clip-aware ranges with LPT and completes, while the no-feedback control remains incomplete (Table 13). H2H_2 has the reference’s physical action and ratio 1.020. This comparison measures recovery of output validity. The performance case subsequently compares different complete-delivery plans.

PolicyDeliveriesLatency / HPH_P
No-feedback Hblind2H_{\mathrm{blind2}}0/3Undefined
Feedback H2H_23/31.020
Reference HPH_P3/31.000

Table 13. Recovery on three repetitions of one task. H2H_2 restores delivery but uses the reference’s physical action and has no speed advantage.

Development Cost

The Mac performance case uses two model calls, 553,255 tokens, and six paired experiments, including the three fresh confirmations. API call time totals 64.8 s. Incremental end-to-end study time is 11.6 minutes, including artifact transfer; post-timing output decoding takes 19.6 s. The Linux allocation experiment uses 25 generations and 1,561,455 generation tokens. Its experimental runtime is 11.8 hours, including failed setup, followed by 1.8 hours of output decoding. These are study costs; inherited experience acquisition and monetary costs remain incomplete.

EXPERIMENT_SUMMARY.json, included with the paper’s source package, records the reported metrics, model identifiers, fixed-plan comparisons, failures, and known cost components. It retains unsuccessful setup, model waiting/loading, and infrastructure costs with their overlap relations.

References

  1. [1]Gohar Irfan Chaudhry, Esha Choukse, Haoran Qiu, Íñigo Goiri, Rodrigo Fonseca, Adam Belay, and Ricardo Bianchini. 2026. Murakkab: Resource-efficient agentic workflow orchestration in cloud platforms. In 20th USENIX Symposium on Operating Systems Design and Implementation, pages 567–587. USENIX Association.arxiv.org/abs/2508.18298
  2. [2]Li Chen. 2026. AutoTuneBench: Trustworthy measurement for agent auto-tuning of LLM serving engines. Preprint, arXiv:2609.18123.arxiv.org/abs/2609.18123
  3. [3]Audrey Cheng, Shu Liu, Melissa Pan, Zhifei Li, Bowen Wang, Alexander Krentsel, Tian Xia, Mert Cemri, Jongseok Park, Shuo Yang, Jeff Chen, Lakshya Agrawal, Aditya Desai, Jiarong Xing, Koushik Sen, Matei Zaharia, and Ion Stoica. 2025. Barbarians at the gate: How AI is upending systems research. Preprint, arXiv:2510.06189.arxiv.org/abs/2510.06189
  4. [4]Haoyu Dong, Yuhang Zhou, Zihao Lin, Yifan Wu, Bo Peng, Mingyi Wang, Xiangjun Fan, Lizhu Zhang, and Zhuokai Zhao. 2026. Mixture of self-improving branches for agent harness optimization. Preprint, arXiv:2609.37834.arxiv.org/abs/2609.37834
  5. [5]Chris Egersdoerfer, Philip Carns, Shane Snyder, Robert Ross, and Dong Dai. 2026. STELLAR: Storage tuning engine leveraging LLM autonomous reasoning for high performance parallel file systems. Preprint, arXiv:2602.23220.DOI
  6. [6]Pouya Hamadanian, Pantea Karimi, Arash Nasr-Esfahany, Kimia Noorbakhsh, Joseph Chandler, Ali ParandehGheibi, Mohammad Alizadeh, and Hari Balakrishnan. 2025. Glia: A human-inspired AI for automated systems design and optimization. Preprint, arXiv:2510.27176.arxiv.org/abs/2510.27176
  7. [7]Haiyu Huang, Jiewei Lyu, Zhihan Jiang, Jinyang Liu, Xiao He, Tieying Zhang, Wu Xiang, and Michael Lyu. 2026. From general agents to RCA experts: A self-evolving harness for root cause analysis. Preprint, arXiv:2608.25661.arxiv.org/abs/2608.25661
  8. [8]Wen Jiang, Mingmin Chu, Yimeng Tian, Qianxin Zhang, Haofei Yang, Rui Yang, Yang Liu, Tao Lv, and Fangming Li. 2026a. HarnessEvolve: Learning from reference trajectories for reliable agent self-evolution. Preprint, arXiv:2609.00829.arxiv.org/abs/2609.00829
  9. [9]Youhe Jiang, Ran Yan, You Peng, Wenshuang Li, Taiyi Wang, Fangcheng Fu, and Binhang Yuan. 2026b. AUTOPOIESIS: A self-evolving system paradigm for LLM serving under runtime dynamics. Preprint, arXiv:2604.07144.arxiv.org/abs/2604.07144
  10. [10]Yubin Kim, Ken Gu, Chanwoo Park, Chunjong Park, Samuel Schmidgall, A. Ali Heydari, Yao Yan, Zhihan Zhang, Yuchen Zhuang, Yun Liu, Mark Malhotra, Paul Pu Liang, Hae Won Park, Yuzhe Yang, Xuhai Xu, Yilun Du, Shwetak Patel, Tim Althoff, Daniel McDuff, and Xin Liu. 2025. Towards a science of scaling agent systems. Preprint, arXiv:2512.08296.arxiv.org/abs/2512.08296
  11. [11]Bingjun Luo, Jialin Guo, and Siqi Li. 2026a. Video-RSI: Recursive self-improvement of video understanding agents via harness evolution. Preprint, arXiv:2609.37950.arxiv.org/abs/2609.37950
  12. [12]Yaxin Luo, Haobin Jiang, Jialv Zou, Xu Huang, Wenhao Yan, Haodong Li, Zhengrong Yue, Jing Li, Xiaofu Chen, Xiaohan Zhao, Jiacheng Liu, Jiacheng Cui, Zhiqiang Shen, and Xiaotong Li. 2026b. AutoDesign: Meta-harness optimization for long-horizon agentic design. Preprint, arXiv:2608.13560.arxiv.org/abs/2608.13560
  13. [13]Chenyang Lyu, Lecheng Yan, Rui Xing, Wenxi Li, Younes Samih, Tianbo Ji, and Longyue Wang. 2024. Large language models as code executors: An exploratory study. Preprint, arXiv:2410.06667.arxiv.org/abs/2410.06667
  14. [14]Alex Poms, Will Crichton, Pat Hanrahan, and Kayvon Fatahian. 2018. Scanner: Efficient video analysis at scale. ACM Transactions on Graphics, 37(4):138:1–138:14.DOI
  15. [15]Shuai Shao, Kangning Zhang, Qingyao Li, Shijian Wang, Hao Wang, Wenxiang Jiao, Yuan Lu, Yi Guo, Weiwen Liu, and Weinan Zhang. 2026. Harness-R1: Learning to edit executable runtime harnesses from agent failure trajectories. Preprint, arXiv:2608.02276.arxiv.org/abs/2608.02276
  16. [16]Dhruv Srikanth, Bingchen Zhao, Dixing Xu, Yuxiang Wu, and Zhengyao Jiang. 2026. Recursive self-improvement of AI research agents. Preprint, arXiv:2609.26457.arxiv.org/abs/2609.26457
  17. [17]Andrew Wagenmaker, Guanya Shi, and Kevin Jamieson. 2023. Optimal exploration for model-based RL in nonlinear systems. Preprint, arXiv:2306.09210.arxiv.org/abs/2306.09210

Paper details

vlnc:W_3m6bgpfa
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 2

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents