- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper introduces Neural Operator Processes (NOPs) for predicting full PDE solution fields using complete input fields and sparse output observations. It combines Neural Processes with Neural Operators, using SetConv and attention to handle sparse observations. It also adds latent variables to estimate uncertainty. The results show that this approach works reasonably well on several PDE benchmarks, but the improvements over simpler methods are not always clear. Also, the sparse observations are sampled from simulation data, not real sensors. So it is still unclear how well the method would work with noisy measurements or more complex PDE problems. The experiments also do not clearly show the benefits of probabilistic modeling.
Critical strengths
The experiments provide some useful insights into how different PDE problems respond to sparse observation conditioning. In particular, they show that the choice between SetConv and attention matters depending on the PDE. The paper also explores how these methods interact with probabilistic latent variables. These findings help better understanding the role of different model components and their trade-offs.
Critical weaknesses
I'm not sure this really counts as sparse-to-dense operator learning. The model still sees the full input field, and training uses full-field supervision. Only the output observations given at test time are sparse. These observations are also sampled directly from simulation results, rather than collected from real sensors. So the experiments are mostly about using sparse observations under ideal conditions. It's still unclear how the method would handle noisy measurements, sensor errors, or differences between simulations and real-world data.
Some NOP variants perform better than standard FNO, but the comparison is not entirely fair since NOP also gets to see part of the true output. The paper includes some baselines with the same observations, but the gains are not always clear.
The probabilistic models can estimate uncertainty, but they seem to lose quite a bit of accuracy. On Darcy, for example, the error goes from 0.0226 for the best deterministic model to 0.0657 for the best probabilistic one. Cross-resolution generalization is another concern. Burgers works reasonably well, but the results on Darcy and Navier–Stokes are much worse. On Darcy, DNOP's error jumps from 0.0250 to 0.3316. Most experiments are also done on regular grids, so we don't know how well the method would work on complex geometries, unstructured meshes, or more challenging turbulent flows.
Questions for authors
I'm wondering how much NOP actually improves over a standard FNO that has access to the same sparse observations. Is the proposed architecture really making a difference, or is most of the gain simply coming from the extra information?
I'm also not sure how much the probabilistic part really helps. The prediction accuracy gets noticeably worse, especially on Darcy. Are the uncertainty estimates useful enough to justify this trade-off, particularly when the observations are noisy or the PDE problems become more challenging?
2 comments
Thanks for the response. Overall, the authors have clarified several points, but my two main concerns remain.
First, I am still not convinced of the benefits of probabilistic modeling for PDE problems. Comparing Tables 2 and 3, the best probabilistic models have roughly 89%, 191%, and 69% higher prediction errors than the best deterministic models on the three PDE benchmarks, respectively. I would be fine with this trade-off if the probabilistic models provided better uncertainty estimates than alternative methods, or showed better robustness to noisy observations. However, the authors do not provide such evidence. As they acknowledge in their response:
The results do not establish superiority over context-matched probabilistic FNOs or ensembles, nor uniformly nominal coverage.
The strongest evidence for probabilistic modeling still comes from GP regression rather than PDE problems.
There is also a more fundamental question. These PDEs are deterministic, and the full input field is already known. Assuming the PDE parameters and boundary conditions are fixed, what exactly is the latent variable modeling? Is it uncertainty due to limited training data, model approximation errors, or uncertainty in the physical system itself? I think this distinction is important and deserves more discussion.
Second, I remain unconvinced by the architectural novelty. I acknowledge that NOP performs better than Masked-FNO on some benchmarks. However, the best architecture varies across PDEs. Darcy favors SetConv + Attention, Navier–Stokes favors SetConv alone, and Burgers shows little benefit from either over direct masked-grid conditioning.
Moreover, SetConv, cross-attention, and FNO are all existing methods. Showing that their combination works well in some cases does not necessarily establish a strong architectural contribution. Interestingly, in Table 21, the simpler ConvCNP-style model achieves an error of 0.016389 on Darcy, compared with 0.022549 for DANOP.
To me, these results mainly suggest that different PDEs benefit from different conditioning and decoding mechanisms. This is a useful empirical observation, but it does not make a strong case for the proposed architecture itself.
Overall, I appreciate the clarifications, but my concerns about novelty and the experimental support for probabilistic operator learning remain. I therefore maintain my original rating.
Thank you for your review. Please find our responses below: