EDA flow parameter tuning is critical for quality-of-results~(QoR), yet the parameter space is large, tightly coupled, and full evaluations are prohibitively expensive. Prior LLM-assisted tuners mainly use the LLM as an external proposer with transient working context; we instead present StateTune, which reformulates LLM-assisted EDA tuning as a closed-loop, state-carrying process. Its optimizer state is a typed, evidence-gated persistent optimization memory that is updated by every evaluation and shared between candidate generation and budget allocation. On top of this optimizer state, an expected hypervolume improvement (EHVI)-guided, runtime-aware promotion policy ranks quick-stage candidates by expected Pareto frontier gain per unit of runtime cost. Evaluated on a Cadence industrial flow across six benchmark blocks (two technology nodes × three designs), against five baselines including LLM+retrieval-augmented generation (RAG) and preference-based Bayesian optimization (BO) tuners, StateTune achieves the strongest final hypervolume on all six benchmark blocks, showing a stable improvement in frontier quality across the full matrix; it also matches or surpasses the strongest baselines on worst negative slack (WNS), area, and power across the same set. Ablation shows persistent memory is the largest contributor: removing it costs 58.5% of the hypervolume. Dedicated analyses of evidence-gating sensitivity, memory poisoning, cross-design transfer, and three-seed reproducibility (CV,<,7% on five of six blocks) further validate the memory design.
Figures & tables
Figure 1. Overall workflow of StateTune. The knowledge layer (left) builds and updates persistent optimization memory from design inputs and evaluation feedback via Prior Initialization and an Analysis Agent. The decision layer (center) generates candidate configurations through Knowledge-guided Search and ranks them via EHVI-based Promotion; an Evaluation Engine arbitrates the final selection. The execution layer (right) schedules multi-fidelity evaluations through a Scheduling Agent and returns QoR metrics. The persistent optimization memory connects all three layers.
Method
LLM search
RAG
Memory type
Gate
Multi- fid.
Multi- obj.
Cross- design
PTPT ( 7 )
∘
∘
–
∘
∘
∙
∘
FlowTuner ( 13 )
∘
∘
–
∘
∙ a
∘
∘
RankTuner ( 21 )
∘
∘
–
∘
∘
∙
∘
CROP ( 14 )
∙
∙ b
Prompt hist.
∘
∘
∘
∘
ORFS-agent ( 8 )
∙
∘
Prompt hist.
∘
∘
∙ c
∘
AstroTune ( 19 )
⊙ d
∙
–
∘
∙
∙
∘
Table 1. Capability comparison of EDA flow tuning methods. ∙ = supported; ∘ = not supported; ⊙ = partial.
Figure 2. Structure of the persistent optimization memory Mt . Evaluation results, failure diagnoses, and sensitivity analyses feed into six components. The design prior Pt conditions generation; reusable rules Rt guide failure avoidance; Pareto status Πt and the runtime model Tt drive EHVI-based promotion.
Table 6. Results across the 2×3 benchmark matrix under the shared budget caps. Six methods are compared: BO (qEHVI), Optuna-TPE, Random, RankTuner (ICCAD’24) ( 21 ) , CROP (ICCAD’25) ( 14 ) , and StateTune. Bold = best per benchmark (per column).
Figure 3. Pareto frontier projections for the ASAP-JPEG case ( − Area vs. WNS, − Area vs. − Power, WNS vs. − Power). StateTune (purple triangles) occupies the strongest region among the compared methods.
Figure 4. Anytime hypervolume trajectory for ASAP7-AES, averaged over three independent runs per method with shaded ±1 standard-deviation bands. StateTune (cyan) separates from all baselines early and maintains a clear advantage throughout the run.
ASAP7
NAN
Benchmark
HV ( μ±σ )
CV (%)
Benchmark
HV ( μ±σ )
CV (%)
JPEG
5.33e5±8.21e4
15.4
JPEG
2.53e6±1.29e4
0.51
AES
3.73e6±3.32e4
0.89
AES
4.42e3±6.34e1
1.43
IBEX
4.57e5±2.86e4
6.27
IBEX
1.66e3±9.00e1
5.42
Table 7. StateTune reproducibility over three independent runs.
Variant
Final HV (M)
HV Drop (%)
Pareto Hits
First Hit (h)
Full system
10.10
—
6
10.29
w/o Persistence
4.19
58.5
0
–
w/o KA
4.57
54.8
2
2.10
w/o RAG
5.44
46.1
0
–
w/o CoT
6.92
31.5
1
29.62
w/o EHVI
8.32
17.6
4
12.93
Table 8. Ablation on ASAP7 JPEG under 48 thread ⋅ h budget. Variants ordered by degradation severity.
Figure 5. Additional validation on ASAP7 JPEG under 48 thread ⋅ h. (a) Final HV and global Pareto hit rate peak at k=12 . (b) Transferred memory converges faster and reaches higher final HV than no transfer. Thin curves denote individual runs, thick curves denote means, and shaded bands indicate ±1 standard deviation.