- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes CAFE+FNO for learning PDE solution operators. The method combines Fourier and Chebyshev features and multiplies the outputs of parallel branches. An MLP then uses these features to generate the Fourier kernel weights. Each layer uses the same generator for all stored frequency modes.
The authors test the method on five PDE datasets. The dense model has the lowest average error on four datasets, while SirenFNO performs better on reaction--diffusion. The paper also reports results over five random seeds and includes ablation studies on the feature choices, multiplication step, and bandwidth.
Critical strengths
-
The idea is clear and easy to understand. Combining Fourier and Chebyshev features is a reasonable way to improve the kernel generator. The paper also explains how the method builds on earlier work.
-
The reported results are promising. The dense model has the lowest average error on four of the five datasets. The authors report five-seed results with standard deviations, and the ablation studies support using both feature types and the multiplication step. They also clearly report the dataset where their method performs worse.
Critical weaknesses
My main concern is that the errors of several methods in the main table look larger than those reported in well-known papers for the same PDE problems. This makes me question whether the baselines are performing as well as they should. Training all methods with the same pipeline does not fully address this concern.
The authors should compare their reproduced baseline results with the published results and explain the differences. Please clarify the dataset versions, PDE parameters, resolution, prediction time, normalization, and error calculation. If the settings are intended to match, the authors should explain why the errors are larger. Without this check, it is difficult to judge whether the reported improvement is over strong baselines and how the proposed method compares with existing work.
Questions for authors
-
Could the authors compare their reproduced baseline results with the published results for the same PDE problems? Why are some errors much larger, and which differences in the experimental settings explain this?
-
Could the authors provide a short table showing the dataset versions, PDE parameters, resolution, prediction time, normalization, and error calculation used in this paper and the reference papers? If the settings are intended to match, could the authors reproduce the reference baseline results and explain any remaining differences?