- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
Active Geometry Synthesis (AGS) is an active learning framework designed to improve the out-of-distribution generalization of neural operators by synthesizing complex PDE geometries that maximize model uncertainty. To synthesize valid new shapes, AGS parameterizes geometries using differentiable free-form deformations and converts a trained deterministic neural operator into a function-valued Gaussian process (GP) via Laplace approximation.
The primary technical contributions include formulating the GP's predictive variance as a computable surrogate for worst-case error across the geometry manifold, alongside kernel conditioning and trust-region regularization to enforce diversity during batch synthesis. Methodologically, this provides the first synthesis-based active learning framework explicitly designed for complex, continuous geometric distributions in operator learning rather than scalar parameters or initial conditions.
Validated on 2D Euler transonic airfoil flow and bistable reaction-diffusion systems, AGS achieves up to a 40% reduction in volumetric relative error and a 50% to 70% reduction in drag coefficient error on unseen geometric families compared to uniform i.i.d. sampling.
Critical strengths
- Principled Active Synthesis Framework for High-Dimensional Geometric Domains
Existing active learning techniques for neural operators are largely restricted to scalar PDE parameters or initial conditions. AGS bridges this gap by unifying Laplace-approximated neural operators (function-valued Gaussian processes) with differentiable Free-Form Deformations (FFD). Differentiating the GP predictive variance directly with respect to FFD control points enables gradient-based optimization to synthesize challenging shapes.
- Significant Out-of-Distribution (OOD) Generalization Gains on Complex Dynamics
On challenging benchmarks where subtle geometry changes drastically alter physical behaviors (e.g., shock wave formation in 2D transonic Euler flow and ignition thresholds in bistable reaction-diffusion systems), AGS achieves up to a 40% reduction in volumetric relative error and a 50% to 70% reduction in drag coefficient () error on unseen shape families.
Critical weaknesses
- Breakdown of the Uncertainty Surrogate Far OOD and Heavy Reliance on Heuristics
The core theoretical foundation relies on the Laplace predictive variance acting as a reliable upper-bound surrogate for the operator's worst-case error. However, the authors acknowledge that local linearization via the Laplace approximation becomes severely overconfident far from the training distribution, causing the correlation between predictive standard deviation and actual prediction error to saturate and break down on distant geometries. To prevent gradient ascent from driving geometries into degenerate or overconfident regimes, the method relies on regularizing heuristics, such as a tuned trust-region penalty , domain-specific shape filters, and manually replacing invalid/rejected synthesized samples with uniform draws (e.g., 74 samples rejected in the reaction-diffusion experiment).
- Systematic Degradation of In-Distribution Performance
Across both the Airfoil and Reaction-Diffusion benchmarks, training with AGS consistently leads to worse in-distribution performance compared to standard i.i.d. uniform sampling and competing synthesis baselines like PaPQS. For example, on the NACA 0012 in-distribution dataset with , AGS yields a volumetric relative error of 0.047 compared to 0.037 for uniform sampling and 0.035 for PaPQS.
Questions for authors
N.A.
3 comments
Thank the author for the clarification. 1. I think the argument of gradually pulling OOD closer to training manifold is convincing; 2. The trade-off between in-distribution and OOD is clarified, and therefore ID performance should not be understood as limitation alone.
I have no further concern. Therefore, I keep my score and recommend acceptance.
Dear Reviewer qAE9,
Thank you for your response and for recommending acceptance. We are glad that our clarifications addressed your concerns. We have uploaded the revised manuscript (changes in blue), which incorporates the points from our discussion.
- W1, uncertainty surrogate and heuristics: The ablation of the trust region, including the rejected geometries for each trust-region weight, is in the new Appendix F. The role of the trust-region weight is also added to the limitations in Section 5, and the validity checks are discussed in the new Appendix B.6.
- W2, in-distribution performance: The trade-off between in-distribution and OOD accuracy is clarified in the closing paragraph of Section 4.2 and in Section 5.
If you have any further questions or concerns, we would be happy to address them.
Best regards,
The authors
We thank the reviewer for the recognition of the strengths of our works and the careful review. Below, we address the raised Weaknesses (W). In addition, we will soon submit a revised manuscript that incorporates the new results and discussions.
W1:
We agree with the diagnosis, and we would like to clarify how AGS is designed around it. The linearized Laplace approximation is a local approximation of the posterior around the MAP weights θ⋆, so its variance is informative only where the operator error is approximately captured by the linearized operator, i.e. near the training data. Overconfidence far from the training data is a known limitation of approximate posteriors for neural operators, and Figure 3b measures it for our setting, where the variance tracks errors with Spearman's ρ=0.81 and saturates for the two farthest families. For this reason, Eq. 8 serves only as a motivation (Remark 3), and AGS does not require the variance to be calibrated far from the data. Instead, AGS uses the variance as a local ranking signal. Each round synthesizes geometries near the current dataset, where the variance is informative, then retrains the operator and recomputes the posterior, so the region where the variance is reliable expands with the dataset. Figure 3a shows the outcome, as the distant OOD families end up much closer to the AGS dataset than to the Uniform and PaPQS datasets.
The trust region follows from the same reasoning, in the spirit of trust-region optimization, where a local model is trusted only within a radius. Our new ablation on Airfoil (in-loop models at 512 labels, see our response to Reviewer yF5J for details) shows that μ controls a trade-off between in-distribution and OOD accuracy:
A strong trust region (μ=1) loses most of the OOD gains. Without it (μ=0), the OOD errors are lowest after three rounds, but the designs drift towards the FFD box bound (43% of the design coordinates in the third round, against 11% for μ=0.3), as the ascent targets unreachable designs outside the box. Such saturated designs can harm the diversity over more rounds, even with kernel conditioning. We note that the best μ may change with more acquisition rounds.
Regarding the shape filters and replacements, the validity checks are a property of the geometric design space. They are applied identically to Uniform, PaPQS, and AGS samples, and both the checks and the replacements are automatic, with no manual intervention per sample. For Airfoil, the thickness constraint is built into the projection step of the gradient ascent, and no synthesized geometry was rejected. In RD, the 74 of 448 rejected geometries all failed the same check (an over-diffused source). Our new RD ablation (see our response to Reviewer yF5J) shows that the trust region itself halves these rejections at μ=0.3. Of 192 synthesized geometries, 80 failed this check without a trust region (μ=0), 41 with μ=0.3, and 1 with μ=1. Building this check into the projection in the same way would remove the need for replacements, which we leave for future work.
W2:
We understand the reviewer's concern regarding the in-distribution performance. As we acknowledged in Section 5 and correctly pointed out by the reviewer, AGS may deteriorate the ID performance compared to Uniform sampling, which we observe in Airfoil and the new elastoplastic benchmark (see our response to reviewer yF5J). In RD, however, AGS achieves the lowest in-distribution error at N=512 (0.020, against 0.026 for Uniform and 0.022 for PaPQS, Table 6). Furthermore, we would like to highlight that, for both Airfoil and RD, AGS consistently improves the ID performance as well as OOD generalization with increasing label budget (see Fig. 2). On the other hand, adding uniform samples does not always improve the OOD generalization (e.g. Fig.2, MH113 airfoil and Ellipse RD). As such, AGS brings about a trade-off, while its errors consistently decrease on almost all evaluation sets with increasing budget. We note that when the target geometric distribution can be exactly predetermined and restricted, such trade-off may not be desirable. But when the target geometric settings are flexible and broad, as in many engineering and shape optimization problems, AGS offers a more reliable performance that consistently improves with additional computational and label budget.