安全学习动态系统

IF 2.5 1区 数学 Q2 COMPUTER SCIENCE, THEORY & METHODS
Amir Ali Ahmadi, Abraar Chaudhry, Vikas Sindhwani, Stephen Tu
{"title":"安全学习动态系统","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":"{\"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}","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

摘要

学习未知动力系统的一个基本挑战是在保持安全的情况下通过测量来减少模型的不确定性。在这项工作中,我们通过顺序决定初始化下一个轨迹的位置来制定安全学习动力系统的数学定义。在我们的框架中,在所有动力系统的作用下(i)属于给定的初始不确定性集,(ii)与迄今为止收集的信息一致的情况下,系统的状态需要在T个时间步长的视界内保持在安全区域内。对于我们的第一组结果,我们考虑安全学习涉及n个状态的线性动力系统的设置。对于\(T=1\),我们提出了一种基于线性规划的算法,该算法可以安全地从最多n个轨迹中恢复真实动态,或者证明安全学习是不可能的。对于\(T=2\),我们给出了一组安全初始条件的半确定表示,并表明\(\lceil n/2 \rceil \)轨迹一般足以满足安全学习。对于\(T = \infty \),我们提供了一组安全初始条件的半确定可表示的内部近似,并表明一个轨迹一般足以满足安全学习。最后,我们将我们的一些结果扩展到初始不确定性集包含稀疏,低秩或排列矩阵的情况下,或者当动力系统涉及控制输入时。我们的第二组结果涉及安全学习一类一般非线性动力系统的问题。对于\(T=1\)情况,我们给出了安全初始条件集合的二阶锥规划表示。对于\(T=\infty \),我们提供了安全初始条件集合的半定可表示内逼近。我们展示了如何安全地收集轨迹并拟合非线性动力学的多项式模型,该模型与初始不确定性集一致,并与观测结果最一致。我们还将我们的一些结果扩展到测量有噪声或动力系统包含扰动的情况。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Safely Learning Dynamical Systems

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.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信