<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/xsl'?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T09:25:29Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/110451" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/110451</identifier><datestamp>2026-05-15T19:40:41Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Ray, Ritabrata</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair">Tong, Lang</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Zhao, Qing</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2021-12-20T20:34:36Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2021-12-20T20:34:36Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2021-08</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Submission ID: 11299</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Publication ID: 28713620</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/110451</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="doi">https://doi.org/10.7298/b0s8-jb09</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">15160130</dim:field>
   <dim:field mdschema="dc" element="description">37 pages</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">We study the online learning of Markovian Jump Linear Dynamical Systems. These are linear dynamical systems having several  Markov modes with each mode represented by a pair of state dynamics matrices.  The system’s mode switches with time according to an underlying Markov Chain.  We focus on the problem of LQR control for such Markovian Jump Linear Dynamical Systems where the matrices governing the state transitions and the Markov Chain’s state transition probabilities are unknown but the number of modes of the system is known. In this setting, we propose an online learning algorithm which is expected to suffer a sublinear (on the time horizon length) regret when compared against the optimal control of the system in expectation.  Where, in the optimal control setting, the system's parameters and the Markov Chain are known.  We perform numerical simulations of this proposed algorithm learning a two-dimensional state space and control space with two modes and a simple Markov Chain between the two modes. Then we compare this algorithm against the known optimal solution of our system and expect to observe a sublinear regret.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="rights">Attribution-NonCommercial 4.0 International</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri">https://creativecommons.org/licenses/by-nc/4.0/</dim:field>
   <dim:field mdschema="dc" element="subject">LQR control</dim:field>
   <dim:field mdschema="dc" element="subject">Online Learning</dim:field>
   <dim:field mdschema="dc" element="subject">Optimal Control</dim:field>
   <dim:field mdschema="dc" element="subject">Regret analysis</dim:field>
   <dim:field mdschema="dc" element="subject">Reinforcement Learning</dim:field>
   <dim:field mdschema="dc" element="subject">Upper Confidence Bound</dim:field>
   <dim:field mdschema="dc" element="title">ONLINE LEARNING OF MARKOV JUMP DYNAMIC SYSTEMS</dim:field>
   <dim:field mdschema="dc" element="type">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="relation" qualifier="localuri">https://newcatalog.library.cornell.edu/catalog/15160130</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="grantor">Cornell University</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Master of Science</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">M.S., Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="dcterms" element="license">https://hdl.handle.net/1813/59810</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">Ray, Ritabrata</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="91704db5-fa7f-4db7-be47-3198bd163aa3">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en&lt;/Language>
   	&lt;Title>ONLINE LEARNING OF MARKOV JUMP DYNAMIC SYSTEMS&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2021-08&lt;/PublicationDate>
   	&lt;DOI>https://doi.org/10.7298/b0s8-jb09&lt;/DOI>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Ray, Ritabrata&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>https://creativecommons.org/licenses/by-nc/4.0/&lt;/License>
    &lt;Keyword>LQR control&lt;/Keyword>
    &lt;Keyword>Online Learning&lt;/Keyword>
    &lt;Keyword>Optimal Control&lt;/Keyword>
    &lt;Keyword>Regret analysis&lt;/Keyword>
    &lt;Keyword>Reinforcement Learning&lt;/Keyword>
    &lt;Keyword>Upper Confidence Bound&lt;/Keyword>
   	&lt;Abstract>We study the online learning of Markovian Jump Linear Dynamical Systems. These are linear dynamical systems having several  Markov modes with each mode represented by a pair of state dynamics matrices.  The system’s mode switches with time according to an underlying Markov Chain.  We focus on the problem of LQR control for such Markovian Jump Linear Dynamical Systems where the matrices governing the state transitions and the Markov Chain’s state transition probabilities are unknown but the number of modes of the system is known. In this setting, we propose an online learning algorithm which is expected to suffer a sublinear (on the time horizon length) regret when compared against the optimal control of the system in expectation.  Where, in the optimal control setting, the system&amp;apos;s parameters and the Markov Chain are known.  We perform numerical simulations of this proposed algorithm learning a two-dimensional state space and control space with two modes and a simple Markov Chain between the two modes. Then we compare this algorithm against the known optimal solution of our system and expect to observe a sublinear regret.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>