- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper proposes the MF-MoE framework for PDE surrogate modeling. It combines one pure neural operator with three solver-based hybrid experts that run PhiFlow at Coarse, Medium, or Fine resolutions, upsample the result and blend it with a neural network output. To balance inference time and accuracy, the physical parameter space (viscosity/buoyancy) is discretized into bins. During training, a look-up table of historical MSE and wall-clock runtime per expert is maintained for each bin. At inference time, a small Linear Program computes a probability distribution over the experts to minimize expected MSE subject to an expected time budget. Experiments on 2D Navier-Stokes and 2D Burgers equations report lower test MSE than standalone neural operators while meeting a 10s average time constraint.
Critical strengths
Balancing the fast inference of pure neural operators against the ability of out-of-distribution generalization of classical numerical solvers addresses a real problem in scientific machine learning.
Critical weaknesses
-
Invalid selector and gating The gating mechanism is a static per-bin look-up that cannot handle OOD inputs, which invalidates the paper's core claim. Despite claims of instance-wise routing that learns to determine whether using a physical solver is necessary for a given input, the gate never inspects the input physical field. It is a static table look-up indexed solely by the scalar physical parameter bin, followed by random sampling. Because the LP optimizes a linear objective over a 4-element simplex with one linear budget constraint, any basic optimal solution trivially places all probability mass on at most two adjacent experts on the lower convex hull of the bin's cost-error plane (which is why Figure 3 looks the way it does). However, the paper's central motivation is OOD generalization. in the Navier-Stokes experiments, the training set uses viscosities in {3.2, 1.6, 0.8} x 10^-2, while the test set evaluates viscosities in {0.8, 0.4, 0.2, 0.1} x 10^-2 (and similarly disjoint buoyancy values {0.05, 0.55} in Section 4.3). Because the error table E is populated during training, strictly OOD test parameters fall into bins that were never seen during training. If those bins use training statistics, the pure neural operator's error is severely underestimated (for example, UNO-128 has a training MSE of 0.26 x 10^-2 vs. a test MSE of 17.0 x 10^-2), which would cause the LP to route OOD samples to the exact neural operator that fails out of distribution. Conversely, if the table is populated using validation or test errors, that constitutes direct test-set leakage. Either way, there is no valid mechanism to route unseen OOD regimes.
-
Essential baselines are omitted Within each bin, MF-MoE's expected MSE is simply a convex combination of its constituent experts. Yet Table 2 and Table 3 only report raw upsampled solver outputs, completely omitting the test MSE of the individual hybrid experts (Hybrid-Coarse, Hybrid-Medium, Hybrid-Fine). Without seeing the standalone hybrid accuracies, it is impossible to evaluate the router. The most critical error is perhaps every hybrid expert included in the MoE pool costs between 12s and 38s, violating the c = 10.0s budget on every single call. The budget is only met in expectation by mixing with the 0.2s neural operator, which contradicts the paper's repeated claims of strictly adhering to the computational budget. However, Table 1 shows that the XCoarse (16 x 16) solver takes 8.0s, which is under the 10s limit. The authors compare against the raw XCoarse solver (15.1 x 10^-2), but exclude a Hybrid-XCoarse (XCoarse solver + Neural Operator) baseline. A standalone Hybrid-XCoarse model deterministically satisfies the 10s budget on every sample without needing MoE routing.
-
Flawed hybrid architecture and mathematical errors in the method description As shown in Figure 7 (Appendix A.1), the neural operator branch inside the hybrid expert only receives the initial conditions and physics vector; it never takes the coarse solver's prediction as input. A neural network cannot learn to correct localized numerical or interpolation errors if it is completely blind to the coarse solution. It is merely an independent pure neural operator whose output is blended with the upsampled solver output via , where the hyperparameter is never even reported. The mathematical description in Section 3.3 is also flawed. In Equation 5, the running average update at iteration t for bin k is written as . This confuses the bin index k with the sample count, and inverts the averaging weights, giving weight (k-1)/k to the new observation and zero weight to new observations in bin k=1. Similarly, Equation 4 sums over but normalizes by . In addition, the timing model also appears dominated by overhead: per frame, the Fine solver (128 x 128, 8 steps) performs 512 times more cell updates than the XCoarse solver (16 x 16, 1 step), yet takes only 4.75 times longer (38s vs. 8s). Taking 8 seconds for a single explicit Euler step on a 16 x 16 grid indicates the timings measure Python or I/O overhead rather than actual numerical solve time.
-
Toy dataset scale and severe numerical contradictions across tables and figures Appendix A.2 reveals that the Navier-Stokes training set contains only 60 input-output pairs (5 trajectories x 3 viscosities, length 8), and the test set has 80 pairs. Models with 67M to 440M parameters are trained for 8,000 samples by repeatedly reusing these 60 pairs, with no random seeds or error bars reported. Moreover, the viscosity 0.8 x 10^-2 appears in the train, validation, and test splits simultaneously, and the standalone FNO baselines perform worse than or close to predicting a constant mean field (Gaps to Means is roughly 0.19 in Figure 2, while FNO64-4 gets 0.203).
Questions for authors
- How are test samples with OOD parameter values (viscosities in {0.4, 0.2, 0.1} x 10^-2 and buoyancies in {0.05, 0.55}) mapped to error statistics in the look-up table, and on what data split are those statistics computed?
- What are the test MSEs of each standalone hybrid expert (Hybrid-Coarse, Hybrid-Medium, Hybrid-Fine) and of a budget-feasible Hybrid-XCoarse (8s) model?
- Why does the neural operator branch in the hybrid model (Figure 7) not take the coarse solver prediction as input? What value of is used to combine them?
- Why do the neural operator MSEs in Figures 4 and 5 (0.3 to 1.1) differ by an order of magnitude from the corresponding values in Tables 2 and 3 (0.08 to 0.20), and why is the 4-step rollout error in Figure 6 lower than the 1-step error in Table 2?
- Why does a single step of explicit Euler on a 16 x 16 grid (XCoarse) take 8.0 seconds, and is the coarse solver re-initialized from the current fine input state at every prediction step?