- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes KAPI-ONet, a physics-informed operator-learning framework that directly generates an explicit, task-adaptive Gaussian radial-basis representation of the solution field. For functional inputs, a pretrained Gaussian-splat functional autoencoder (GSFAE) encodes inputs into interpretable amplitudes, centers, and scales. A conditioning network then predicts a compact “parent–child” kernel geometry and coefficients that decode into an analytic continuous solution field, trained only with PDE and boundary/initial residuals. Experiments across elliptic, time-dependent, and Navier–Stokes problems, plus two biomedical applications (inverse hemodynamics and weakly supervised cardiac annotation), show that KAPI-ONet yields competitive accuracy with substantially reduced CPU-only training time and provides interpretable task-dependent kernel geometry.
Critical strengths
The core idea of task-conditioned, explicit kernel geometry for operator learning is well motivated and distinct from dominant latent-representation approaches (e.g., DeepONet trunk, FNO transforms). The hierarchical parent–child factorization is a thoughtful design to balance geometric adaptability with parameter efficiency, offering a principled mechanism to share geometry while keeping child coefficients independent. The mapping from a structured Gaussian-splat input representation to a similarly structured solution representation yields an interpretable, coordinate-aware interface on both sides of the operator.
Critical weaknesses
- Freezing the GSFAE may create a representational bottleneck, particularly OOD where previously unseen fine scales appear; the paper acknowledges degradation on reduced correlation-length GRFs.
- The approach is demonstrated mainly on 1D/2D and relatively smooth problems; how the fixed Gaussian family handles sharp discontinuities, complex 3D geometries, or multi-physics couplings is unclear to me.
- There is no theoretical guarantees (e.g., approximation rates or stability with parent–child sharing) provided. Selection of the number of parents/children is empirical.
- Baseline comparisons are not fully apples-to-apples. PI-WNO uses a different error metric and some hardware/training-budget normalizations are estimated or missing. Key modern PINO baselines (e.g., PINO, PI-CViT) are not reported.
- There is no ablation of the GSFAE itself (e.g., joint end-to-end training vs freezing; reconstruction fidelity vs operator accuracy), nor a study of collocation strategies and loss weighting (which strongly affect PI training).
- Comparisons against RBF/PINN hybrids (SPINN, sparse RBF PINNs) or kernel-operator baselines are absent despite high conceptual overlap.
- Biomedical experiments lack robustness studies to measurement noise and broader clinical validation. The reported hemodynamics involve idealized settings and sparse/noiseless measurements.
Questions for authors
- What are the typical parent/child kernel counts and parameter budgets used per benchmark, and how sensitive are results to these choices? Could you report accuracy vs kernel count trade-offs in the main text?
- How accurate is the GSFAE reconstruction on the input distributions used, and how does end-to-end fine-tuning (vs freezing) affect operator accuracy and OOD robustness?
- Can you clarify the exact decoding formula (A_z, B_z, child sum) and which boundary/initial conditions are hard-embedded versus softly penalized in each benchmark?
- Could you provide unified metric comparisons against PINO/PI-CViT (and, if feasible, SPINN/sparse RBF PINNs) under matched training budgets, even at reduced scales, to better situate KAPI-ONet’s accuracy/efficiency trade-off?
- How are collocation points sampled and weighted across interior/BC/IC residuals, and how sensitive is training to these choices (e.g., Latin hypercube vs uniform, adaptive sampling)?
- For hemodynamics, how robust is WSS recovery to measurement noise and sensor misplacement? Can you include a small parametric study (e.g., SNR sweep, sensor proximity to walls)?
- Do you foresee a principled criterion for selecting the degree of parent–child sharing (e.g., validation-based model selection or information criteria), and could this be automated during training?
16 comments
Response to Q1 of Rev BQrk
We thank the reviewer for this suggestion. We have clarified the parent–child kernel counts and trainable parameter budgets for all benchmarks in Appendix F, particularly Tables F.2 and F.3. The forward PDE benchmarks typically use parents with children each ( physical RBFs), whereas the cavity-flow and inverse-hemodynamics benchmarks use parents with children each ( RBFs).
To assess sensitivity to these choices, we have expanded the structural ablation from Burgers to three PDE benchmarks: Burgers, diffusion--reaction, and Poisson. We consider five parent--child factorizations while keeping the total number of physical RBFs fixed at . The results reveal a problem-dependent accuracy--parameter trade-off: Burgers benefits progressively from additional parents, while diffusion--reaction exhibits relatively modest, non-monotonic variations and Poisson largely saturates around parents.
We have added a quantitative summary to the main text (Section 3.1, paragraph Kernel factorization and parameter budget). The complete numerical results and accuracy--parameter-budget curves are provided in Appendix H, Table H.1 and Fig. H.1. These experiments are intended to characterize the trade-off between geometric flexibility and parameter efficiency, rather than identify an operating point optimized for the lowest test error.
Response to Q2 of Rev BQrk
We thank the reviewer for this important question. We have quantified GSFAE reconstruction accuracy across the benchmark input distributions. The selected reconstruction-pretrained representations achieve mean held-out relative errors of percent for parametric Burgers, percent for GRF Burgers, percent for diffusion--reaction, and percent and percent for localized and sinusoidal Poisson, respectively. The capacity studies and reconstruction results are provided in Appendix E, with architecture details in Appendix F.
To assess the effect of jointly learning the input representation, we compare reconstruction-pretrained, frozen GSFAE with joint physics-only GSFAE--KAPI-ONet training across four PDE benchmarks. Appendix G now includes both a quantitative comparison (Table G.1) and four new qualitative figures showing identical input functions, reference solutions, predictions from both models, and their absolute-error fields.
The quantitative results demonstrate substantial improvements under challenging distribution shifts. For combined OOD shifts, mean relative error decreases from percent to percent for periodic Burgers, from percent to percent for diffusion--reaction, and from percent to percent for Poisson. The new paired figures visualize these improvements in the predicted solution structures and error distributions. They also illustrate the problem-dependent behavior observed for parametric Burgers, where joint training improves some individual extrapolation cases but yields similar aggregate errors.
Importantly, the joint experiments optimize GSFAE and KAPI-ONet together from scratch using only the physics-informed objective, rather than fine-tuning a reconstruction-pretrained encoder. The results indicate that physics-guided input representations can improve downstream operator accuracy and OOD generalization, even when accurate reconstruction of the original input function is not their optimization objective. Broader comparisons, including fine-tuning pretrained encoders, remain a promising direction for future work.
Summary of first response to Rev BQrk
We sincerely thank the reviewer for the constructive assessment. We have substantially strengthened the manuscript through additional experiments, theoretical analysis, and methodological clarifications. We expanded the parent--child factorization study across three PDEs (Appendix H), quantified GSFAE reconstruction accuracy, and compared frozen and jointly physics-trained representations, including their OOD performance (Appendices E and G). We also clarified hierarchical decoding, boundary and initial-condition enforcement, and physics-informed training protocols (Appendix C), and added hemodynamic sensitivity studies involving measurement noise and sensor placement (Appendix E). New theoretical results address approximation and stability (Appendix I), while Appendix J expands the methodological comparisons and investigates adaptive basis and collocation refinement. To ensure metric-consistent benchmarking, we use published baseline results to preserve their optimized configurations and avoid under-tuned reproductions. We re-evaluated KAPI-ONet using the corresponding published error metrics and clearly distinguish measured from projected computational costs. MAIN CHANGES IN MANUSCRIPT: BLUE COLOR.