- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper propose to wrap a neural operator with input canonicalization and output frame restoration. It learns spatial alignment, computes background velocity analytically, and uses the known dynamics to determine the terminal transformation. Further, test-time adaptation refines the spatial coordinates while keeping network weights fixed. The paper provides a conditional error decomposition and evaluates several PDE benchmarks.
Critical strengths
I found the construction to be sensible. Separating learned spatial alignment from analytically available background velocity and restoring the time-dependent terminal frame has a clear interpretation.
The paper clearly states limitations. For instance, the paper acknowledges worse Burgers ID accuracy, little additional benefit from SWE adaptation, uncertain NS improvements etc.. It also distinguishes approximate arbitrary-angle rotations from exact periodic translation actions.
Critical weaknesses
It's not clear how much benefit comes from learned spatial canonicalization beyond analytic Galilean correction. For Burgers, background velocity is extracted directly from the input mean. This gives the method access to an exact physical correction that the principal FNO baselines do not explicitly implement.
As far as I understand, the paper’s primary contribution is its particular combination of amortized estimation, analytic kinematic reduction, and spectral actions. The paper should demonstrate which components produce an advance over a straightforward learned canonicalizer supplied with the same physical information. It's not clear from the current set of experiments.
The LieLAC comparison is useful for inference cost. However, comparing one-shot prediction with iterative optimization does not isolate the contribution relative to existing amortized canonicalization.
Questions for authors
See above weaknesses
3 comments
Part 2/2 — Continued from Part 1/2 (W1 and W2)
W3. Isolating the contribution relative to amortized canonicalization
We agree that comparing one-shot prediction with per-instance optimization measures inference cost rather than isolating amortization. The revision separates the two comparisons. Against a straightforward learned canonicalizer, the plain-CNN variants in Appendix Table 7 (with the analytic background-flow extraction kept or removed) provide the matched comparison and locate the gain in the analytic kinematic reduction and the prescribed actions (see W2 above; Appendix Table 7, lines 1678–1695). Against iterative canonicalization, the dedicated same-split LieLAC+FNO run on 1-D Burgers gives OOD error with an evaluation time of s, versus at s for one-shot PACE-FNO (lines 415–418; Appendix Table 10, lines 2075–2083): on this split, amortized one-shot canonicalization matches per-instance optimization in accuracy within the seed spread of LieLAC+FNO, with smaller seed variance and about 16 times lower evaluation time. For the remaining settings, LieLAC's original evaluation uses different operators and task configurations, so we report those results as context rather than as matched comparisons (see also our response to Reviewer AYY8, W3; Appendix B.8, lines 1708–1711).
Dear Reviewer
We have only one day left for author-reviewer discussion. If the rebuttal clarifies your concerns, can you please acknowledge and increase the score.
Thanks
Part 1/2 — W1 and W2
Thank you, Reviewer QYkT, for the careful reading. The concerns center on isolating what each component of the wrapper contributes, and the revision adds the corresponding controls: a matched control that disables only the field actions, a matched auxiliary-estimator control for the FNO, and a unified component sensitivity table (Section 5.3, lines 429–446; Appendix Tables 7 and 16).
W1. Benefit of learned spatial canonicalization beyond the analytic correction
The learned coordinate and the analytic correction play different roles: the background velocity is computed analytically from the observed field (Section 3.2, lines 218–225) and enters the terminal coordinate, which still takes the learned spatial coordinate as its input. The revised manuscript adds the controls that isolate the learned part with the analytic reduction in place. In short, the learned coordinate contributes once it is applied: disabling the pullback and pushforward returns OOD error to the 0.63–1.04 range across the four benchmarks, whereas applying it yields 0.027–0.28 (Appendix Table 7, lines 1678–1695; the component-level decomposition is given under W2 below).
The fairness concern is well taken, and the revision adds the corresponding control. FNO+AuxEstimator (Appendix Table 16, lines 2160–2168) trains the same FNO together with a PACE-identical Lie estimator under the same equivariance and anchor supervision and the same parameter budget, but the estimator's outputs are never used for pullback or pushforward, so the prediction path is the plain FNO. It reports 0.66021±0.03644 on standard-resolution 2-D Burgers OOD, at the FNO level (0.63950±0.03559), while PACE-FNO reaches 0.05863±0.00287. The ordering is unchanged under α=0.10 observation noise (0.66016 versus 0.05867), under 50 random sparse observations (0.6622 versus 0.2397), and under structured missingness (0.7016 versus 0.3244, with PACE-FNO below FNO+Aug at 0.3560) (lines 441–446). Auxiliary parameters and supervision alone therefore do not close the gap; it closes only when the coordinate is applied through the canonical actions.
W2. Which components produce the advance
Appendix Table 7 (lines 1678–1695) now gives the component-wise decomposition. Disabling the learned pullback and pushforward at inference collapses OOD accuracy on every benchmark (1.0384 on 1-D Burgers, 1.0085 on 2-D Burgers, 0.7232 on SWE, 0.6280 on NS), and the matched control reproduces the collapse at the FNO level while keeping the same estimator, supervision, and parameter count (0.66021±0.03644 versus 0.05863±0.00287 on 2-D Burgers). The prescribed field actions carry the main improvement.
Within the canonicalizer, the analytic kinematic reduction is what stabilizes the tasks with background flow: a plain CNN that also regresses the background component degrades 2-D Burgers to 0.5478±0.0303 and is numerically unstable on SWE, whereas a plain CNN spatial branch that keeps the analytic background-flow extraction performs comparably to the full model on 2-D Burgers and SWE (0.0666±0.0076 and 0.1008±0.0142). On approximate NS rotations, removing the full Lie generator also removes the prescribed rotation–translation actions, so the canonicalization path becomes an identity map and the variant reduces to the plain FNO: its error (0.6280) coincides with the without-canonicalization row (Appendix Table 7, lines 432–437 and 1678–1695). This row therefore measures the loss of the actions on the rotation family, not the Lie parameterization alone; evidence on the estimator structure comes from the 2-D Burgers and SWE rows above. The revised manuscript states these task-dependent differences explicitly in Section 5.3.
The advance therefore comes from the combination that the review identifies: amortized one-shot estimation supplies the spatial coordinate at inference, the analytic kinematic reduction removes a component that a learned regressor does not stabilize, and the prescribed spectral actions implement the exact transformation family (Appendix Table 7, lines 1678–1695; Appendix Table 16, lines 2160–2168).