- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper presents SSF-Net, a neural operator architecture for learning PDE solution operators. It uses a U-Net-style encoder-decoder with two branches: (1) a spatial branch that uses four-directional Mamba scans, and (2) a spectral branch that uses Fourier transforms and block-diagonal MLPs. The input features are split between the two branches and fused at the end. The authors evaluate their architecture on 12 PDE benchmark datasets from PDE GYM and APEBench, in the settings of one-step prediction and autoregressive rollout. They show that their method achieves better prediction accuracy than the considered baselines.
Critical strengths
The evaluation covers 12 PDE benchmarks.
Critical weaknesses
- Major reproducibility concerns: The baseline results reported in Table 1 differ substantially from those published in the original DriftNet paper (arXiv:2509.24868), even though the authors of SSF-Net use the same benchmark datasets and closely related training and evaluation protocols. For example, on NS-PwC, SSF-Net reports a final-step L1 error of 0.68 for FNO and 4.74 for DriftNet, whereas the original DriftNet paper reports 4.57 and 1.09, respectively. Likewise, on NS-Tracer-PwC, SSF-Net reports 1.85 for FNO and 8.78 for DriftNet, compared to 9.46 and 4.19 in the original paper. These discrepancies are large and change the relative performance of the baselines. The SSF-Net paper provides no explanation for them. Although Appendix E describes the general training setup, much important information is missing. Furthermore, no code or reproducibility instructions are provided, and there is no reproducibility statement. Given the magnitude of the reported improvements and the discrepancies with previously published results, I consider this a major weakness.
- Missing evidence for fair baseline comparisons: Although Appendix E.3 lists the training configurations, it is unclear how the hyperparameters and architectures of the different baselines were selected, i.e., according to which criteria. The authors use different learning rates, training objectives, and learning-rate schedules across models, but provide neither a tuning study nor an explanation of how they ensured comparable optimization quality. For example, SSF-Net is trained with a learning rate of 5e-4, whereas DriftNet uses 3e-4 and additionally uses its frequency-weighted loss. The models also differ substantially in architecture size and configuration. Moreover, using the same number of training epochs does not by itself establish a fair comparison, since many other moving parts, such as patch sizes, also play a role.
- Having worked with Wave-Gauss myself, I see a real problem with how the authors handle it: Table 3 in Appendix E.1 states that the model input for Wave-Gauss is , with as the prediction target. However, the wave equation is second order in time, so in general the state alone does not determine the future; one also needs , or a proxy thereof, as input. Otherwise, the operator that the network is supposed to learn is not well-defined on arbitrary wave-equation states.
Questions for authors
- Could the authors explain the large differences between the baseline results in Table 1 and those reported in Table 1 of the original DriftNet paper?
- How were the hyperparameters selected when tuning the baselines? Which hyperparameters were varied, over which ranges, and according to which criteria? Were they tuned on validation sets? How did the authors ensure that the baselines were adequately optimized, given their different architectures, training objectives, and learning-rate schedules? 3 ) Could the authors provide a comparison with DriftNet in which DriftNet’s spatial branch is replaced by the proposed Mamba branch, while keeping everything else fixed (remaining architecture, parameter budget, training protocol, etc.)?
- Regarding the Wave-Gauss input described under Weaknesses: does the implementation include the temporal derivative (as in the original Poseidon formulation) as a model input, or is the model trained only on the displacement field? If the latter, what restrictions on the dataset make this one-step prediction problem a well-defined forecasting problem?
- Could the authors provide a qualitative evaluation of the predicted PDE dynamics? I would be happy to see visualizations of the predictions and the corresponding error maps at different forecast horizons.
4 comments
Answers for Q2-Q4
How were the hyperparameters selected when tuning the baselines? Which hyperparameters were varied, over which ranges, and according to which criteria? Were they tuned on validation sets? How did the authors ensure that the baselines were adequately optimized, given their different architectures, training objectives, and learning-rate schedules? 3 ) Could the authors provide a comparison with DriftNet in which DriftNet’s spatial branch is replaced by the proposed Mamba branch, while keeping everything else fixed (remaining architecture, parameter budget, training protocol, etc.)?
Our baseline model hyperparameters were primarily adopted from published configurations rather than selected through a new systematic hyperparameter search. The model configurations of FNO, CNO, scOT follows the setting in Poseidon, and we use the same setting of Drift-Net and PDE-Transformer as their original paper.
We adapted these reference settings to our experimental training budgets and retained architecture-specific choices, including CNO’s batch size and learning-rate schedule and Drift-Net’s frequency-weighted training objective.
| ACE | FNS-KF | |
|---|---|---|
| DriftNet with Mamba branch (33M) | 0.17/0.19/0.34 | 0.49/0.49/0.92 |
| original DriftNet (17M) | 0.12/0.13/0.25 | 0.57/0.57/1.03 |
We replaced Drift-Net’s depthwise convolutional spatial mixer with the four-directional Mamba operator, retaining its spectral processing, radial gating, pointwise channel mixing, remaining backbone, and training protocol. To isolate the replacement within a fixed backbone, we preserved the stage widths and depths. This increases the parameter count from 17M to 33M.
On FNS-KF, the replacement reduces step-averaged/full-rollout/final-step errors from 0.57/0.57/1.03% to 0.49/0.49/0.92%, corresponding to reductions of approximately 14.0/14.0/10.7%. On ACE, however, the errors increase from 0.12/0.13/0.25% to 0.17/0.19/0.34%, despite the larger model.
The FNS-KF improvement is consistent with our motivation for combining scan-mediated interactions with spectral processing, whereas the ACE result shows that Mamba is not uniformly preferable to convolution.
Regarding the Wave-Gauss input described under Weaknesses: does the implementation include the temporal derivative (as in the original Poseidon formulation) as a model input, or is the model trained only on the displacement field? If the latter, what restrictions on the dataset make this one-step prediction problem a well-defined forecasting problem?
Our implementation uses the displacement field and the static wave-speed field, , without an explicit temporal-derivative channel. We checked the released Wave-Gauss dataloaders in the original code of both Poseidon and Drift-Net: both likewise construct two field channels, , and neither loads nor computes . Thus, the augmented state in the Poseidon paper describes the first-order mathematical formulation, rather than the field-channel configuration of its released dataloader. Moreover, The publicly released Wave-Gauss in PDEGym dataset itself contains only the displacement trajectories (u) and the static wave-speed field (c). It does not provide as a separate variable.
Nevertheless, we agree that consistency with these implementations does not establish that displacement alone defines a closed one-step forecasting state. Our current model learns from consecutive snapshots, and we have not established a dataset restriction that guarantees the missing temporal derivative is uniquely determined by these inputs.
Could the authors provide a qualitative evaluation of the predicted PDE dynamics? I would be happy to see visualizations of the predictions and the corresponding error maps at different forecast horizons.
We give FNS-KF qualitative visualization here, which shows GT, SSF-Net and scOT at 5 time steps in appendix I.
Dear Reviewer,
Thank you for your careful examination of our experiments. As the discussion period ends on November 18, we would like to follow up on our response and revised manuscript , in which all changes are marked in blue:
- Baseline discrepancies: We corrected implementation errors affecting scOT and Drift-Net, reran the eight completed benchmarks, and updated the results and analyses. SSF-Net retains the lowest errors on these benchmarks. Appendix E.4 details the model configurations, and our response explains the training-protocol differences from the released implementations of Drift-Net, which is alse revised in Appendix E.3.
- Hyperparameters and branch replacement: We clarified that hyperparameters were primarily adopted from published configurations rather than selected through a new systematic search in Appendix E.4. We also reported the requested Mamba replacement within Drift-Net: it improves FNS-KF but worsens ACE, while increasing parameters from 17M to 33M. We therefore do not present it as a parameter-matched comparison or evidence of a universal Mamba advantage.
- Wave-Gauss and qualitative evaluation: We confirmed that our inputs are displacement and wave speed, without an explicit temporal-derivative channel.
- Qualitaitve evaluation: Appendix I provides predicted fields and error maps at multiple forecast horizons on FNS-KF.
We hope these corrections and additional experiments help clarify the evidence supporting our conclusions. We would appreciate your feedback and, if your main concerns have been addressed, your consideration of an updated assessment.
Sincerely,
The Authors
Thank you for the additional experiments and clarifications. I appreciate the authors' efforts, but my main concerns remain unresolved. The baselines were not systematically retuned for the modified training procedure. With a different training procedure, it may be that the baselines need different HPs to perform well. I am also concerned about how the improvements are presented. For example, the reported 61.9% improvement on Poisson-Gauss is relative to Drift-Net, whereas the improvement over the strongest baseline, PDE-Transformer, is only 0.16 VS. 0.18 (see Table 1) is not reported in your text. I think, comparisons should be always against the strongest baseline.
I therefore maintain my score of 1.
The answer for Q1
The model configurations of FNO, CNO, scOT follows the setting in Poseidon, and we use the same setting of Drift-Net and PDE-Transformer as their original paper.
Our FNO baseline was retrained using a different configuration from that reported in Drift-Net, including 20 rather than 16 Fourier modes and an initial learning rate of 5×10−4 rather than 3×10−4. This setting is from the Poseidon.
We acknowledge that errors were introduced when porting the scOT and Drift-Net implementations into our training framework. We have corrected these errors and rerun the affected experiments. The revised results supersede the corresponding values in the original submission. With the corrected baselines, SSF-Net retains the lowest errors across all eight completed benchmarks. Relative to the stronger of scOT and Drift-Net on each task, it reduces the step-averaged, full-rollout, and final-step errors by 59.2%, 59.2%, and 58.2%, respectively, averaged equally over the seven time-dependent tasks. On Poisson-Gauss, the error reduction is 61.9%. These improvements are achieved with 11M parameters, compared with 20M for scOT and 17M for Drift-Net. Experiments on Kolm-Smooth, Kolm-Turb, KS-Strong, and KS-Weak are still running. We will report the updated results once these runs are complete.
We will explain why the results are still differenct from the Drift-Net paper.
There is a difference in how training examples are organized. The released Drift-Net dataset interface indexes individual trajectory–time pairs, allowing pairs from different temporal positions to be mixed during training. In our implementation, each batch contains complete trajectories. We then process their adjacent transitions sequentially, performing a separate optimizer update for each time index. Thus, samples within each update share the same temporal position. This introduces temporal homogeneity within each optimization batch, which may contribute to the substantially lower scOT and Drift-Net errors observed in our reruns compared with the original paper, as well as the stronger performance of scOT relative to Drift-Net on some tasks.
This training scheme allows us to systematically use all adjacent transitions from each sampled trajectory batch, with a fixed prediction interval matching the one-step rollout task. Processing the transitions in temporal order also ensures that each optimizer update contains examples at the same temporal position, rather than mixing states from different stages of evolution. This provides a consistent batching protocol across the compared architectures, although we do not claim that it is universally preferable to shuffled trajectory–time pairs.
Consequently, our experiments are retraining comparisons under our stated protocol, rather than direct reproductions of the published Drift-Net results.
We have updated the affected experimental results and the corresponding analyses in the revised manuscript. We have also clarified the architecture and configuration of each baseline in Appendix E.4 (Model Configurations).