BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20260624T013516EDT-7026b7enOK@132.216.98.100
DTSTAMP:20260624T053516Z
DESCRIPTION:Informal Systems Seminar ISS\, Centre for Intelligent Machines 
 (CIM) and Groupe d'Etudes et de Recherche en Analyse des Decisions (GERAD)
 \n	\n	Speaker: Borna Sayedana\n	\n	Zoom Link\n	Meeting ID: 845 1388 1004       
 \n	Passcode: VISS\n\n\n	** Note that this is a hybrid event.\n	** Note that h
 is event does not take place at the usual time of ISS events\n	\n	Abstract: 
 In this talk\, we consider the learning and control problem for unknown Ma
 rkov jump linear systems (MJLS) with perfect state observations. We propos
 e a certainty equivalence-based learning algorithm and show that this algo
 rithm achieves a regret of O(\sqrt{T} log(T)) relative to a certain subset
  of the sample space. As part of our analysis\, we propose a switched leas
 t squares method for the identification of MJLS\, show that this method is
  strongly consistent\, and derive data-dependent and data-independent rate
 s of convergence. These results show that certainty equivalence control al
 ong with the switched least squares method for MJLS has the same rate of c
 onvergence as the certainty equivalence control method for linear systems.
 \n	\n	Affiliation: Borna Sayedana is a PhD candidate in the Department of El
 ectrical and Computer Engineering\, ɬÀï·¬.\n
DTSTART:20240424T180000Z
DTEND:20240424T190000Z
LOCATION:Zames Seminar Room\, MC 437\, McConnell Engineering Building\, CA\
 , QC\, Montreal\, H3A 0E9\, 3480 rue University
SUMMARY:Relative Almost Sure Regret Bounds for Certainty Equivalence Contro
 l of Markov Jump Systems
URL:/cim/channels/event/relative-almost-sure-regret-bo
 unds-certainty-equivalence-control-markov-jump-systems-356913
END:VEVENT
END:VCALENDAR