- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
The paper studies a minimal architectural modification to standard fully-connected PINNs: multiply the first hidden activation by input-dependent localization functions as described in Equation (3). The method is called LPINN. The paper focuses purely on empirical comparison and no theoretical analysis is conducted. LPINN is evaluated on 3 model problems: harmonic oscillator, 1D heat equation, and a manufactured 4th order problem; with 13 families of localization function; against vanilla PINN as the only single baseline. The experiment is conducted across different sizes of domain, epoch budgets, and 10 seeds. The numerical evidence shows that LPINN can improves 1-2 order of magnitude in solution RMSE over standard PINN if the family of localization-functions is chosen properly.
Critical strengths
-
Clear presentation of the proposed method and experiment settings. Equations (1)-(3) clearly define the implemented methods. The set up of the numerical experiments is documented completely in Section 4.
-
Extensive list of families of localization functions. The list of total 13 families of localization functions is exhaustive.
Critical weaknesses
-
Lack of motivation/controbution for the proposed specific localization approach. The authors clearly state that they choose not to compare against other localization methods in the paper. However, they do not provide a clear motivation about why to consider the specific approach in LPINN, rather than other localization methods. Given no motivation and no benchmark against other similar methods, it's not clear about the main advantage of this method. The paper only shows the validity of LPINN but does not explain why it's a method worth being used. Lack of clear contribution is the major reason for me to reject the paper.
-
Unclear whether experimental comparison is fair. The authors emphasize that every localized model is compared against a PINN with exactly the same set-up such as network size, residual, and optimizer etc. in order to identify the clear improvement read regarding the effect of introducing the localization functions. However, I'm not sure whether it's fair that PINN and LPINN should use the same hyperparameter settings for optimizer. The introduction of localization functions may favor different set of hyperparameters such as stepsize etc.
-
Randomness of the results is not properly reported. Even though each localized model and baseline model is run for 10 seeds and Figure 1-3 provide the trajectories across all 10 runs, the table does not include the standard deviation of Loss/RMSE/MAE across 10 runs. In terms of aggregation method, since different PINN runs have different order (from Figure 1-3), arithmetic mean is not an appropriate measure since average of and will stay around , while the run of should be declared as non-converged. Please either report geometric mean across 10 runs or exclude the non-converged runs.
-
The benchmarked equations are relatively simple ones. As far as I know, 1D heat equations and harmonic oscillator are simple test instances. I would like to see the authors justify LPINN on more challenging test equations.
Questions for authors
-
Can you aggregated the numbers across seeds by geometric mean rather than arithmetic mean? Also, please provide also the standard deviation for all tables.
-
Can you clarify the motivation of the proposed localization method? Why not the other localization methods? This can be justified by either providing numerical results to showcase the performance of LPINN over other methods or clarifying what imitations of previous methods are resolved by LPINN.
-
Could you please address my concern regarding fairness in Weakeness #2?
2 comments
The reviewer thanks the authors' response. I keep my original assessment.
Response to reviewer jVT8
We thank the reviewer for the thoughtful critique and for recognizing the method definition and breadth of the family screen. Our motivation is a minimal structural intervention: input-dependent gates localize first-layer activations while retaining one global dense PINN and avoiding domain partitions or interface losses. The paper tests whether that change helps on selected long-domain and higher-order problems; it does not claim a universal localization method or superiority to Fourier/RBF embeddings or domain-decomposition methods, which address related but different design choices.
We agree that we do not yet have a principled explanation for all family-by-equation differences or an oracle-free selector. We treat gradient locality as a hypothesis and report the unsuccessful families and the 1k-epoch reversal as part of the evidence. The comparison is designed to isolate the gate: the network size and training setup were selected for the vanilla PINN, and localization was added afterward while keeping the baseline settings, collocation scheme, and paired seeds fixed. We agree that additional optimizer tuning could change either model’s performance; we do not present this as an exhaustive hyperparameter study. The harmonic-oscillator experiment uses a 2\pi horizon, rather than the short-horizon case where PINNs can be easy.
The revised appendix now includes the requested distribution details: Table S2 gives arithmetic means, medians, population standard deviations, and geometric means for all four metrics in the three primary comparisons, and Table S3 gives the paired per-seed solution RMSEs. Table S4 adds a compute-context comparison: on the oscillator, 3k-epoch LPINN has mean RMSE 0.00883 versus 0.01485 for 10k-epoch vanilla PINN, with lower error in all 10 paired seeds; the observed times are 6.87 s and 12.52 s. These timings are descriptive because the CPU runs overlapped. The 4D fourth-order manufactured problem also extends the evaluation beyond the one-dimensional examples. We have kept the conclusions bounded to these controlled experiments; comparisons with the related feature and domain-decomposition approaches and an oracle-free family selector remain open questions.