- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper aims to identify which regions of the domain are already well trained during PINN training, since a small PDE residual does not guarantee that the prediction is close to the true solution. The authors propose a "detective" that starts from the boundary and initial points and expands a trusted set to neighboring points, admitting a point only when both its residual and its parent's residual are small and the parent's prediction has stayed stable. The residual threshold is predicted from PDE features by a small meta-model. The trusted set is used either as a stopping criterion or as a guide for training, and experiments show fewer false stops than loss-based criteria and improved accuracy on convection and Helmholtz.
Critical strengths
The paper tackles a well-known but often overlooked issue in PINNs: a small residual alone does not mean the solution is correct. Instead of relying only on the residual, the proposed method connects each interior point back to the boundary and initial conditions, where the true values are known. This idea of checking whether local residual satisfaction is actually anchored to reliable information is simple, intuitive, and well motivated.
Critical weaknesses
-
The method uses boundary and initial points with known true values as the starting anchors, which effectively limits it to problems with Dirichlet conditions. For Neumann or Robin boundary conditions, the true values on the boundary are not available, so it is unclear how the trusted set would be initialized. A discussion of this limitation would be helpful.
-
Since the main contribution of the paper is the empirical performance of the proposed method, a more comprehensive evaluation is needed. The training application is evaluated only on a single convection setting and on Helmholtz, where the improvement becomes marginal at the higher wavenumber.
-
Compared to a vanilla PINN, the proposed method requires additional memory and computation. A fair comparison under matched computational budgets is needed.
-
The manuscript does not yet seem ready for publication. For example, Dirichlet conditions are referred to as "value-type supervised conditions" (line 125).
Questions for authors
- What exactly counts as a "false stop"? Could the authors provide a formal definition?
- Could the authors provide a computational cost analysis? Specifically, how much additional wall clock time and memory require compared to a vanilla PINN?
2 comments
Thank you for your careful response. However, the proposed method cannot be applied to Neumann and Robin boundary conditions without true data points, so its scope of applicability remains limited. In addition, false stops serve as a key metric in this paper, but they have still not been incorporated into the revised manuscript. Overall, I believe the paper is not yet ready for publication, and I will maintain my score.
Thank you for your comments.
W1. Boundary-condition scope
The detector needs trusted point-value anchors; it does not require every boundary face to be Dirichlet. A nonempty Dirichlet or initial-value subset can initialize the same admission logic, while Neumann/Robin conditions on the other faces remain in the ordinary PINN loss.
As a minimal mixed-boundary sanity check, we tested a manufactured two-dimensional Poisson problem with u∗(x,y)=x2 and −Δu=−2: u(0,y)=0 supplies anchors, ∂nu(1,y)=2, and ∂nu(x,0)=∂nu(x,1)=0. Pointwise error is normalized by the exact-solution grid RMS.
Thus a trusted-value subset can initialize the current logic in this mixed problem. Pure Neumann/Robin-only data are outside the current method unless an external trusted point value is supplied; that case remains untested. An integral gauge or derivative/Robin functional would require a new functional-anchor analysis. We will replace “value-type supervised conditions” with “Dirichlet boundary and/or initial-value data supplying trusted point values.”
W2. Scope of active-training evidence
The active-training experiments were designed to cover two complementary propagation modes. Convection tests a time-dependent problem in which the trusted frontier advances along the temporal direction. Helmholtz tests a static problem with no temporal ordering, where the same detector must instead grow spatially from the supervised boundary. We will make this experimental-design rationale explicit and, in future work, extend the evaluation to higher-dimensional PDEs and other more challenging equations.
W3. Measured passive overhead and near-equal-wall active control
We isolate passive-detector overhead and report active Detective-only cost separately. On Poisson-2D, Vanilla and passive detection use identical networks, seeds, batches, optimizer, and 25k updates; JIT is warmed before timing, and the passive observer cannot write to training. The recorded final loss and parameter checksums/norms agree exactly in every pair, consistent with an unchanged trajectory. This paired loop microbenchmark uses one RTX 4090, a 5-by-192 network, 2048/768 interior/boundary batches, 25k steps.
For active use, we ran a fresh three-seed near-equal-wall β=30 control. Detective uses 272k/282k/280k updates versus Vanilla's 300k. Both methods share the base PINN loss, architecture, initialization, optimizer, and sample pool, differing only in active-region selection. With AdamW only, Detective obtains 0.01808±0.00174 versus Vanilla 0.02402±0.00078, wins 3/3 pairs; their reductions average to 24.5%.
W4. Presentation readiness
The revision will use direct scope and guarantee language. We will (i) use “Dirichlet boundary and/or initial-value anchors,” (ii) define all four stopping outcomes, (iii) distinguish the conditional stored-value chain bound from empirical current-set validation, (iv) add the chain corollary and complete first-fire pointwise audit, and (v) add limitations covering derivative-only anchors, dense-grid scaling, and active-training breadth.
Q1. Formal definition of False Stop
Let T be the first checkpoint at which a criterion fires, with T=∞ if it does not fire within the shared budget, and let ε=0.005 be the target relative-L2 error. A Successful Stop has T<∞ and relL2(T)≤ε. If the criterion does not fire within the shared budget, it is a Missed Detection when the endpoint error is at most ε, and Correct Non-convergence otherwise. Under these definitions, the submitted full-detector outcomes are 17/3/8/16 for Successful Stop, False Stop, Missed Detection, and Correct Non-convergence, respectively. We will add these definitions explicitly to the revision.
Q2. Computational cost
See W3. In the paired Poisson-2D measurement, passive detection adds a median 7.14% wall-clock overhead, 100.1 MiB of peak host memory, and only 0.0027 MiB of additional JAX peak bytes in use because the detector state is host-resident. One detection cycle scales linearly with the candidates visited over at most S shell rounds. Passive use otherwise leaves the PINN loss, parameters, and optimizer unchanged.