- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes PadéKoop, a finite-dimensional Koopman learning framework in which nonlinear observables are parameterized as elementwise quotients of independently learned numerator and positive denominator networks. The resulting rational features are concatenated with the physical state and propagated using a learned linear Koopman operator. The method additionally considers denominator regularization and spectral/operator control to address numerical instability in the quotient representation and amplification during latent rollouts.
The paper provides several basic analytical results concerning well-posedness and Lipschitz continuity of the quotient observables, approximation error when the target admits a rational representation, and accumulation of one-step latent errors under repeated Koopman propagation. Empirically, the method is evaluated on four equation-generated physical and biochemical dynamical systems and compared against Koopman models using MLP- and KAN-based observables. The reported results show improved long-horizon out-of-distribution prediction on the considered benchmarks, including a parameter-matched ablation against a standard MLP and a constant-denominator variant. The paper also investigates spectral control of the learned Koopman operator and finds that it can prevent severe latent amplification, although it does not consistently improve prediction accuracy.
Overall, the paper presents a simple and empirically effective rational-observable architecture, while the central question is whether the Padé-inspired structure itself has a sufficiently principled advantage over generic neural observable parameterizations.
Critical strengths
The proposed quotient parameterization is simple, interpretable at the architectural level, and easy to incorporate into existing neural Koopman models. The paper also makes a commendable effort to connect its regularization choices to explicit failure modes: the denominator-margin analysis addresses instability caused by small denominators, while the rollout analysis separates representation error from amplification by the learned linear dynamics. The distinction between latent and re-encoded rollouts is also useful for assessing approximate Koopman closure. Finally, the empirical results indicate that the method is practically viable across several dynamical systems.
Critical weaknesses
The main conceptual motivation for the Padé-inspired parameterization is currently unclear. The analysis establishes that the quotient representation is well-defined and that its approximation and rollout errors can be controlled, but this does not answer the more important question: why should this structure be preferred over a standard neural observable? Good empirical performance alone is not sufficient to establish this point. There are already many competing Koopman lifting architectures, and without a very broad comparison it is difficult to attribute the observed gains specifically to the quotient structure. The paper should therefore provide a more principled argument for why the Padé form is expected to yield a better or more efficient representation. In this regard, the lack of discussion of the classical Padé/rational approximation literature is surprising. Padé approximants are often motivated by approximation properties that can be superior to truncated Taylor or polynomial expansions. If these properties motivate the present architecture, the paper should explain which of them carry over to Koopman observables and how they are reflected in the proposed theory. As written, the current propositions justify the stability of the parameterization, but not the choice of the parameterization itself.
Questions for authors
Q1. What is the strongest principled reason for preferring the proposed Padé-inspired quotient observable over a standard neural observable? The current propositions establish well-posedness and error control. Still, they do not appear to show that the quotient structure is inherently more expressive, more data-efficient, or more suitable for Koopman closure. Is there a theoretical property of the rational parameterization that the authors believe is central to the method?
Q2. How should we understand the connection to classical Padé/rational approximation? Which specific approximation properties of Padé approximants motivate the present architecture, and do any of those properties carry over to the learned Koopman setting considered here? It would be useful to clarify whether “Padé-inspired” is primarily an architectural analogy or whether a deeper approximation-theoretic connection is intended.
2 comments
I understand your explanation and agree with your reasoning, particularly as it reflects a general property of Pade approximations. However, it does not directly address my original concern.
I believe the paper needs a clearer survey of the existing literature and a more thorough comparison with established methods. More importantly, I would expect the proposed method to be evaluated on benchmarks where existing approaches struggle, demonstrating that it can overcome their limitations for the reasons you have outlined.
In this regard, I do not consider my concern to be sufficiently addressed. Therefore, I will maintain my original score.
Rationale for the Padé-Inspired Observable
Response to Reviewer 3
We thank the reviewer for noting that well-posedness alone does not justify a quotient observable. We revised the manuscript to explain its Koopman-specific rationale and distinguish it from classical Pade theorems.
Question 1: Why prefer the quotient observable?
Our strongest principled reason is not universal expressivity or guaranteed sample efficiency. It is algebraic compatibility with denominator-driven dynamics under Koopman composition. Inverse-power and saturating mechanisms have forms such as 1/r2, 1/r7−1/r13, and Vmaxs/(Km+s). The quotient makes numerator variation and denominator-driven scaling explicit. A generic MLP can approximate these functions on a compact domain, but does not encode this structure as an inductive bias. The Van der Pol boundary experiment, where this mechanism is absent, shows that we do not expect the same benefit for arbitrary dynamics.
Let Ω be forward-invariant under a rational transition F:Ω→Ω, and let h be rational with all denominators nonzero on Ω. Then
UFh=h∘F∈R(Ω),UFR(Ω)⊆R(Ω).
Indeed, if Fi=pi/qi and h=ph/qh, substitution and clearing finitely many denominators expresses h∘F as a ratio of polynomials. Likewise, for a rational vector field f,
Lfh(x)=∇h(x)⊤f(x)∈R(Ω).
Thus rational functions are algebraically compatible with both the Koopman operator and its generator for rational dynamics. A polynomial dictionary is generally not preserved by composition with a genuinely rational transition.
This motivates the function class before finite-dimensional truncation; it does not imply a finite-dimensional invariant subspace or a smaller closure residual in every problem. We added a conditional closure-transfer bound. If g⋆(F(x))=K⋆g⋆(x), supx∣g−g⋆∣2≤ε, ∣K−K⋆∣2≤κ, and supx∣g(x)∣2≤B, then
supx∣g(F(x))−Kg(x)∣2≤(1+∣K⋆∣2)ε+κB.
This exposes how observable approximation error and operator-estimation error enter closure. It does not claim that the rational family always has smaller approximation error than an MLP; the direct OOD closure diagnostics show mixed, system-dependent outcomes.
Question 2: Relation to classical Pade approximation
Classical [m/n] Pade approximation constructs a ratio of degree-m and degree-n polynomials whose local series matches the target to the highest order allowed by those degrees. Under suitable analytic assumptions, rational approximants can represent singularity structure and may be useful beyond the disk where a truncated Taylor series is effective. These facts motivate explicit numerator-denominator representations for inverse-power, fractional, and saturating behavior.
The properties that carry over are conditional:
\left\\|\frac{N}{Q}-\frac{p}{q}\right\\|_\infty\leq\frac{\delta_p}{q_0-\delta_q}+\frac{\\|p\\|_\infty\delta_q}{q_0(q_0-\delta_q)}.
These results connect rational representation to Koopman composition and quantify quotient and closure errors under explicit assumptions. At the same time, we do not claim that classical coefficient matching, convergence rates, pole recovery, or analytic-continuation guarantees transfer automatically. Our branches are neural networks, no Taylor coefficients are matched, and the denominator is constrained positive,
Qψ(x)=ϵ+exp(clip(Gψ(x),−c,c))>0,
to avoid real encoder poles. Therefore, the connection is strong at the representation and function-class level, but the model is not a classical coefficient-matched Pade approximant.
Revised scope
The denominator-matched enzyme ablation supports the learned denominator in the intended regime. Mixed closure diagnostics, the polynomial Van der Pol mismatch experiment, the long-horizon reversal, and the limited robot stress test bound this conclusion. We describe PadeKoop as a conditional structural inductive bias for denominator-driven dynamics, not a universally superior replacement for standard neural observables.