- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes a greedy iterative PDE solver that dynamically switches between classical solvers and NOs at each iteration. The central motivation is that classical iterative methods are effective at reducing certain error components, particularly high-frequency errors, while neural operators can provide rapid corrections but may suffer from spectral bias. The authors propose a greedy solver selection routine with theoretical guarantees and learn an approximate greedy router. Experiments on three 2D elliptic PDEs show some performance improvement.
Critical strengths
- The proposed greedy solver selection routine with theoretical guarantees is insightful and interesting.
- The evaluations on 2D elliptic PDEs show some performance gains.
Critical weaknesses
- The theoretical guarantee relies on strict conditions such as zero-preserving contraction. These conditions may not hold for practical PDE-solving scenarios.
- Limited scope. Only three elliptic PDEs on 128x128 uniform grid, and periodic Dirichlet BCs. This setting is insufficient to demonstrate the results.
- Limited baselines. Only legacy baselines are compared with. How does the method compare with a pure NO, such as Transolver [1] or LaMO [2], or other neural multigrid solver methods such as [3]?
- Above-"oracle" performance. In Table 1, for Conv equations, Learned Greedy-GS (35.60) outperforms True-Greedy-GS (35.77, smaller is better), while the authors claim "True-Greedy is an oracle". How is an oracle ("ideal" strategy) surpassed? I would recommend the authors proofread the numbers in theTables.
- The Figures are too small and hard to read.
- References:
- [1] Wu et al., Transolver: A Fast Transformer Solver for PDEs on General Geometries, ICML 2024.
- [2] Tiwari et al., Latent Mamba Operator for Partial Differential Equations, ICML 2025.
- [3] Greenfeld et al., Learning to Optimize Multigrid PDE Solvers, ICML 2019.
Questions for authors
- Please see "weaknesses" above.
3 comments
Thank you for your detailed explanation. The additional numerical results also look promising. I am raising my score from weak reject to weak accept.
Thank you for reviewing our response and updating your assessment. We appreciate your feedback.
We thank the reviewer for the careful assessment. We address each point below.
Zero preservation is natural for residual-based classical iterations: a zero residual produces no update, and the same property can be enforced in a learned corrector. Contraction in the stated norm also holds for suitably damped iterations on many discretized linear elliptic problems; weighted Jacobi in our setting provides an example. We agree, however, that it is not automatic for every solver, neural correction, or PDE. In particular, the proposition does not cover an action whose error map fails contraction in that norm, and contraction alone does not establish postfix monotonicity for a mixed ensemble. We have made these conditions explicit, extended the greedy bound to weak μ-postfix monotonicity, and included an example showing that weak supermodularity can hold even when global contraction fails.
We have expanded the evaluation to Darcy flow and reaction–diffusion with spatially varying coefficients and forcing functions, using homogeneous Dirichlet boundary conditions on a 128 grid. These experiments also use LaMO neural corrections rather than DeepONet. The results appear in Section 5 (“Varying Coefficients and Forcings”) and Table 2 of the revised manuscript. Please see our response to Reviewer 84BD’s Critical Weakness 3 for details.
We have added comparisons with dedicated one-shot LaMO and Transolver models, alongside our standalone DeepONet, on the same 64 instances for each of the three PDEs. The table reports relative solution error and inference time as mean ± standard deviation. Although one-shot inference is inexpensive, none of the models achieves the 10−12 relative solution-error target used in our time-to-solution experiments. We additionally tested whether repeated neural residual corrections, u(k+1)=u(k)+Nθ(f−Au(k)), could reach this accuracy without numerical steps. DeepONet’s error plateaus above the target, with no successful cases within the 60-second evaluation budget. Undamped LaMO and Transolver residual iterations diverge on all evaluated cases. These findings illustrate why low-cost neural predictions and high-accuracy hybrid solves serve different purposes, and support combining neural corrections with numerical refinement.
``True-Greedy’’ means that each decision uses the true error to select the action with the largest immediate error reduction. It is a one-step oracle, not the globally optimal sequence or an oracle for minimum wall-clock time-to-accuracy. The learned router may therefore follow a different trajectory that reaches the tolerance slightly sooner. In the Conv–GS row, the reported difference is 0.17 ms, much smaller than the standard errors. We, therefore, do not interpret it as evidence that learned routing outperforms the oracle greedy policy.