Certified Neural Approximations of Nonlinear Dynamics
Frederik Baymler Mathiesen, Nikolaus Vertovec, Francesco Fabiano, Luca Laurenti, Alessandro Abate

TL;DR
This paper introduces a novel verification method for neural network approximations of nonlinear dynamical systems, providing formal error bounds to ensure safe application in critical systems, and demonstrating scalability and versatility on various benchmarks.
Contribution
The paper presents a new adaptive, parallelizable verification approach that offers formal error bounds for neural approximations of dynamical systems, enabling their safe use in critical applications.
Findings
Outperforms state-of-the-art verification methods
Successfully addresses neural network compression scenarios
Effectively applies to Koopman operator-based trajectory prediction
Abstract
Neural networks hold great potential to act as approximate models of nonlinear dynamical systems, with the resulting neural approximations enabling verification and control of such systems. However, in safety-critical contexts, the use of neural approximations requires formal bounds on their closeness to the underlying system. To address this fundamental challenge, we propose a novel, adaptive, and parallelizable verification method based on certified first-order models. Our approach provides formal error bounds on the neural approximations of dynamical systems, allowing them to be safely employed as surrogates by interpreting the error bound as bounded disturbances acting on the approximated dynamics. We demonstrate the effectiveness and scalability of our method on a range of established benchmarks from the literature, showing that it significantly outperforms the state-of-the-art.…
Peer Reviews
Decision·Submitted to ICLR 2026
1. Significant Scalability Improvements: The shift from nonlinear SMT solving to utilizing established linear verification tools via local approximations is a pragmatic and impactful contribution. 2. Novel Applications for Verification: The paper moves beyond standard control benchmarks to demonstrate versatility. - Koopman Operators: Verifying trajectory-level predictions by treating the network as a discrete-time abstraction is a compelling use case. - Model Compression: Framing a larg
1. Dependency on Local Linearity (The "Curse of Partitioning"): While avoiding the complexity of nonlinear SMT, the method trades it for potential combinatorial explosion in partitioning. For highly nonlinear functions where the second-order terms (Hessian) are large everywhere, the hyperrectangles must be extremely small to satisfy the error bounds. The current benchmarks may not fully stress-test this worst-case scenario where every dimension is highly coupled and nonlinear. 2. Koopman Verific
The approach is sound and improves on standard techniques such as dReal; to the best of my knowledge, this approach does not appear elsewhere in the literature and results in substantial speedup by converting nonlinear problems to (relaxed) linear ones. The presentation of the paper is easy to follow. The experiments include some nonlinear systems that scale up to seven dimensions, as well as a neural network compression example.
I have some questions regarding the results and contributions of the paper that are listed below.
- The technique is sound in theory.
The paper frames “avoiding SMT over nonlinear reals” as its contrastive novelty and compares to dReal (SMT) as “state of the art”. But modern NN-controlled-system (NNCS) verification frameworks built on Taylor/polynomial models (e.g., Verisig[1], POLAR[2]) already avoid SMT by using TM/polynomial propagation. The paper does not cite or discuss them, and the References section corroborates the omission. This leads to wrong baselining and an incomplete positioning of contributions. I believe the n
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
