- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes SALTO (Solver-Anchored Lifted Transfer Operators), a Koopman-based framework for nonlinear PDE source inference. The main idea is to combine the tangent linear propagator provided by a numerical solver with learned nonlinear observables, allowing the nonlinear dynamics to be approximated by a linear propagator in a lifted space. The authors introduce three structural constraints—quadratic centering, solver anchoring, and block triangularity—to ensure that the learned model recovers the simulator's tangent linear dynamics and classical adjoint in the infinitesimal-perturbation limit.
The method is evaluated on three nonlinear PDE systems: Burgers, reaction–diffusion, and Kolmogorov flow. The experiments demonstrate improvements in finite-amplitude measurement prediction, source localization, intensity estimation, and multi-source posterior inference compared with classical adjoint methods and several learned baselines.
Critical strengths
-
SALTO integrates the solver's tangent linear propagator into the learned Koopman model and guarantees recovery of the classical adjoint in the infinitesimal-perturbation limit. This is a meaningful contribution compared with approaches that rely solely on training losses to improve derivative accuracy.
-
The experiments cover three PDE systems with distinct nonlinear mechanisms and evaluate measurement accuracy, source localization, and posterior inference. In particular, the multi-source reaction–diffusion experiment demonstrates that SALTO can approximate the solver-based posterior at substantially lower inference cost.
Critical weaknesses
- Computational scalability and overall efficiency
Although SALTO avoids repeated nonlinear simulations during source inference, its offline costs include training-data generation, tangent linear propagator construction, and learned operator fitting. The supplementary material provides useful implementation details and introduces translation-equivariant blocks to reduce computational complexity, but a systematic analysis of runtime and memory scaling remains lacking.
Moreover, the reaction–diffusion experiment in Table 1 achieves only approximately 1.8× online speedup over the nonlinear solver. Could the authors provide a breakdown of offline and online computational costs, evaluate scaling with spatial resolution and lifted-channel count, and estimate how many inference queries are required to amortize the offline costs?
- Finite-amplitude sensitivity accuracy
The theoretical guarantees concern the infinitesimal-perturbation limit and do not directly establish accurate gradients at finite amplitudes. For example, Supplementary Table 8 shows that, on reaction–diffusion, the proposed two-channel lift has a gradient error of 21% in the intensity range [1, 2), compared with 7.8% for the unconstrained lift. Beyond the training range, the corresponding errors increase to 73% and 24%.
These results suggest a trade-off between exact local consistency and finite-amplitude accuracy. Since the main experiments use larger lifts, could the authors clarify whether this trade-off persists for the four- and eight-channel models and provide a more systematic analysis of gradient accuracy across perturbation amplitudes?
Questions for authors
The same as weaknesses.
2 comments
The authors have addressed my questions. I will keep my original rating of weak acceptance.
Reply to Reviewer 6Z3n
We thank the reviewer for the positive assessment.
W1. Offline and online cost, scaling and amortization. The new cost appendix (Table 13) gives every stage on one A100, every model in double precision. Offline, the training data, the propagator and the backward solves take seconds, and training takes about eight minutes for the four-channel lift. Online, a pass over the candidate grid is 6 times faster than the solver on reaction–diffusion and 70 times on Kolmogorov flow (general comment, item 2), so training is recovered after about 160 grid passes on reaction–diffusion and 12 on Kolmogorov flow. The encoder's cost per candidate grows about linearly with resolution and hardly changes with the number of channels. Memory sets the limit: the dense learned blocks grow as (cN)2, while the translation-equivariant blocks grow as c2N and stay below five megabytes. For non-uniform base states, only the state block must keep the solver's resolution, and pooling the learned channels onto a coarser grid of M≪N points would reduce the learned blocks to (cM)2 (Section 6).
W2. Finite-amplitude gradients and the number of channels. We retrained every ablation at four channels and ran the gradient check on them (general comment, item 1). The trade-off does not persist. At four channels the constrained lift is more accurate than the unconstrained lift in every band on both systems, including beyond the training range, and Table 8 gives every band at two and four channels. The eight-channel lift of the paper is the translation-equivariant lift for the posterior, trained on random fields rather than on the source family, so we did not include it in the gradient check.