- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes the Separable Modulation Neural Operator (SMNO), a neural operator architecture for learning Green's functions of linear elliptic PDEs. Unlike existing neural Green's operators that represent Green's functions using finite basis expansions, SMNO parameterizes the Green's function as a sum of learned offset kernels, each modulated by separate spatial weights at the source and evaluation points. The offset kernels are shared across PDE instances, while the spatial weights are predicted from the domain geometry and coefficient field. This representation preserves linearity with respect to the source term and enables efficient operator learning using FFT-based convolutions on regular grids.
The authors evaluate SMNO on Poisson equations with unseen 2D and 3D geometries, screened Poisson problems, and variable-coefficient Darcy flow. The experiments emphasize generalization to unseen source distributions, including localized and higher-frequency sources, where SMNO generally outperforms the evaluated basis-expansion Green's operators and several conventional neural operators. The paper also introduces a separate boundary-map extension that combines a known particular solution with a learned boundary correction for problems with nonzero boundary conditions, demonstrating improvements over existing methods on the Mechanical Components Benchmark.
Critical strengths
- The proposed method introduces a structured parameterization of Green's functions that explicitly accounts for the relative positions of source and evaluation points.
- On benchmark problems, such as Poisson equation over 2D channels and Darcy, the proposed method demonstrates substantial improvements over several existing neural operators, particularly on higher-frequency and localized source distributions that differ from those emphasized during training.
Critical weaknesses
- While the main contribution of the paper is a new parameterization for learning Green's functions, the experiments on the Mechanical Components Benchmark (MCB), which involves complex 3D CAD geometries and nonzero boundary conditions, use a separate boundary-map extension rather than the proposed separable modulated kernel representation. Specifically, it seems a particular solution obtained using a numerical Poisson solver is used in the setting and a network is only trained to predict the remaining boundary correction. Although this approach achieves favorable results compared with NGF [1], the comparison does not directly demonstrate the effectiveness of the proposed SMNO parameterization on this benchmark.
- Several important methodological and experimental details are not clearly explained in the main text. For instance, the paper provides limited explanation of how quadrature weights are obtained, the computational requirements of the boundary-map extension, and the assumptions underlying the symbol-based approximation in Section 3.2. Although some details are provided in the appendix, clearer explanations would help readers better understand the proposed method and assess its contributions. For example:
- L50: The introduction contrasts performance on "training-like sources" and "higher-frequency" sources without immediately clarifying how these source distributions are constructed. Although the distinction is explained later in the experimental section and appendix, a brief clarification in the introduction would help readers understand the motivation for evaluating generalization across source distributions.
- L70–L80: The proposed parameterization is introduced relatively early, but the key advantage of explicitly incorporating the relative offset between source and evaluation points could be emphasized more clearly. In particular, a more direct comparison with the fixed-basis representation used by existing neural Green's operators would help explain why offset kernels are better suited to representing source-dependent local features.
- Section 3.2: The discussion transitions from the fundamental solution and its correction terms to a symbol-based representation of Green's operators. However, the motivation behind introducing the separable approximation assumed in Eq. (6) could be explained more explicitly. In particular, it would be helpful to clarify under what conditions such a separable representation is expected to approximate the Green's operator effectively, and how this motivates the proposed formulation that jointly predicts and .
Additionally, presentation inconsistencies and incorrect publication information for relevant prior works, such as NGF and Transolver, should be corrected. Please refer to the questions for authors section for details.
Reference
- Neural Green’s Functions, Yoo et al., NeurIPS 2025
Questions for authors
- Could the authors clarify how the quadrature weights are obtained, particularly for irregular meshes? My understanding is that SMNO uses prescribed quadrature weights rather than predicting per-point mass values as in NGF. Does obtaining these weights require mesh information or additional preprocessing at inference time? If so, how does this affect the comparison with mesh-independent approaches?
- In L238–L249, the authors describe learning the boundary operator while using a box Poisson solver to obtain a particular solution . Could the authors elaborate on the computational procedure used to obtain , particularly whether it requires discretizing or meshing the interior of the original domain? Furthermore, could the authors report the prediction error obtained from the particular solution alone, without the learned boundary correction, as an additional diagnostic? This would help clarify how much of the reported improvement comes from the learned correction.
- Could the authors explain whether the proposed separable modulated kernel representation in Eq. (7) can be directly applied to the MCB benchmark? Since the reported MCB results use a separate boundary-map architecture, it remains unclear whether the main proposed parameterization offers similar advantages on complex geometries with nonzero boundary conditions. An evaluation that isolates the effectiveness of SMNO itself on this benchmark would strengthen the paper's central claim.
- Could the authors clarify the assumptions underlying the separable approximation of the Green's operator symbol in Section 3.2? In particular, is this intended purely as a motivation for the proposed architecture, or is there a broader class of elliptic operators for which the assumed decomposition is expected to provide an accurate approximation?
- Minor presentation and reference issues. I also noticed a few minor issues that could be corrected:
- The formatting of equation references is inconsistent (e.g., "Equation (6)" in L188 versus "Eq. (6)" in L199).
- The roles of and in Eq. (5) could be explained more explicitly.
- In L261, "Appendices B, A.1, C, and D" could be reordered as "Appendices A.1, B, C, and D."
- The bibliography should cite Neural Green's Functions as a NeurIPS 2025 paper rather than 2026, and Transolver as an ICML 2024 paper rather than an arXiv preprint. The corresponding citations in tables should also be updated.
3 comments
Dear authors,
Thank you for your thorough response.
My primary concern in the initial review was the lack of clarity regarding the evaluation setting on the MCB-B benchmark. I appreciate the additional evaluation results using SMNO directly, which I believe demonstrate notable improvements over NGF. I also appreciate the further discussion of the separable symbol, as well as the revisions to the manuscript and references.
As my concerns have been adequately addressed, I have decided to increase my rating.
Thank you for taking the time to read our response and revised manuscript. We're glad that your concerns have been addressed, and we appreciate your decision to raise the score!
We thank the reviewer for the detailed comments on the method and the presentation. W1 to W3 follow the weakness paragraphs and Q1 to Q5 the questions.
W1 / Q3 (Direct SMNO on MCB). Yes. We trained SMNO with the kernel of Eq. (7) directly on the MCB data, with no particular solution. It is ahead of NGF and Transolver in all five categories (also General Response, item 1):
The interior block applies the separable kernel over all mesh vertices with the benchmark's lumped masses, and a second separable block integrates the nonzero boundary data over the boundary nodes.
Q1 (Quadrature weights). The weights mj are the quadrature weights of the discretization: 1/N on uniform grids, lumped P1 masses on our generated meshes, and the benchmark's mass matrices on MCB. They are computed from the mesh, or from volume estimates on a point cloud. On MCB they are the benchmark's own mass matrices, which NGF's evaluation also uses, and on our meshes every baseline receives the same weights. Section 3.4 now says this.
Q2 (Particular solution). The direct SMNO of W1/Q3 is trained without any particular solution; up is used only by the boundary-map extension. There, the box solver embeds the vertex cloud into a 1293 Cartesian grid, extends f via nearest-neighbour lookup, applies a single discrete sine transform, and trilinearly interpolates up back to the mesh vertices. It requires no volume mesh and takes a few milliseconds. On MCB, up alone (with the prescribed boundary values pasted) has a mean error of 7.7, whereas pairing it with an exact harmonic extension yields 0.0086; the revision reports both numbers alongside the 0.141 achieved by the boundary-map extension.
Q4 / W2, Section 3.2 (Assumptions behind the separable symbol). The separable symbol is a classical property that motivates our architecture rather than a formal theorem. Separated representations of this kind are accurate, with S growing logarithmically in the precision, when the symbol is smooth in x and belongs to a classical symbol class (Bao and Symes; Demanet and Ying). For the solution operator this holds for second-order elliptic operators with smooth, strictly positive coefficients on smooth domains, whose Green's functions are positive and non-oscillatory. For piecewise-constant Darcy coefficients, the property holds away from interfaces while the learned weights absorb interface jumps; oscillatory kernels like high-wavenumber Helmholtz lie outside this regime. We added this discussion to Section 3.2.
W2, L50 and L70 to L80. The introduction now defines the source families where the distributions are first contrasted, and explains how offset kernels resolve localized, source-dependent features that require many terms in a fixed global basis.
W3 / Q5 (Presentation and references). We added the definitions of μc and ϱc immediately following Eq. (5), standardized equation references, reordered the appendix list, and updated the citations for NGF (NeurIPS 2025) and Transolver (ICML 2024).
We hope the direct SMNO result and these clarifications resolve your concerns, and we are glad to discuss any further questions. Thank you again for the careful review.