- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
AnaFlash is a training-free, hybrid AI-analytical framework for automated analog circuit sizing that decouples numerical parameter exploration from high-level trade-off adaptation. Starting from a valid operating point initialized via lookup tables, the framework constructs a local logarithmic design Jacobian using SPICE small-signal parameters and adjoint Modified Nodal Analysis (MNA) sensitivities to compute numerical device updates via a trust-region Chebyshev linear program. A lightweight LLM (Qwen2.5-7B) is invoked only when the analytical solver stalls in a locally unproductive region, adjusting metric priority weights rather than guessing transistor dimensions. Validated across 990 sizing tasks spanning 6 OTA topologies, 5 filters, and 3 technology nodes, AnaFlash achieves 100% OTA and 94.7%–100% filter success rates in 17–67 average SPICE simulations, delivering up to a runtime speedup over recent RL and LLM-agent baselines.
Critical strengths
-
Restricting the LLM to adjusting priority weights () when stalled, while using an analytical sensitivity solver for numerical updates, avoids the poor mathematical reasoning of LLM-only sizing flows.
-
The analytical engine alone solves 97% of OTA tasks, proving the physical model drives the speedup, while the 7B LLM resolves the remaining 3% of stalled cases and improves power/area.
Critical weaknesses
-
Adjoint MNA () only captures linear AC metrics; the paper omits how is derived for large-signal Slew Rate or DC operating-point shifts without finite-difference sweeps. Also, "Infeasibility Proof" and "Verified Explainability" are claimed in Table 1 but never evaluated.
-
The Ethics Statement calls the framework "ThunderGen" (line 502), Table 10 has corrupted column alignments.
Questions for authors
-
How is the Jacobian computed for large-signal metrics (Slew Rate) and DC operating-point shifts () using only linear AC adjoint MNA () without perturbation sweeps?
-
How many offline SPICE simulations are needed to build the Stage 1 LUTs, and what fraction of tasks already meet specifications at the initial seed ?
-
Can you provide empirical validation for the "Infeasibility Proof" and "Verified Explainability" claims in Table 1?
2 comments
My concerns have been largely addressed. I'd like to maintain my score.
We thank the reviewer for the positive assessment, and for noting that restricting the LLM avoids the weak numerical reasoning of LLM-only flows. This is now the paper's central message.
Q1. Jacobian for large-signal metrics and DC shifts: For slew rate, the engine uses the operating-point estimate SR=2maxd∈Dout∣ID,d∣/CL, where Dout is the set of devices connected to the output and the currents ID,d come from SPICE. For DC shifts, it linearises the DC Kirchhoff equations F(V,k)=0 and solves GDC,∂V/∂lnkj=−∂F/∂lnkj for each knob kj. It then combines these voltage shifts with local device derivatives and evaluates the metric on the perturbed states by centred differences in model space. The device derivatives come from perturbed isolated-device instances, batched into one SPICE operating-point run, so no full-circuit perturbation simulation per knob is needed. Against full-circuit SPICE central differences (5T and two-stage OTAs, PTM 45 nm), the geometry elasticities agree within 0.03 and 0.014 (absolute), and the bias elasticities within about 4%. This is now described in Section 3.2.
Q2. Offline LUT cost. The LUTs are built once per technology and reused across all circuits and specifications. Each polarity and channel length is one batched ngspice operating-point deck, with a 5 mV VGS grid and 9 VDS points:
These are single-device evaluations rather than circuit simulations. They are not included in the per-task counts, and Appendix A.2 (Table 9) now reports them.
Q3. Tasks met at the starting design. On the original benchmarks, the starting design already met 120 of 540 OTA tasks (22.2%), which is consistent with uXLa's point that those targets were modest. On the new benchmarks described in our response to uXLa (W3), it meets 50 of 320 hard OTA runs (15.6%) and none of the 450 PTM 45 nm filter runs, so the optimisation loop does the work. These fractions are now in Appendix A.2.
Q4. Infeasibility and explainability. These are now evaluated (general response, point 2). All 42 challenging cases were flagged with a quantitative reason and none had a satisfying design. The engine's sensitivity claims agree with SPICE finite differences in 569 of 573 cases. See Sections 4.3–4.4 and Appendices A.4–A.5.
Ethics Statement and Table 10. Both are fixed.