- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The manuscript proposes an extension of GPs for linear PDEs (without approximations via collocation points) to boundary conditions. Harkonen et al. proposed the original method (EPGPs) but did not extend it to boundary conditions. This paper closes this gap and is a useful follow-up.
Critical strengths
Scope: This paper is a useful extension in the field of GP-based PDE solvers. It fits right into the current scope for GPs. Physics-informed probabilistic ML is a hot topic, and boundary conditions are part of this movement.
Readability: The paper is clearly written and easy to follow. The contributions are easy to identify. I also enjoyed reading about previous work in the field. It's a nice overview.
Methodology: Most importantly, the methodology is a clever extension of Harkonen et al.'s work.
Critical weaknesses
Theorems and proofs: Theorem 1 makes several choices that are difficult to follow or verify. I don't understand why "we suppose" what we suppose there. How are the choices motivated? After Theorem 1, several assertions follow that need support. Why are approximations in the Fréchet topology strong? Why do we expect Theorem 1 to hold for any BVP?
Examples: I find it difficult to follow what I am supposed to learn from the examples; they don't seem to be on the same footing, which makes it hard to compare apples to apples. I would expect 3 or 4 well-defined examples, all applied to the proposed method and all competitors, and a table with results (L1, RMSE for deterministic methods, NLPD, PICP, CRPS for probabilistic methods) Some of this is present in the Appendix but should be moved to the main text.
Questions for authors
How are choices in Theorem 1 motivated?
Why are approximations in the Fréchet topology strong?
Why do we expect Theorem 1 to hold for any BVP?
How does the GP compare against other tools in RMSE, and against other probabilistic tools in CRPS, NLPD, and PICP?
How does the method behave when caustics occur in the wave equations? Given that sources can be diverse, caustics can easily happen.
2 comments
I thank the authors for their thorough reply and will consider adjusting my score accordingly.
The topology in Theorem 1 is that of C∞: the approximation and all its derivatives converge uniformly on compact sets. This is stronger than, and implies, L2 convergence on compact sets, a norm that controls only the function itself. For rough solutions, where the L2 setting is natural, Theorem 1 makes no claim. Theorem 1 is stated for smooth solutions on the half-space with Dirichlet/Neumann conditions. We expect the statement to hold in much greater generality, supported by Section 6 and Appendix A.3, but we have no proof and will state it as a conjecture.
We agree and will move a unified table for the Wave IBVP (relative L1 error/RMSE for all methods, NLPD, PICP and CRPS for the probabilistic ones) into the main text. We have two kinds of examples: (i) reconstruction from data, plentiful (Section 4) or sparse (Section 6); (ii) well-posed PDE problems (Section 5). We use (i) to demonstrate the generality of our method (see also Appendix A.3) and (ii) for comparison. In Section 5.1 the other methods are prohibitively expensive for the 4D problem, so the comparison with all six other methods is made on the 2D problem (Wave IBVP).
We have conducted experiments to evaluate the uncertainty performance. The table below will be added to the manuscript. Relative L1 errors for all methods are given in Table 2. The uncertainty metrics are:
In our example the ground truth is a focusing spherical pulse. It converges to the point (0,0,1.2) at t=1.2 and diverges afterwards, and it vanishes on the plane z=0 at all times (the second term is a mirror source). The solution is smooth and finite at the focus. This tests a focusing wave, not a singular caustic. With 4,800 basis elements and 50,000 data points B-EPGP reaches below 1% relative validation RMSE. We ran the B-EPGP algorithm with basis sin(z3z)cos(z0t+z1x+z2y),sin(z3z)sin(z0t+z1x+z2y) where z02=z12+z22+z32. This is similar to examples from the paper.
Here is the ground truth we used u(t,x,y,z)=r10.1[g(τ+r1)−g(τ−r1)]−r20.1[g(τ+r2)−g(τ−r2)], where τ=t−1.2,r1=x2+y2+(z−1.2)2,r2=x2+y2+(z+1.2)2, g(s)=e−1.778s2sin(5s).