- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
The submission presents a PINN approach for solving elliptic PDEs on manifold surfaces. The key idea is to approximate a smooth normal field on a given geometry and use it to construct projection-based differential operators for PINN computation. The approach is clear and simple, avoids the need for the surface parameterization used by [Williamson & Mitra 2025], and achieves improved solution accuracy. The paper also investigates network convergence with respect to the number of trainable parameters.
Critical strengths
The main strength, in my view, is the use of a learned normal field to formulate surface-based PINNs. While the underlying differential formulation is classical, this integration provides a simple and parameterization-free formulation for constructing surface differential operators within the PINN framework.
The second strength is its applicability to a broader range of surface topologies compared with [Williamson & Mitra 2025].
Critical weaknesses
-
The current method is somewhat limited in its applicability. When the boundary conditions are changed, the solution network needs to be retrained, taking considerable time and limiting its practical use. Taking as network inputs would significantly strengthen the proposed method. Furthermore, the normal network could potentially be extended to handle varying geometry as input. In this way, the coupled networks could support a much broader range of problem instances without per-instance retraining.
-
The paper uses the cotangent Laplacian implementation to criticize the sensitivity of linear FEM to mesh quality. However, this issue has been extensively studied, with techniques such as intrinsic Delaunay triangulation being well established in geometry processing. Furthermore, mesh refinement and mesh-quality improvement are relatively inexpensive operations compared with network training. Therefore, I do not see a clear practical benefit of the proposed PINN approach over mesh-based FEM in the current setting. In addition, traditional meshless approaches can operate directly on point clouds. Overall, I find the argument for the benefits over traditional numerical approaches relatively weak. Addressing Point 1, particularly by avoiding per-instance retraining for different PDE inputs, would make the motivation substantially stronger.
-
Two closely related spectral-based works are worth citing and discussing: (1) Δ-PINNs: Physics-Informed Neural Networks on Complex Geometries (https://doi.org/10.1016/j.engappai.2023.107324); and (2) Numerical Methods for PDEs over Manifolds Using Spectral Physics-Informed Neural Networks (https://arxiv.org/abs/2302.05322).
-
The Degrees of Freedom experiment (Fig. 9) provides an asymmetric comparison with FEM. The FEM baseline uses linear elements and increases its degrees of freedom only through mesh refinement, whereas increasing the number of PINN parameters also increases the representation capacity of the neural approximation. A more meaningful comparison should also consider higher-order FEM or p/hp-refinement, which can achieve substantially faster convergence.
-
Boundary conditions are treated as soft constraints, and the errors near the boundary appear significantly larger than those in the interior in Fig. 9. Furthermore, in many examples, the largest errors remain relatively high, making the results less competitive from a scientific-computing perspective. Although the paper attempts to establish convergence with respect to the network capacity, it remains unclear how large the network needs to be to achieve a desired accuracy in practice, for example, an average error of .
-
Normal network usage. (Eq. 6) depends on . Therefore, when autodifferentiating the surface gradient, derivatives of with respect to the spatial coordinates are involved as well. The supplementary code also does not stop the gradient through (I checked test_convergence.py and python files under /src, didn't find stop-gradient). However, line 194 states that the normals can be “used without any autodifferentiation,” which seems inconsistent with both the formulation and the implementation. I would expect auto differentiation to be necessary for providing the differential of ; otherwise, the normal network seems unnecessary in most examples where the normals can be retrieved from the mesh faces.
Questions for authors
Given the limited time available for the rebuttal, I would particularly welcome a response to Points 1, 2, and 6, even if only partially.
One suggestion: as the paper only considers two elliptic PDEs, the title could be made more precise rather than suggesting a broader scope of general PDEs.
4 comments
Response (2/2)
Two closely related spectral-based works ….
We will add the citations and discuss them in the related work section upon revision.
The Degrees of Freedom … faster convergence.
As suggested, we report the errors comparing with quadratic elements (higher-order FEM) for the example shown in Figure 9 below:
| Degrees of Freedom | Relative L2 Error (ours) | Relative L2 Error (linear FEM) | Relative L2 Error (quadratic FEM) |
| 2911 | 0.0397 | 0.1112 | 0.1566 |
| 7851 | 0.0195 | 0.0381 | 0.0325 |
| 15191 | 0.0151 | 0.0192 | 0.0121 |
| 24931 | 0.0113 | 0.0116 | 0.0058 |
| 37071 | 0.0070 | 0.0077 | 0.0031 |
| 51611 | 0.0060 | 0.0055 | 0.0019 |
| 68551 | 0.0073 | 0.0041 | 0.0012 |
This experiment verifies that quadratic FEM achieves faster convergence compared to linear FEM and our method. We will add this experiment upon revision.
Also, we would like to clarify that Fig. 9 is not intended to show that PINNsur outperforms FEM and our Limitations section explicitly notes that our method does not always beat FEM in absolute error or runtime. Its purpose is to show that PINNsur exhibits convergent behavior, i.e., the error decreases systematically as the degrees of freedom grow, which not all prior PINN baselines do (Fig. 9). We use linear FEM as the reference because it is the standard discretization in geometry processing and its convergence on surfaces is well established (Dziuk, 1988). We will clarify this in the revision.
Boundary conditions … error of 1e-5.
Boundary errors. We agree that soft boundary constraints lead to larger errors near the boundary, a known limitation of PINNs. Hard constraints, which impose Dirichlet conditions exactly via a distance-function ansatz (Lagaris et al., 1998; Sukumar & Srivastava, 2022), would remove this error, but they are considerably harder in our setting. On curved surfaces, one requires distance to the boundary curve that must itself be computed (e.g., via the heat method, Fig. 1b), and Neumann conditions require more complex constructions. We therefore use soft constraints, which apply uniformly to both boundary condition types on arbitrary surfaces. Incorporating hard constraints to reduce boundary error is a promising direction that we will discuss as future work.
Accuracy. We agree that our errors on some surfaces are not competitive with FEM on meshes, and we do not claim otherwise (addressed in the limitation section). Our goal is to establish convergent behavior with respect to network capacity, which prior PINNs lack.
Required network size. We observe that the network size needed for a given accuracy depends on the problem and is different across surfaces, source terms, and boundary conditions (slopes between [−0.3 and −1.5] in Fig. 4). This is analogous to FEM, where the convergence rate is known a priori but the constant depends on the unknown solution and the geometry, so the number of nodes required for a target accuracy is likewise not known beforehand. Our convergence study enables the same procedure by fitting on a few network sizes gives the number of weights needed for a target error, .
Normal network usage … from the mesh faces.
We thank the reviewer for finding this mistake. The statement on line 194 that the normal network is “used without any autodifferentiation” is an error in the writing but our formulation and implementation is correct because without the derivatives of , the curvature term of the Laplace–Beltrami operator would be missing and the solver would converge to an incorrect solution. We will remove this statement during revision.
Thank you for the detailed rebuttal
Thank you for the detailed rebuttal in both threads. I appreciate your honest responses to my questions and the additional experiments, even when the results (e.g., comparisons with FEM) do not favor your method. I particularly appreciate that you treat the rebuttal as genuine scientific communication.
Regarding the experiment addressing per-instance retraining, the unseen source terms are not very different from the training ones, yet the accuracy drops by approximately one order of magnitude. Therefore, although the experiment demonstrates some generalization capability, its practical usefulness remains questionable. However, I understand that you do not aim to address this issue in this work.
I understand your position that the goal is not to compete with FEM (and that you will revise the FEM comparison and related text), but rather to contribute to the convergence behavior of surface PINN. Some comparisons do show that other methods have difficulty converging. However, I still have concerns about whether the convergence study represents a sufficiently strong scientific contribution, especially given that the achieved accuracy remains limited for practical use, the convergence rate barely matches that of linear FEM, and there is no guarantee that increasing network capacity will lead to lower errors in practice (as many convergence plots are not monotonically decreasing).
I will discuss these concerns with the other reviewers during the discussion phase.
We thank the reviewer for their comment. We would like to note that the primary contribution of this work is the formulation of the surface operator by learning the normal field directly. Unlike prior surface PINNs, which require a spherical parametrization (restricting them to genus-zero surfaces) or an explicit level-set function (restricting them to closed surfaces with a known level set), our formulation needs only point samples and normals. Our formulation therefore handles surfaces of arbitrary topology, open or closed, with Dirichlet and Neumann boundary conditions, and operates directly on meshes and point clouds. This makes it directly applicable to many geometry processing tasks traditionally solved with FEM (details in Sec. 4.3) like minimal surface computation (Fig. 8a), harmonic interpolation (Fig. 8b), heat diffusion and heat-based geodesic distances (Fig. 1b), and mean curvature flow (Fig. 1a). The convergence study complements this formulation by showing that its accuracy improves systematically with network capacity.
Response (1/2)
We would like to thank the reviewer for their thoughtful comments and feedback. Below, we try to respond to each question in order (questions are written in bold)
The current method … per-instance retraining.
Trained PINNsur models can be reused for new source terms using reduced-basis PINNs (GPT-PINN; Chen & Koohy, 2023). Since the Laplace–Beltrami operator is linear, we use the last-hidden-layer features of several trained models as a basis and solve for their coefficients with a single linear least-squares fit, without training. Using two models (150×3) trained for the Poisson equation on spot (Fig. 3f) with sources sin(πx) and sin(4πx), we solve for the unseen sources sin(2πx) and sin(3πx):
The least-squares fit obtains solutions for new source terms in a few seconds instead of minutes of training, at the cost of roughly an order of magnitude in accuracy.
In general, we agree that per-instance retraining is a limitation of our method. But, it is shared by many PINNs like standard PINNs (Raissi et al., 2019), variational formulations such as Deep Ritz (Yu et al., 2018) and hp-VPINNs (Kharazmi et al., 2021), and recent surface PDE methods (Hu et al., 2024; Williamson & Mitra, 2025). In our case, the normal network depends only on the geometry and can be reused across all source terms and boundary conditions on a surface.
Removing per-instance retraining is precisely the goal of neural operators like DeepONet (Lu et al., 2021), Fourier Neural Operator (Li et al., 2021), and physics-informed variants (Wang et al., 2021; Li et al., 2024). Extending PINNsur in this direction is a promising direction for future work. We will state this limitation explicitly and discuss neural operators as future work in the revision.
The paper uses the cotangent Laplacian … substantially stronger.
We agree that, given a valid manifold mesh, element quality can be improved cheaply (e.g., with intrinsic Delaunay triangulations), and that FEM is then faster and typically more accurate than our method, as stated in our Limitations. We will revise the paper to avoid overstating mesh-quality sensitivity.
Our setting is one where such a mesh is not readily available. PINNsur only requires point samples and normals, so it applies to any explicit representation that supports sampling, such as triangle meshes (including non-manifold, self-intersecting, or multi-component ones) and point clouds (Fig. 5), with no need for connectivity, manifoldness, or watertightness. Converting raw scans into analysis-ready meshes remains hard (Berger et al., 2017; Huang et al., 2024; Sulzer et al., 2024), and even curated collections are often unsuitable. For example, in Thingi10K, about 45% of models self-intersect and 29% have multiple components (Zhou & Jacobson, 2016).
We agree that classical meshless methods also operate on point clouds, and we do not claim to outperform them. Our work instead contributes to PINNs, an active area of scientific machine learning (Raissi et al., 2019; Karniadakis et al., 2021), where a central open problem is the lack of reliable convergence. By showing convergent behavior for surface PDEs as network capacity increases, our work advances the state of the art on this problem, a contribution in its own right.