- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies the limitations of truncated spectral parameterizations for Fourier multipliers whose symbols depend only on wavevector direction and are homogeneous of degree zero. For linear spectral networks with frequency-independent channel mixing above a cutoff, the authors derive an operator-norm lower bound based on angular variation and an ensemble error formula that accounts for the input spectrum. They propose a directional spectral layer using even angular harmonics, with coefficients shared across frequencies and a parameter count independent of grid resolution. The paper establishes exact representations at finite angular degree for the isotropic elastic Eshelby–Green symbol and the Leray projector. Two-dimensional experiments compare the method with truncated and full-band FNOs, a continuous isotropic-symbol model, and a U-Net, with additional FNO comparisons in three dimensions. The reported results show improved accuracy and parameter efficiency on the tested order-zero operators. A heat-operator control and a nonlinear homogenization task show that these advantages do not hold uniformly across targets. The authors also study resolution transfer and use a learned directional symbol in an unrolled FFT homogenization scheme, reporting fewer iterations at matched reference-field error.
Critical strengths
-
Clear problem formulation and interpretable linear analysis. The paper identifies a concrete mismatch between direction-dependent order-zero operators and the frequency-independent matrix used above the cutoff in linear mode-truncating spectral networks. The operator-norm bound makes this limitation explicit and relates it to the angular variation of the target symbol. The paper also explains why truncation error can still decrease for smoother inputs as the cutoff increases, which helps clarify the scope of the result.
-
A compact parameterization supported by operator structure. The directional layer incorporates the target symbols’ dependence on wavevector direction and their symmetry under sign reversal. The exact low-degree representations of the isotropic elastic Green’s symbol and the Leray projector provide a concrete mathematical justification for this design. Sharing the angular coefficients across frequencies keeps the spectral parameter count small and defines the same spectral rule on different grids.
-
Substantial empirical gains on the tested order-zero operators. The spectral models share a common backbone and training protocol, which helps isolate the effect of the spectral parameterization. On the 2D isotropic elastic target, the directional model achieves a relative error of 0.0065, compared with 0.0259 for the full-band FNO, using approximately 38k and 8.4M parameters, respectively. The reported advantages across several order-zero targets in both 2D and 3D support the practical value of direction-dependent spectral weights for these tasks.
-
Useful controls and comparisons that clarify the method’s scope. The heat-operator control shows the importance of radial dependence for a smoothing target, while the full nonlinear homogenization experiment reports better accuracy from a full-band FNO. The resolution-transfer study also shows that the full-band FNO transfers reasonably well when both grids represent the same band-limited inputs. These comparisons help identify where the proposed representation is useful and where its advantages are more limited.
Critical weaknesses
-
The error prediction for the radial baseline is not fully justified. Theorem 4 finds the best frequency-independent matrix, but the linear version of the radial RBF baseline can vary its matrix with frequency magnitude. The paper does not show why the same prediction applies to this baseline. In particular, different radii on the finite Fourier lattice can have different angular averages, so radial freedom may improve on the best constant matrix. This observation does not determine the optimum of the actual finite RBF model, but it identifies a missing step in the argument. Until that step is addressed, the elastic predictions in Table 2 are not established as lower bounds for this baseline, and the 2.4%–4.0% below-prediction errors cannot be attributed specifically to nonlinearities. This weakens the central claim that the error of each architecture can be predicted before training.
-
The claim that optimization has been ruled out is too strong. Section 5.2 argues that trained nonlinear truncated models remain at or above the linear predictions. However, the FNO result with 1,024 training samples in Figure 2 appears below the prediction of 0.3904 in Table 2. The paper does not explain whether these results use the same input spectrum and error metric. If they do, the result would challenge the stated behavior of the nonlinear models, while leaving Theorem 4 intact because it applies only to linear models. The changes to width, training length, and loss provide useful evidence for the settings tested. Their limited gains, however, do not establish that optimization cannot contribute to the remaining error or that nonlinear models have reached an architectural floor.
-
The solver results need clearer accuracy reporting and scope. Table 6 gives matching iteration counts and speedups, but not the actual relative field errors or physical equilibrium residuals. The residual of the 3000-iteration reference is also missing. This makes it difficult to judge how accurate the reported solutions and reference fields are. In addition, learning changes an operator inside the fixed-point equation. Initializing it at the analytic operator does not ensure that the original physical solution remains a fixed point after training, and the paper does not explain whether this property is preserved. The reported improvement after a fixed number of iterations is meaningful. A broader claim that the learned iteration can replace the original solver needs further validation, or a clearer statement that the result is limited to the prescribed number of steps.
Questions for authors
-
Error prediction for the radial baseline. Could the authors justify the Table 2 predictions for the radial RBF baseline on the elastic targets? Theorem 4 optimizes a constant matrix , but the baseline’s linear version can use a radius-dependent matrix . On the finite Fourier lattice, need not equal the global angular mean. Could the authors show that the available radial freedom leaves the stated optimum unchanged, or provide a suitable bound or reference value that accounts for it? The comparison should use the same input distribution and error metric as the experiments.
-
Figure 2 and the linear prediction. What is the exact error of the FNO with 1,024 training samples in Figure 2? Does it use the same input spectrum and definition of relative error as the prediction of 0.3904 in Table 2? The plotted result appears below that value. If the settings match, how can this be reconciled with the claim that trained nonlinear truncated models remain at or above the linear prediction? Please also clarify how the training and loss experiments support the stronger claim that optimization-related explanations have been ruled out.
-
Accuracy and scope of the learned solver. Does §5.6 aim to improve accuracy after a fixed number of iterations, or also to provide a replacement solver that preserves the original physical solution? If the latter, what ensures that the original solution remains a fixed point after learning ? Please report the relative field errors and physical equilibrium residuals for both methods at the Table 6 comparison points, together with the residual of the 3000-iteration reference, and define how the residual is computed. If the learned iteration is intended to run beyond the training horizon, please also show its error and residual behavior for additional iterations.
Response to Reviewer HNGN
Thank you for a careful and constructive review. Each of your three questions led to a concrete correction in the revision.
Summary.
Q1 (radial baseline). Prop 5 formalizes your argument. The best radial linear model applies, on each lattice shell ∣k∣=r, the energy-weighted mean of the symbol over that shell. Its error is the within-shell variance, which never exceeds the constant-matrix floor and equals it when every shell samples directions uniformly. Because the radial class is closed under sums and compositions, this floor bounds linear radial networks of any depth. On the experimental inputs and metric it is 0.4998 (elastic), 0.4969 (cubic) and 0.7025 (Stokes), and the trained isotropic models sit above it (+8.1%, +7.9%, +0.7%). For comparison, computed for this response, the best fit within a single layer of the baseline's own 16-function radial basis is 0.5466 / 0.5505 / 0.7053. On the two elastic targets the trained four-layer models (0.5402 / 0.5364) lie between the radial floor and this one-layer fit. Stacking layers composes radial profiles beyond the span of one layer, and the nonlinearity may also contribute, and I cannot separate the two. The paper no longer attributes the fall below the constant-matrix value to nonlinearity, since radial freedom alone can explain it.
On prediction before training, the floors remain computable before training from the symbol, the input spectrum and the grid. They are bounds for linear models of each class and a reference, not a bound, for trained nonlinear ones. At the default budget most trained models land 0.7–18% above them, but on Stokes the K=16 FNO is 12% below its floor (0.4367 vs 0.4972, Table 2).
Q2 (Fig. 2 at 1024 samples). The value is 0.2891 (one seed). Fig. 2 was run on the cubic-reference target (A=3.2), not the isotropic one, and I have corrected the caption. The input spectrum and error definition match the main experiments, so the relevant floor is the cubic K=16 floor of 0.3943 rather than the isotropic 0.3904, and the 1024-sample model is 27% below it. As you note, this leaves Theorem 4 intact, but it contradicts my statement about trained nonlinear models. The revised §5.2 reports it. A truncated FNO can fall below its floor, with more data on the cubic target, and already at 512 samples on Stokes (0.4367 vs 0.4972, Table 2).
I no longer claim that optimization has been ruled out. The evidence supports a narrower statement.
Q3 (solver accuracy and scope). The numbers below are reported in revised Table 4 (submitted Table 6), for contrast 100 / 1000 and one seed. They use the model at the end of training, whereas the submitted table kept the best test-set checkpoint (see the general comment). This, together with a finer evaluation grid, is why the matching analytic iteration counts differ from the submitted ones (31 vs 32–33 at contrast 100, and 69 where the submitted table reported only more than 40).
The learned operator therefore fits the field at step 16 rather than the physics, since its equilibrium residual at that step is two to three times the analytic one. The residual (App. B) is (∑k∥σ^(k)k∥2/∑k∣k∣2∥σ^(k)∥2)1/2 over nonzero, non-Nyquist modes. The result holds only for the prescribed number of steps. I have withdrawn the replacement claim and leave preserving the fixed point (for example, by using the learned operator as a preconditioner) to future work.
Thank you again for the time and effort you put into this review.