Safely Learning Dynamical Systems

IF 2.5 1区 数学 Q2 COMPUTER SCIENCE, THEORY & METHODS Foundations of Computational Mathematics Pub Date : 2025-02-04 DOI:10.1007/s10208-025-09689-8
Amir Ali Ahmadi, Abraar Chaudhry, Vikas Sindhwani, Stephen Tu
{"title":"Safely Learning Dynamical Systems","authors":"Amir Ali Ahmadi, Abraar Chaudhry, Vikas Sindhwani, Stephen Tu","doi":"10.1007/s10208-025-09689-8","DOIUrl":null,"url":null,"abstract":"<p>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 <i>T</i> 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 <i>n</i> states. For the case <span>\\(T=1\\)</span>, we present a linear programming-based algorithm that either safely recovers the true dynamics from at most <i>n</i> trajectories, or certifies that safe learning is impossible. For <span>\\(T=2\\)</span>, we give a semidefinite representation of the set of safe initial conditions and show that <span>\\(\\lceil n/2 \\rceil \\)</span> trajectories generically suffice for safe learning. For <span>\\(T = \\infty \\)</span>, 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 <span>\\(T=1\\)</span>, we give a second-order cone programming based representation of the set of safe initial conditions. For <span>\\(T=\\infty \\)</span>, 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.</p>","PeriodicalId":55151,"journal":{"name":"Foundations of Computational Mathematics","volume":"28 1","pages":""},"PeriodicalIF":2.5000,"publicationDate":"2025-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Foundations of Computational Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10208-025-09689-8","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

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 \(\lceil n/2 \rceil \) trajectories generically suffice for safe learning. For \(T = \infty \), 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=\infty \), 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.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
Foundations of Computational Mathematics
Foundations of Computational Mathematics 数学-计算机:理论方法
CiteScore
6.90
自引率
3.30%
发文量
46
审稿时长
>12 weeks
期刊介绍: Foundations of Computational Mathematics (FoCM) will publish research and survey papers of the highest quality which further the understanding of the connections between mathematics and computation. The journal aims to promote the exploration of all fundamental issues underlying the creative tension among mathematics, computer science and application areas unencumbered by any external criteria such as the pressure for applications. The journal will thus serve an increasingly important and applicable area of mathematics. The journal hopes to further the understanding of the deep relationships between mathematical theory: analysis, topology, geometry and algebra, and the computational processes as they are evolving in tandem with the modern computer. With its distinguished editorial board selecting papers of the highest quality and interest from the international community, FoCM hopes to influence both mathematics and computation. Relevance to applications will not constitute a requirement for the publication of articles. The journal does not accept code for review however authors who have code/data related to the submission should include a weblink to the repository where the data/code is stored.
期刊最新文献
Safely Learning Dynamical Systems Stabilizing Decomposition of Multiparameter Persistence Modules Optimal Regularization for a Data Source Sharp Bounds for Max-sliced Wasserstein Distances Optimal Convergence Rates for the Spectrum of the Graph Laplacian on Poisson Point Clouds
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1