- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper proposes DRAGONS for approximating the Koopman generator of continuous-time systems based on gEDMD. The key innovation is that it learns the Koopman generator on a data-driven dictionary via SWIM-sampled random features, which is gradient-free. The paper also provides convergence of the approximate vector field and trajectories. In addition, it shows LE/FTLE bounds on exploding adjoint gradients of Neural ODEs on chaotic systems.
Critical strengths
This paper studies an important problem on Koopman learning, since dictionary choice is the central bottleneck. Evaluating candidate neurons by how they act under the generator before constructing them is an interesting idea. The theoretical results on gEDMD preserving quasi-dissipativity (Lemma 4) and the resulting semigroup-level convergence via Trotter–Kato are also meaningful contributions.
Critical weaknesses
(1) The dictionary construction follows from SWIM (Bolager et al., 2023). Its combination with Koopman approximation was already proposed in Bolager et al. (2026a), and, as described in Appendix A, uses SWIM-sampled observables with EDMD and the flow-driven density. The innovation compared to Bolager et al. (2026a) could be stated more explicitly. (2) The method is formulated for deterministic systems, but is applied to stochastic systems such as the alanine dipeptide. The original EDMD algorithm does apply to both cases, yet there are several theoretical gaps in the paper. For example, Lemma 1, Theorem 2, and the Neural ODE analysis are, in their current form, stated for deterministic systems. The paper could clarify its scope more explicitly. (3) The experiments are on 2D or 3D with polynomial vector fields. As the polynomial dictionary is known to be rich enough, it is hard to tell the benefit of the proposed method. (4) As stated in Assumption 1, the samples are IID from a measure whose density is bounded away from zero. Theorem 2 additionally requires quasi-contractivity. It would be helpful to check these assumptions in the experiments.
Questions for authors
(1) Could the author clarify the contribution relative to Bolager et al. (2026a), beyond replacing EDMD with gEDMD? (2) Is the result intended for deterministic systems only, or can it be extended to stochastic systems easily as well? (3) In the Lorenz example in Table 2, DRAGONS uses 131 features against 19 for gEDMD-DL. Is the baseline also tuned, or could the author provide some explaination why the dictionary sizes differs so much.
2 comments
We additionally want to specifically address the concern raised in Critical Weakness 4 (the others are addressed above). Our theory assumes i.i.d. samples from a density bounded away from zero on a forward-invariant set, whereas our experiments use trajectory data. The forward invariance is a standard assumption in Koopman Theory and compatible with the conducted experiments by the presence of attractors. It is worth mentioning that we sample the initial conditions uniformly over rectangular regions, which will not typically be strictly forward invariant since some trajectories will temporarily leave them. It is, however, very difficult to describe forward invariant sets explicitly even for simple systems like Van der Pol, but we assume a slight mismatch here to be of limited relevance. The major mismatch is the use of trajectories rather than IID-sampled points. We chose this for two reasons: Firstly, we deem trajectory data to be the more realistic setting, since it more closely resembles the format of measurements from physical systems and does not require knowledge of the vector field. Secondly, we note that a sufficiently developed theory for gEDMD under dependent data, building on ergodic-sampling results, is not yet available and is thus beyond the scope of this paper; we have added this to the limitations. For example, Nüske et al. 2022 [1] provide a good foundation in this direction, but only consider the finite data approximation of generators projected on finite dictionaries, not the approximation of the true generator in the case of ergodic sampling of trajectories.
To bridge this gap, we added a second version of the Van der Pol experiment where the model is trained with i.i.d. sampled data, and provide the results in Appendix F.1.1.
All relevant changes are highlighted in blue in the revised manuscript.
We sincerely thank the reviewer for their time and the provided feedback.
First, we address the questions:
Although our work bears similarities with Bolager et al. (2026a), there are important differences to keep in mind: first of all, Bolager et al. only use the flow-driven density, which is an immediate application of the SWIM algorithm to their setting. We explore three different strategies: the flow-driven density an analogue of Bolager et al., for which we also provide an argument in Appendix C for why it is inadequate in our setting of irregular timesteps beyond the empirical evidence; the vector-field-driven sampling, which is the immediate application of the SWIM algorithm to the goal of regressing a vector field with a network; and the generator-driven density, which is a novel methodological contribution based on using the neuron to be constructed in the computation of the score, which has not been explored in any prior work. Furthermore, our approach does not construct a recurrent neural network; secondly, our theoretical contributions are more extensive and also applicable beyond the scope of this work; thirdly, our computational experiments include an example from molecular dynamics, and a 7D dynamical system (newly added).
Our theory is developed only for deterministic systems, we now make this clear with changes in the manuscript. It is possible to extend our approach to stochastic systems if the diffusion term of the Koopman generator is approximated as well; however, we leave this to future work. In our numerical experiments we explore if our sampled dictionary choice combined with EDMD (which exists for stochastic systems) is potentially viable for a stochastic system like the Alanine Dipeptide, the text was also changed to reflect this.
In Table 2 the number of features in provided in order to aid with the interpretation of the training time. The choice of features across different problems and models differs due to each model being tuned to the specific problem via a hyperparameter search, the details of which are given in Appendix F. Both methods were tuned over the same range of configurations (including the number of features). In our view, there are arguments in favor of a large dictionary (e.g. higher expressiveness, assuming independence in features), but also arguments against a large dictionary (e.g. ill-posedness of the linear system), thus is it difficult to make a statement in general about which dictionary size is favorable for a particular problem. The resulting number of features was selected according to the error on a validation set, which we consider to be in line with the conventional model selection approach in machine learning. A possible explanation for why gEDMD-DL ends up using (significantly) fewer features in this example is that DRAGONS is a random feature method which selects the features probabilistically according to a data-driven heuristic. Thus, the selected features might not be optimal, and it is also possible that essentially useless features are selected. gEDMD-DL solves an optimisation problem for each feature, meaning that the trained features will typically be reasonably close to optimality, but this is negatively reflected in the training time. It is true that a resulting larger dictionary incurs higher costs for prediction, but this could be mitigated by pruning the sampled features or compressing them using an SVD. We have, however, not explored these extensions to our method so far.