Control Disturbance Rejection in Neural ODEs
Not on the map. Why?
Abstract (arXiv)
In this paper, we propose an iterative training algorithm for Neural ODEs that provides models resilient to control (parameter) disturbances. The method builds on our earlier work Tuning without Forgetting-and similarly introduces training points sequentially, and updates the parameters on new data within the space of parameters that do not decrease performance on the previously learned training points-with the key difference that, inspired by the concept of flat minima, we solve a minimax problem for a non-convex non-concave functional over an infinite-dimensional control space. We develop a projected gradient descent algorithm on the space of parameters that admits the structure of an infinite-dimensional Banach subspace. We show through simulations that this formulation enables the model to effectively learn new data points and gain robustness against control disturbance.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 9 of its 19 references that are in the map. First posted on arXiv 22 Sep 2025.
Builds on
9 of 19 references.
References · 9
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
- 2019Augmented Neural ODEscited by 397
- 2020Understanding the Role of Training Regimes in Continual Learningcited by 180
- 2021Overcoming Catastrophic Forgetting in Incremental Few-Shot Learning by Finding Flat Minimacited by 118
- 2019On Robustness of Neural Ordinary Differential Equationscited by 83
- 2019Control in the spaces of ensembles of pointscited by 9
- 2023A minimax optimal control approach for robust neural ODEscited by 4
- 2024Control Theoretic Approach to Fine-Tuning and Transfer Learningcited by 3
- 2025Geometric Foundations of Tuning without Forgetting in Neural ODEscited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Privacy Preserving Gossip Learningcited by 0
- 2026Privacy Preserving Gossip Learning13 Sep 2026