- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper proposes a runtime-tunable reduced-order modeling framework for efficient PDE solving. It combines a learned coordinate-based spatial bank with linear-span and nonlinear-manifold representations, using matrix-free Petrov–Galerkin projection for efficient online solving. The ordered spatial bank allows users to adjust the accuracy–efficiency trade-off without retraining. Experiments on Poisson, heat, Burgers, and Navier–Stokes equations demonstrate promising accuracy and speedups over full-order solvers and existing learning-based approaches.
Critical strengths
-
Practical and flexible design. The ability to switch between linear-span and nonlinear-manifold representations and adjust the basis width at inference time is useful. The integration of coordinate-based spatial banks, precomputation, and hyper-reduction makes the framework computationally efficient.
-
Strong empirical results. The experiments cover multiple PDE families and resolutions, demonstrating substantial speedups and encouraging cross-resolution performance. The comparisons with both conventional ROMs and neural operators provide useful evidence of the method's practical value.
Critical weaknesses
-
Limited diversity of nonlinear evaluations. Although the paper includes Burgers and Navier–Stokes equations, the most accurate configurations for several tasks use the linear-span representation. Additional challenging nonlinear PDE benchmarks would help establish when the nonlinear-manifold component provides substantial benefits and how broadly the framework generalizes.
-
Some limitations in baseline comparisons. The reported speedups depend on the selected full-order solvers, and the neural operator comparisons use different training data sizes and computational budgets in some settings. More closely matched comparisons would strengthen the empirical conclusions.
Questions for authors
-
Could the authors provide additional experiments on more challenging nonlinear PDEs, particularly problems with stronger nonlinear dynamics, to further demonstrate the benefits of the nonlinear-manifold representation?
-
Could the authors further clarify when the nonlinear head is preferable to the linear span, and whether its advantages extend beyond the current Navier–Stokes setting?
-
How might the reported speedups change when compared with more optimized full-order solvers or neural operators trained under more closely matched budgets?
Minor Suggestion: The paper is generally well organized and easy to follow. However, Figure 1 could be more visually polished, with a cleaner layout, more consistent typography, and clearer separation between offline training and online inference. This would further improve the presentation.
3 comments
Thanks for the additional experiments and clarifications. They address my main concerns, and I'll keep my positive rating.
Thank you, and a short note on Q3
Thank you for your positive assessment, and for taking the time to read our response. In case it is useful, here is a short summary of where the Q3 results ended up; no reply is needed.
With the same training data, a bank refitted at width 512 has lower worst-case and median error than the FNO and U-Net runs (Table 4; Appendix F.4). The accuracy-matched cuDSS and AmgX comparisons are in Appendix F.5. Because the reduced-solve time does not grow with the mesh, the speedup over our error-matched solver rises from 3.3–4.3× at 256² to 10.7–12.8× at 1024² on Burgers 2D (development cases). All of this is in the revised manuscript.
Response to Reviewer 8ZEF
References below are to the revised manuscript.
Thank you for your constructive review. We have added nonlinear benchmarks, matched comparisons and clearer figures in response to your suggestions.
W1. Diversity of nonlinear evaluations
We added interacting-vortex Navier–Stokes with sharper initial data and lower viscosity (§5.1, Table 1), and unsteady cylinder flow (§5.2, Table 2). The fast Navier–Stokes head stays below 0.5 % worst-case error at 5.1–10.2× over its matched solver, while the same bank's linear span fails. The cylinder demonstrates non-box geometry and query-time width choices; it uses linear-span Galerkin and does not establish an additional nonlinear-head advantage.
W2. Fairness of the comparisons
We separate the comparisons: numerical solvers are matched to each setting's accuracy (§5.3), while neural operators are compared by prediction error under the reported training budgets. With the same 4,608 Burgers trajectories, our median error is 7–9× lower; operators have lower worst-case error (Table 4; Appendix F.2). The budgets do not establish convergence. Transform solvers win on box Poisson/3D heat.
Q1. Additional challenging nonlinear experiments
The added benchmarks are described under W1. Cylinder widths 24/32 retain all six targets over a window three times longer; extrapolation outside the training band remains limited (Table E.2). We state these limits alongside the results.
Q2. When is the nonlinear head preferable?
The head helps when few unknowns are affordable and a linear span fails (Figure 2). At 16 Burgers coordinates, errors are 2.56 % for the head, 56.9 % for a linear closure and 31.8 % for a quadratic one (Table F.3). A wider span can be faster; §5.5 explains this choice.
Q3. Stronger solvers and matched neural operators
W2 summarises the corrected comparison. For cylinder flow, FNO meets all targets on the standard window, but no tested operator does on the longer window or outside the training band (Table F.2). On Burgers 2D with the same training data, a bank refitted at width 512 has lower worst-case and median error than the FNO and U-Net runs (0.33 % and 0.035 % against 0.43–0.51 % and 0.19–0.23 %), also on 64 fresh cases; the refit is specific to that width (Table 4; Table F.4). The operator runs are those already reported under W2. Against accuracy-matched cuDSS and AmgX time steppers, our Burgers 2D settings are 1.2–2.5× and 2.6–8.3× faster, and 2.7–36× faster than cuDSS in 3D; AmgX is faster than our accurate 3D setting at 64³ (Table F.5). The accuracy–cost setting is chosen at query time from one trained bank. The reduced-solve time is essentially unchanged from 256² to 4096² (Figure G.3), while a full-order solve grows with the mesh, so the speedup at matched error increases with resolution: 3.3–4.3× at 256², 5.4–6.3× at 512² and 10.7–12.8× at 1024² over our error-matched full-order solver on Burgers 2D (development cases; Appendix F.4).
Minor suggestion. Figure 1
We redrew Figure 1 to separate offline training and online inference, with a cleaner layout and consistent typography.