Safely Learning Dynamical Systems from Short Trajectories
A fundamental challenge in learning to control 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 initia...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2020-11 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Amir Ali Ahmadi Chaudhry, Abraar Sindhwani, Vikas Tu, Stephen |
description | A fundamental challenge in learning to control 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 given safety region under the (possibly repeated) action of all dynamical systems that are consistent with the information gathered so far. For our first two results, we consider the setting of safely learning linear dynamics. We present a linear programming-based algorithm that either safely recovers the true dynamics from trajectories of length one, or certifies that safe learning is impossible. We also give an efficient semidefinite representation of the set of initial conditions whose resulting trajectories of length two are guaranteed to stay in the safety region. For our final result, we study the problem of safely learning a nonlinear dynamical system. We give a second-order cone programming based representation of the set of initial conditions that are guaranteed to remain in the safety region after one application of the system dynamics. |
format | Article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2464268780</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2464268780</sourcerecordid><originalsourceid>FETCH-proquest_journals_24642687803</originalsourceid><addsrcrecordid>eNqNyrsKwjAUgOEgCBbtOwScC_Gklzh7wcGt3Usop9rQJnpOOvTtdfABnP7h-1ciAa0PmckBNiJldkopKCsoCp2IY217HBd5R0t-8A95Xrydhs6Osl444sSypzDJ-hkoyoaswy4GGpB3Yt3bkTH9dSv210tzumUvCu8ZObYuzOS_1EJe5lCayij93_UBkfE2rQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2464268780</pqid></control><display><type>article</type><title>Safely Learning Dynamical Systems from Short Trajectories</title><source>Free E- Journals</source><creator>Amir Ali Ahmadi ; Chaudhry, Abraar ; Sindhwani, Vikas ; Tu, Stephen</creator><creatorcontrib>Amir Ali Ahmadi ; Chaudhry, Abraar ; Sindhwani, Vikas ; Tu, Stephen</creatorcontrib><description>A fundamental challenge in learning to control 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 given safety region under the (possibly repeated) action of all dynamical systems that are consistent with the information gathered so far. For our first two results, we consider the setting of safely learning linear dynamics. We present a linear programming-based algorithm that either safely recovers the true dynamics from trajectories of length one, or certifies that safe learning is impossible. We also give an efficient semidefinite representation of the set of initial conditions whose resulting trajectories of length two are guaranteed to stay in the safety region. For our final result, we study the problem of safely learning a nonlinear dynamical system. We give a second-order cone programming based representation of the set of initial conditions that are guaranteed to remain in the safety region after one application of the system dynamics.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Dynamical systems ; Initial conditions ; Linear programming ; Machine learning ; Representations ; Safety ; System dynamics</subject><ispartof>arXiv.org, 2020-11</ispartof><rights>2020. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>777,781</link.rule.ids></links><search><creatorcontrib>Amir Ali Ahmadi</creatorcontrib><creatorcontrib>Chaudhry, Abraar</creatorcontrib><creatorcontrib>Sindhwani, Vikas</creatorcontrib><creatorcontrib>Tu, Stephen</creatorcontrib><title>Safely Learning Dynamical Systems from Short Trajectories</title><title>arXiv.org</title><description>A fundamental challenge in learning to control 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 given safety region under the (possibly repeated) action of all dynamical systems that are consistent with the information gathered so far. For our first two results, we consider the setting of safely learning linear dynamics. We present a linear programming-based algorithm that either safely recovers the true dynamics from trajectories of length one, or certifies that safe learning is impossible. We also give an efficient semidefinite representation of the set of initial conditions whose resulting trajectories of length two are guaranteed to stay in the safety region. For our final result, we study the problem of safely learning a nonlinear dynamical system. We give a second-order cone programming based representation of the set of initial conditions that are guaranteed to remain in the safety region after one application of the system dynamics.</description><subject>Algorithms</subject><subject>Dynamical systems</subject><subject>Initial conditions</subject><subject>Linear programming</subject><subject>Machine learning</subject><subject>Representations</subject><subject>Safety</subject><subject>System dynamics</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqNyrsKwjAUgOEgCBbtOwScC_Gklzh7wcGt3Usop9rQJnpOOvTtdfABnP7h-1ciAa0PmckBNiJldkopKCsoCp2IY217HBd5R0t-8A95Xrydhs6Osl444sSypzDJ-hkoyoaswy4GGpB3Yt3bkTH9dSv210tzumUvCu8ZObYuzOS_1EJe5lCayij93_UBkfE2rQ</recordid><startdate>20201124</startdate><enddate>20201124</enddate><creator>Amir Ali Ahmadi</creator><creator>Chaudhry, Abraar</creator><creator>Sindhwani, Vikas</creator><creator>Tu, Stephen</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20201124</creationdate><title>Safely Learning Dynamical Systems from Short Trajectories</title><author>Amir Ali Ahmadi ; Chaudhry, Abraar ; Sindhwani, Vikas ; Tu, Stephen</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_24642687803</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Dynamical systems</topic><topic>Initial conditions</topic><topic>Linear programming</topic><topic>Machine learning</topic><topic>Representations</topic><topic>Safety</topic><topic>System dynamics</topic><toplevel>online_resources</toplevel><creatorcontrib>Amir Ali Ahmadi</creatorcontrib><creatorcontrib>Chaudhry, Abraar</creatorcontrib><creatorcontrib>Sindhwani, Vikas</creatorcontrib><creatorcontrib>Tu, Stephen</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Amir Ali Ahmadi</au><au>Chaudhry, Abraar</au><au>Sindhwani, Vikas</au><au>Tu, Stephen</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Safely Learning Dynamical Systems from Short Trajectories</atitle><jtitle>arXiv.org</jtitle><date>2020-11-24</date><risdate>2020</risdate><eissn>2331-8422</eissn><abstract>A fundamental challenge in learning to control 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 given safety region under the (possibly repeated) action of all dynamical systems that are consistent with the information gathered so far. For our first two results, we consider the setting of safely learning linear dynamics. We present a linear programming-based algorithm that either safely recovers the true dynamics from trajectories of length one, or certifies that safe learning is impossible. We also give an efficient semidefinite representation of the set of initial conditions whose resulting trajectories of length two are guaranteed to stay in the safety region. For our final result, we study the problem of safely learning a nonlinear dynamical system. We give a second-order cone programming based representation of the set of initial conditions that are guaranteed to remain in the safety region after one application of the system dynamics.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2020-11 |
issn | 2331-8422 |
language | eng |
recordid | cdi_proquest_journals_2464268780 |
source | Free E- Journals |
subjects | Algorithms Dynamical systems Initial conditions Linear programming Machine learning Representations Safety System dynamics |
title | Safely Learning Dynamical Systems from Short Trajectories |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T23%3A33%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Safely%20Learning%20Dynamical%20Systems%20from%20Short%20Trajectories&rft.jtitle=arXiv.org&rft.au=Amir%20Ali%20Ahmadi&rft.date=2020-11-24&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2464268780%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2464268780&rft_id=info:pmid/&rfr_iscdi=true |