benchmark-optimization-loop

Topics in the source

• Benchmark Optimization Loop
• Required Baseline
• Loop
• Variant Table
• Recursive Search
• Promotion Gate

Use this skill to convert "make it 20x faster" or "try 50 recursive optimizations" into a bounded measured loop that can actually improve a system. Do not optimize until these exist: the operation being optimized; the correctness gate that must stay green; the metric: wall time, p95 latency, rows/sec, cost/run, memory, error rate; the current baseline; the search budget: max variants, max time, max spend, max data impact. If the user asks for an unrealistic target, keep the ambition but make the loop bounded and measurable. 1. Measure the baseline. 2. Identify bottlenecks from evidence. 3. Generate variants that test one hypothesis each. 4. Run variants with the same input shape. 5. Reject variants that fail correctness, safety, or reproducibility. 6. Promote the fastest safe variant. 7. Codify the winning path in a script, command, test, config, or doc. 8. Rerun the baseline and winner to confirm the delta. Track variants like this: For recursive or hyperparameter work: persist every run to a ledger; compare against the prior accepted winner, not only the previous run; keep a holdout or replay check; stop when improvement is within noise, correctness fails, cost exceeds the budget

This is an excerpt. Refer to the complete source and its current requirements.