- Rating
- 4(+1)
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper considers the operator learning task (Dirichlet-to-Neumann (DtN) map) from a geometry and boundary data to the corresponding boundary response, i.e., boundary gradient along the normal direction, provided that the interior Laplacian problem is known. This problem is a particularly specific operator learning setting (while I have not learned much DtN literature before, I believe that this problem is important). The DtN map can be decomposed into a universal singular part and a smoother geometry-dependent remainder. The singular part could be geometry-independent and thus is handled through explicit calculation. The reminder integral operator is parameterized in a separable form similar to DeepONet, i.e., an MLP processes coordinates and the other encodes geometry to mimic the smooth operator. The overall architecture is physically interpretable and can be applied to other PDEs whose Green's functions-induced BIE hold similar decomposition.
Critical strengths
- Propose a physically interpretable operator learning framework for a type of boundary estimation problems.
- The presentation is clear and easy to follow.
- Experiments show good performances, especially on boundary data and geometry generalization.
Critical weaknesses
The theoretical parts are information-dense and could be better positioned. I was not sure if Theorems 5.1-5.3 provide essentially new theoretical results for the DtN operator and the associated low-rank kernel approximation. Theorems 5.1 is valid under the boundary problem setting, independent of the proposed structure. Proper citations on previous literatures could be appreciated. Theorem 5.2 gives a rank-dependent error estimate for the low-rank kernel operator approximation. However, it is not clear whether this estimate is new or is adopted from existing literature on kernel approximation (e.g., from Mercer's theorem or something like that). Theorem 5.3 gives a generalization error bound. I think it could be a direct combination of the rank-dependent error and standard generalization estimate (e.g., Rademacher or VC dimension), and hence could be shortened.
Questions for authors
- Around Eq. (9), while was defined, I believe that should also be properly defined nearby.
- In Eq (1), the period should be replaced by a comma.
- A sensitivity analysis w.r.t. the rank parameter could be important to supply the rank error estimate.
- Theorem 5.3 could be simplified and made more rigorous. The parameter space of the DeepONet, Fourier truncation error, and the error terms could be stated explicitly. The theory is itself dense but is conceptually simple, hence could be moved to appendix.
2 comments
I am satisfied with the response and raised my score to 4. Good luck!
Response to Reviewer gDLD
We thank the reviewer for the careful reading of the theory. We revised Section 5 to separate what is classical from what is specific to our architecture, shortened Theorem 5.3 and stated its terms explicitly, and fixed the notation points.
W: Novelty and attribution of Theorems 5.1–5.3. The theorems justify the architecture rather than introduce new boundary-integral theory, and the revision now says so for each one.
Theorem 5.1 follows from classical mapping properties of boundary integral operators (Kress; McLean; Sauter & Schwab) in our parameterized convention, as now cited directly after Theorem 5.1. In two dimensions, log∣X(s)−X(t)∣ differs from log∣2sin2s−t∣ by a smooth function for any regular simple closed curve, so subtracting 2W0 leaves a smoothing operator. This is the fact the decomposition uses.
Theorem 5.2 is a degenerate-kernel approximation built from a piecewise Taylor expansion of the kernel in s; the rate r−m for kernels of class Cm in s follows from standard degenerate-kernel estimates (Kress, 1989, Ch. 11), which we now note after Theorem 5.2. We use this construction rather than a Mercer expansion because RX is symmetric but in general indefinite (already for ellipses it has eigenvalues of both signs), and its eigenfunctions in general change with the geometry. Theorem 5.2 is included because its form matches Eq. (17): the trunk functions depend only on the rank budget, the geometry enters only through the coefficients, and the constants are uniform over An.
Theorem 5.3 is, as the reviewer says, the approximation error combined with the standard uniform-deviation and optimization terms of empirical risk minimization. We shortened the main-text statement and made it explicit (Q4):
The full statements and proofs are in Appendix C (Theorem C.9 for Theorem 5.3). We keep the short version in the main text because it ties the rank r and the node count J to the error of the reconstructed DtN map.
Q1: Definition of W1. Eq. (9) now defines both parts of the splitting, with W1f(s)=2π1∂s∫Tlog2sin2s−tX(s)−X(t)∂tf(t)dt. Its kernel is smooth for smooth X (Lemma C.1).
Q2: Punctuation in Eq. (1). Eq. (1) now ends with a comma.
Q3: Rank sensitivity. Accuracy improves steadily with rank, in line with the role of r in Theorem 5.2. We added a rank study on ellipses (Section 6.6, Appendix J.2, Table 15) with ranks 4 to 10 at width 144, the same data, and a common 10,000-epoch schedule.