1. The 71 times claim is too big for the evidence.
In Table 1, Qwen on GOC-500 goes from 1.0×10⁻⁹ to 1.4×10⁻¹¹. That ratio is about 71. The spread on the new error is ±2.4×10⁻¹⁰. The spread is about 17 times the mean. A few tiny cases can pull a mean down. GPT on IEEE-118 has the same pattern: 2.7×10⁻¹⁰ ± 9.9×10⁻¹⁰. Please also show the median.
Section 2 already says this “error” is the power mismatch, not the voltage error against a reference solution. Both 10⁻⁹ and 10⁻¹¹ are already far below a normal power-flow stop test. Appendix C cites Higham (2002), Moré and Wild (2012), and Molzahn and Lesieutre (2013) to say a tighter mismatch can help later grid checks. The paper never runs those later checks. So a reader cannot see if 71 times changes any engineering choice.
Other cells are much smaller. Claude on IEEE-118 goes from 1.1×10⁻⁹ to 7.4×10⁻¹⁰. That is about 1.5 times. The abstract leads with the best cell.
2. Speed does not always stay the same.
The abstract says ADSD keeps or improves speed. Table 6 says otherwise for GPT on GOC-500. On the unseen N1 grid, time goes from 0.38 s to 0.62 s. On the full N grid, time goes from 0.37 s to 0.60 s. The new solver is slower on those grids.
3. The power-flow base solver is dense. Real grid solvers are sparse.
Appendix B says each Newton step builds one dense factorization. Tinney and Hart (1967), already in the reference list, use sparse ordered elimination. MATPOWER (Zimmerman, Murillo-Sánchez, and Thomas, 2011) and pandapower (Thurner et al., 2018) also use sparse linear algebra. GOC-500 is a 500-bus grid. A dense base makes the start look weak.
Table 5 shows what the skills change. Factorizations go from 5.116 to 2.755 or 3.114. That win is “do fewer dense factorizations.” A sparse base can shrink this win. The paper has no sparse run.
4. The tables have no strong classic solver, and no close agent method.
On AC-OPF, the kept skill is a known Ipopt trick from Wächter and Biegler (2006). The same scaling idea is also in Nocedal and Wright (2006). Qwen’s pass rate jumps from 14.42% to 98.36% (Table 2). GPT only moves from 97.82% to 99.26%. The big jump fits a weak model that forgot a standard trick. A short prompt that names Ipopt scaling could do the same job. That control is missing. There is also no Ipopt, MATPOWER, or pandapower number on the same cases.
On stiff ODEs, the agent may use only Python and NumPy. Städter et al. (2021) already score strong integrators on these biology models. Hairer and Wanner (1996) is the standard book for BDF and Radau. Those methods are not in the tables. Claude’s base solver already passes 94.0%. Qwen’s already passes 98.3% (Table 3).
On the diffusion PDE, there is no algebraic multigrid run, and no ILU-GMRES run. Saad (2003) is the usual source for GMRES and preconditioners. ConDiff (Trifonov et al., 2024) is a high-contrast set, so those baselines matter. The closest agent papers are only in the text: SciML Agents (Gaonkar et al., 2025), CodePDE (Li et al., 2026), and AutoNumerics (Du et al., 2026). PDEAgent-Bench (Hang et al., 2026) and the PETSc agent study (Zhang et al., 2026) are also only in the related work. Guo et al. (2022), who learn ODE integrator coefficients, are in the same position.
5. The self-improve test does not isolate diagnosis.
The paper’s main claim is that diagnosis is the key step. Figures 3 and 4 only remove the whole ADSD plan. The rewrite arm cannot read the paper database. A gap there can come from reading papers alone. Appendix C says open search is not enough, but that part is one story, not a table.
This missing arm matters because the skill step overlaps older work. Voyager (Wang et al., 2024) already stores skills and reuses them. Reflexion (Shinn et al., 2023) and ExpeL (Zhao et al., 2024) already turn run logs into the next try. Paper2Agent (Miao et al., 2025), SkillFoundry (Shen et al., 2026c), and ResearchCodeAgent (Gandhi et al., 2025) already turn papers into code tools. AgentRx (Barke et al., 2026) already reads failure traces. Huang et al. (2025a) already test guesses against data. The new piece in ADSD is the checked numerical guess in the middle. The experiments never turn only that piece off.
FunSearch (Romera-Paredes et al., 2024) and AlphaEvolve (Novikov et al., 2025) search for better code with many tries. The intro says code search is a different job. There is still no search baseline with the same public score. ProOPF (Shen et al., 2026a) is very close to the AC-OPF section, and it is not a baseline. Cai et al. (2026) update weights with physics rewards. This paper does not update weights, but the title says “Training.” That word can mix up the two ideas.
The biggest AC-OPF jump is also outside the ablation. Section 4.5 and Figures 3 and 4 cover power flow and ODEs. They do not cover the Qwen pass-rate jump, and they do not cover the PDE.
6. The AC-OPF error skips the hard cases.
Table 2 computes mean error only on cases that N0 and ADSD both pass. Qwen fails most cases at the start. Cases that only the new solver finishes never enter the error. Those cases can look worse. The pass rate is the real result. The error line can look too kind. The paper also never states the pass rule: which limit gap, and which optimality gap.
7. The 90% rule can keep a weak common pattern and drop a rare real bug.
A guess is kept if it passes on more than 90% of pool V. V comes from the same public set as the discovery cases. The power-flow link that they keep is small: 5.78 Newton steps versus 5.01 steps. The cutoff was fit on those same 200 cases. The later check is still the same public pool. It is not the hidden set.
A bug that hits only a few cases will fail a 90% rule on all of V, even when the guess is right on those few cases. The paper also never says how many guesses were tried and thrown away. Many cutoffs make a pass more likely. Huang et al. (2025a) give a stricter test for a guess. This paper cites that work and then uses a flat 90% cutoff. The score itself is also unclear: accuracy on all of V, or precision only when the condition is true. In the AC-OPF case study, the authors report the subset. The main text says “90% of V.”
8. The “new regime” tests stay close to the training cases.
Tables 6 and 7 move from N2 to N1 to full N on the same IEEE-118 and GOC-500 grids. That puts one or two parts back. It is not a jump to a new grid family in PFΔ (Rivera et al., 2025). On the harder near-infeasible GOC-500 cases, GPT’s error drop is about 23% (Table 7: 1.1×10⁻⁹ to 8.5×10⁻¹⁰). The paper cites Canizares and Alvarado (1993) for cases near the voltage limit. The skills in Appendix B are higher-order Newton steps. They are not a continuation method for that limit.
For the PDE, train and test share the same 12 coefficient families. New draws from the same family are a weak shift. The abstract’s words “unseen grid topologies and operating regimes” are broader than these tests.
9. One agent run is not enough, and the build cost is missing.
The ± values are over test cases. They are not over new runs of the agent. A coding agent can be lucky once. The PDE repeats each solve three times. It does not repeat the full ADSD plan.
Appendix C says the power-flow search starts from 312 papers. The AC-OPF search uses 376 papers and 4,136 screening judgments. The tables report solver time only. Five rewrite loops are not the same budget as hundreds of paper reads. The paper list, the prompts, and the code are not provided. ODE and PDE paper-list sizes are not even stated.
Table 5 also shows a selection problem. Method 9 alone reaches 7.46×10⁻¹³. Both skills together reach only 2.76×10⁻¹⁰. The main GPT IEEE-118 result, 2.7×10⁻¹⁰, matches the weaker mix. The caption says the agent must use the listed skills. The plan can force a skill that hurts the error.
The “theory audit” is another LLM read of the same papers. It is not an outside check.
Author response
We genuinely appreciate your time to provide these constructive and helpful feedbacks. We address each point below:
W1: without clearly defining what constitutes successful verification.
We apologize for the lack of clarity. As described in lines 206–207, we split the public cases into a diagnosis pool for developing hypotheses and a separate verification pool for testing them. Each hypothesis is converted into a deterministic detector with an explicit numerical condition and a predicted solver behavior. For example, Eq. 3 in Appendix B.1 hypothesizes that cases satisfying σmin(J)≤0.16 require more nonlinear iterations on average under N0 than cases above this cutoff. Verification accuracy is the fraction of all cases in the verification pool for which the predicted behavior matches the observed behavior, and a hypothesis is retained only when this accuracy exceeds 90%.
Typically, rejected candidates achieved verification accuracies less 50%, whereas effective candidates exceeded 90%. To illustrate this screening process, we provide an example from Qwen3.8 AC-OPF, with all its hypotheses provided:
W2: Eq.7, low KKT solver may be due to premature stop
Good point, we agree, and we have already stated it immediately after Eq.7. Furthermore, the agent found the root cause and solved problem.
Specifically, the premature stop happened because a large initial dual steps led to very small primal step fractions, and the baseline terminated after 13 consecutive iterations without sufficient progress. The agent further identified a scaling imbalance as the underlying cause and addressed it by applying row scaling and revising the KKT progress measure.
W3: significance of the residue & downstream application.
We agree. PF solutions are inputs to downstream engineering tasks, where their accuracy affects the physical quantities used for operational assessment. To demonstrate the downstream benefits of our PF improvements, we evaluate branch-loading assessment on 5000 GOC grids near the voltage-stability boundary, which uses PF solutions to compute branch-loading ratios and measures line utilization relative to capacity and support the assessment of overloads. We note that the ill-conditioning can amplify numerical errors, so high precision in the initial PF solution is then very important.
ADSD reduces the mean loading-ratio error by approximately 47$\times$ and the P95 error by 30$\times$. We believe these results demonstrate a direct downstream benefit, as the improved PF solutions yield substantially more accurate branch-loading estimates for grid security assessment.
Apart from this task, PF solutions are also used in alternating current (AC) contingency analysis, security assessment, and operational planning. In these applications, PF solutions determine quantities such as bus voltages, branch flows, and constraint violations. Numerical errors and inaccuracies can affect the reliability of these quantities, particularly when operating conditions are close to security limits. Moreover, repeated PF evaluations are common in contingency and time-series analyses, where previous solutions serve as warm starts to reduce computation. Accurate intermediate solutions can therefore improve the numerical reliability of these workflows.
We have added more industrial examples in Appendix C to illustrate situations where low PF residuals are important.
W4: additional runtime on some cases
We agree that runtime improvements are not uniform across settings. We have revised our claim in the updated manuscript to state that ADSD improves accuracy with setting-dependent runtime trade-offs.
In the end, we thank you for your close reading and useful feedback. We hope that our responses have addressed your concerns, and we look forward to an open-minded discussion if any such concerns remain.
Sincerely,
Authors of Paper 186