Safely Learning Dynamical Systems.
Saved in:
| Title: | Safely Learning Dynamical Systems. |
|---|---|
| Authors: | Ahmadi, Amir Ali1 (AUTHOR) aaa@princeton.edu, Chaudhry, Abraar2 (AUTHOR) achaudhry61@gatech.edu, Sindhwani, Vikas3 (AUTHOR) sindhwani@google.com, Tu, Stephen3 (AUTHOR) stephentu@google.com |
| Source: | Foundations of Computational Mathematics. Apr2026, Vol. 26 Issue 2, p999-1068. 70p. |
| Subjects: | Dynamical systems, Semidefinite programming, Uncertain systems, Mathematical optimization, Nonlinear mechanics, Linear programming, Feedback control systems |
| Abstract: | A fundamental challenge in learning an unknown dynamical system is to reduce model uncertainty by making measurements while maintaining safety. In this work, we formulate a mathematical definition of what it means to safely learn a dynamical system by sequentially deciding where to initialize the next trajectory. In our framework, the state of the system is required to stay within a safety region for a horizon of T time steps under the action of all dynamical systems that (i) belong to a given initial uncertainty set, and (ii) are consistent with the information gathered so far. For our first set of results, we consider the setting of safely learning a linear dynamical system involving n states. For the case T = 1 , we present a linear programming-based algorithm that either safely recovers the true dynamics from at most n trajectories, or certifies that safe learning is impossible. For T = 2 , we give a semidefinite representation of the set of safe initial conditions and show that ⌈ n / 2 ⌉ trajectories generically suffice for safe learning. For T = ∞ , we provide semidefinite representable inner approximations of the set of safe initial conditions and show that one trajectory generically suffices for safe learning. Finally, we extend a number of our results to the cases where the initial uncertainty set contains sparse, low-rank, or permutation matrices, or when the dynamical system involves a control input. Our second set of results concerns the problem of safely learning a general class of nonlinear dynamical systems. For the case T = 1 , we give a second-order cone programming based representation of the set of safe initial conditions. For T = ∞ , we provide semidefinite representable inner approximations to the set of safe initial conditions. We show how one can safely collect trajectories and fit a polynomial model of the nonlinear dynamics that is consistent with the initial uncertainty set and best agrees with the observations. We also present extensions of some of our results to the cases where the measurements are noisy or the dynamical system involves disturbances. [ABSTRACT FROM AUTHOR] |
| Copyright of Foundations of Computational Mathematics is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | A fundamental challenge in learning an unknown dynamical system is to reduce model uncertainty by making measurements while maintaining safety. In this work, we formulate a mathematical definition of what it means to safely learn a dynamical system by sequentially deciding where to initialize the next trajectory. In our framework, the state of the system is required to stay within a safety region for a horizon of T time steps under the action of all dynamical systems that (i) belong to a given initial uncertainty set, and (ii) are consistent with the information gathered so far. For our first set of results, we consider the setting of safely learning a linear dynamical system involving n states. For the case T = 1 , we present a linear programming-based algorithm that either safely recovers the true dynamics from at most n trajectories, or certifies that safe learning is impossible. For T = 2 , we give a semidefinite representation of the set of safe initial conditions and show that ⌈ n / 2 ⌉ trajectories generically suffice for safe learning. For T = ∞ , we provide semidefinite representable inner approximations of the set of safe initial conditions and show that one trajectory generically suffices for safe learning. Finally, we extend a number of our results to the cases where the initial uncertainty set contains sparse, low-rank, or permutation matrices, or when the dynamical system involves a control input. Our second set of results concerns the problem of safely learning a general class of nonlinear dynamical systems. For the case T = 1 , we give a second-order cone programming based representation of the set of safe initial conditions. For T = ∞ , we provide semidefinite representable inner approximations to the set of safe initial conditions. We show how one can safely collect trajectories and fit a polynomial model of the nonlinear dynamics that is consistent with the initial uncertainty set and best agrees with the observations. We also present extensions of some of our results to the cases where the measurements are noisy or the dynamical system involves disturbances. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 16153375 |
| DOI: | 10.1007/s10208-025-09689-8 |
