- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposed GI-RBF, a decoupled offline-online framework that uses Gaussian EBF to represent PDE solutions. The method includes a task conditioned generative initializer to predict the RBF parameter set which includes the coefficients, centers, scales, orientations and geometry. In the offline stage, the initializer is trained with solution supervision with short physics based optimization trajectories. In the online stage, its predictions are further refined through steps of physics-informed optimization. Experiments were conducted on four PDE families and a flow-mixing problem. With a matched online refinement budget, their method improves over PINN parameter methods and standard RBF initialization.
Critical strengths
1.The comparison with standard-RBF is well controlled. Both methods use the same setting so the effectiveness of learned initialization is established with controlled comparison.
2.The ablations are comprehensive and help to identify which components of the design play a major role in performance. The negative results on variational sampling and zero-shot self-bias are honest.
3.The learned initialization accelerates adaptation under limited online refinement budgets. This decoupling offline-online framework requires fewer optimization steps to achieve same accuracy.
4.The method uses a RBF solver that uses few trainable parameters and demonstrates a favorable accuracy-efficiency trade-off in comparison with MLP-PINN and SPINN in figure 2 and table 5.
Critical weaknesses
1.It is unclear whether all components in the framework contribute to the performance. For example in table 19 the result shows that in the single-start Allen-cahn experiment, the simplest deterministic initializer performs the best compared with stochastic and variational methods. Similarly in table 17, full-field zero-teacher control attains an effective initialization. While a 25-step teacher cannot consistently improve the endpoint medians across different confirmation panels.
2.The paper compared with baselines such as Hyper-LR-PINN, PINO, P2INN-SVD, standard RBF, however it is difficult to tell whether it is the gain brought by the RBF solver or the method’s generative initialization strategy. The authors might consider adding in learned initialization baselines as direct comparison such as Reptil/MAML style to showcase the advantage of generative initialization.
3.The end-to-end computational efficiency is not fully established. Table 16 shows that about 1000-1500 PDE queries are needed to offset the offline training cost relative to standard-RBF. The comparison with other learned PDE solvers such FNO and PINO are not included, and their offline training and deployment costs differ a lot. Given the paper claims efficient multi-query PDE solving, I recommend a more complete evaluation of total offline and online costs at fixed accuracy threshold to establish the claim.
Questions for authors
1.Can the authors evaluate the deterministic, no-KL initializer across all four PDE families with the same online refinement setting?
2.Can the author directly compare the time-to-target of refinement-informed teacher and direct conditional training to show the 25-step teacher component can accelerate adaptation?
3.How does the method compare with other shared meta-learned RBF initialization methods under the same online refinement? Or compared with other methods with a warm start from a neighboring training PDE condition.
4.The repeated query amortization in the main experiment and in table 16 have different configurations as one has 30, 000 outer updates one has 3,000 outer updates. Can the author report using the same fixed configurations and re-calculate the repeated-query crossover?
5.Could the author further clarify the methodological novelty of GI-RBF relative to current hypernetwork approaches such as HyperPINN and Gaussian-based solvers such as PIG. Given that conditional parameter generation and adaptive Gaussian representation have been explored in the literature, what is the distinct advantage of amortizing the initialization of the complete RBF parameter set?
6 comments
W2 and Q2 - Direct initialization baselines
Thank you for suggesting this comparison. We added Reptile-RBF and Shared-GI to assess whether task conditioning improves adaptation beyond a shared learned initialization. Reptile-RBF learns one shared initialization through first-order updates toward task-adapted parameters, without differentiating through refinement. Shared-GI retains our deterministic generator and training objective but uses a fixed condition, providing a direct control for conditioning. These comparisons complement Standard-RBF (submitted Figure 3 and Table 8), which tests the benefit of learned versus standard initialization under identical refinement.
We have not evaluated nearby-condition warm starts. That comparison would require specifying how training-task solutions are stored and how the nearest condition is selected.
Comparison. We evaluate all three learned initializations across four PDE families and two seeds, using the same 1,536 online parameters, test cases, physics loss, AdamW settings and GPU. All three receive the same number of training updates (Appendix D.4, Table 19b). Conditional GI and Shared-GI also match per-seed training tasks, architecture and objective.
| PDE | Method | Error after 25 updates (%), I / E ↓ | Reach ≤5% (%), I / E ↑ |
|---|---|---|---|
| Burgers | Conditional GI | 14.1 / 19.9 | 85 / 100 |
| Burgers | Shared-GI | 18.7 / 23.2 | 85 / 100 |
| Burgers | Reptile | 18.8 / 19.9 | 85 / 100 |
| Convection | Conditional GI | 2.6 / 6.5 | 100 / 100 |
| Convection | Shared-GI | 21.7 / 31.7 | 100 / 100 |
| Convection | Reptile | 10.6 / 14.4 | 100 / 100 |
| Allen–Cahn | Conditional GI | 34.1 / 49.4 | 85 / 40 |
| Allen–Cahn | Shared-GI | 26.8 / 38.4 | 97.5 / 45 |
| Allen–Cahn | Reptile | 24.9 / 38.2 | 100 / 45 |
| Helmholtz | Conditional GI | 71.5 / 80.6 | 57.5 / 62.5 |
| Helmholtz | Shared-GI | 126.2 / 136.8 | 30 / 25 |
| Helmholtz | Reptile | 92.8 / 83.2 | 52.5 / 40 |
Rebuttal Table R3-T2. Error averages all cases after 25 refinement updates. Reach counts cases attaining ≤5% within 1,000 updates, including all 40 seed–case observations per panel.
Shared initialization is a strong baseline: all three methods reach the target equally often on Burgers, and the shared starts are better on Allen–Cahn. Conditioning, however, lowers early error relative to Shared-GI on Burgers, Convection and Helmholtz. The clearest case is Convection, where conditional GI reaches 5% error in a quarter to half of the updates the shared initializations need. On Helmholtz, it also reaches the target most often.
Overall, task conditioning improves on a shared learned initialization on three of the four equations.
Q3 - Consistent repeated-query accounting
The initial 30k recipe used a fixed training budget. This choice was rather conservative, which inflated the break-even point. The reduced 3k training was introduced to show that the break-even point is a direct function of the GI training, which can be further optimized and thus result in a more attractive break-even point. We therefore present transparent reporting of the break-even point and accuracy at the higher-end (30k) and lower-end (5k) budgets of the same recipe, where the only modification is the number of training updates. Each budget is one fixed configuration with its own measured training cost, and query time is measured directly, including generator inference (about 2.5 ms) and online refinement.
| PDE | Training updates | Offline cost (s) | Saving/query vs Standard-RBF (ms) | Error @1,000 (%) | Reach ≤5% (%) | Break-even queries |
|---|---|---|---|---|---|---|
| Burgers | 30k | 5,640 | 188 / 105 | 2.60 / 1.76 | 85 / 100 | 29,933 / 53,775 |
| Burgers | 5k | 1,018 | 181 / 93 | 2.82 / 1.81 | 85 / 95 | 5,627 / 10,996 |
| Convection | 30k | 3,863 | 110 / 116 | 0.27 / 0.64 | 100 / 100 | 35,044 / 33,297 |
| Convection | 5k | 724 | 103 / 108 | 0.59 / 0.71 | 100 / 100 | 7,001 / 6,729 |
| Allen–Cahn | 30k | 5,078 | 112 / 104 | 1.42 / 11.74 | 95 / 40 | 45,233 / 49,040 |
| Allen–Cahn | 5k | 935 | 108 / 111 | 1.42 / 12.01 | 95 / 55 | 8,648 / 8,397 |
| Helmholtz | 30k | 4,656 | 150 / 158 | 6.37 / 9.40 | 75 / 75 | 31,073 / 29,539 |
| Helmholtz | 5k | 858 | 53 / 158 | 16.23 / 25.65 | 50 / 30 | 16,222 / 5,437 |
Rebuttal Table R3-T3. Break-even = offline cost ÷ mean saving per query, over cases where both methods reach ≤5% error within 1,000 updates. One training seed; Helmholtz extrapolation rests on only 3 of 20 cases. Cohort sizes and cost details: Appendix C.2.1.
Against Standard-RBF, the 30k recipe breaks even after about 30,000–54,000 queries; stopping the same run at 5k reduces this about fivefold, with close accuracy on Burgers, Convection and Allen–Cahn. This comes mainly from the lower training cost, as the saving per query stays similar; only Helmholtz benefits from the longer training. A second training seed reproduces the 30k training cost within 1%.
In addition to this reporting, we also include the break-even points of the original 30k checkpoints against PINO and P²INN-SVD as a reference for the reader (Appendix C.2.1, Table 14b).
Overall, the main configuration does amortize, and its break-even point is mainly set by the training budget, which can be reduced while keeping close accuracy on three of the four equations.
The need for many queries is already stated as a limitation in the submitted paper. In the revised version, we update it to state that shorter training reduces the number of queries needed (Limitations, page 9, lines 479–481). Since this work focused on the initialization–refinement design rather than on optimizing the pre-training cost, we also mark this as a direction for future work; the shorter-training results above show that there is room to reduce it.
Full cost–accuracy results, including the 10k budget, cohort sizes and capped-cost sensitivity: Appendix C.2.1, Table 14a.
W1 and Q1 - Deterministic, variational, and teacher contributions
Thank you for asking us to clarify the roles of these two components. We agree that the main text did not state them clearly. The core of GI-RBF is the conditional initializer; both components are optional training choices on top of it:
Variational training. All reported results decode the conditional latent mean, i.e., one initialization per PDE. The same architecture can be trained deterministically, without the KL penalty and with the conditional mean instead of latent samples, and this deterministic initializer is sufficient for the single-start acceleration. Latent sampling adds the option of generating several candidate initializations for the same PDE; KL is not required for this and gives a bounded additional benefit
(Appendix D.3).Refinement-informed training. Direct conditional training already gives useful initializations
(Table 17). The teacher additionally aligns the initializer with the deployment optimizer, which reduces the refinement steps needed to reach the target at a higher offline cost.We clarified these roles in the main text
(Section 4.3: page 5, lines 216–220; Section 4.4: pages 5–6, lines 267–272; Experiment II: page 7, lines 334–337). Below, we answer Q1 with evidence for both.1. Deterministic initialization is sufficient across all four PDEs. Deterministic and variational initializers use the same refinement teacher, online refiner and training budget. The deterministic initializer has lower error after 50 refinement updates in all eight panels.
Rebuttal Table R3-T1. Mean relative-L2 error (%) after 50 refinement updates, Interpolation / Extrapolation; three training seeds. Both initializers use the same teacher, online refiner and training budget. Full results:
Appendix D.3, Table 19a.In the separate shared-initialization comparison, deterministic GI also reaches 5% error in fewer median steps than Standard-RBF in six of eight panels, and as often or more often in all eight
(Appendix D.4, Table 19b).2. Refinement-informed training reduces refinement steps, at higher offline cost. With the deterministic initializer and online refiner held fixed, adding the teacher reduces the median steps to 3% error in three of four interpolation/extrapolation panels across Burgers and Allen–Cahn, and matches the fourth, without reducing target reach. This requires 2.3–2.7× the offline training time.
Final error also improves on Burgers, but the effect is mixed on Allen–Cahn. Convection and Helmholtz were not tested in this ablation. The teacher is therefore a useful training option, rather than a requirement for effective initialization.
Full results, settings and per-seed detail:
Appendix D.1, Table 17a.