{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T15:28:23Z","timestamp":1751383703146,"version":"3.37.3"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Swedish Research Council International Postdoc","award":["2022-06196","2016-00861","2023-04770"],"award-info":[{"award-number":["2022-06196","2016-00861","2023-04770"]}]},{"name":"SSF"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1109\/tac.2024.3439132","type":"journal-article","created":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T18:36:22Z","timestamp":1722969382000},"page":"159-173","source":"Crossref","is-referenced-by-count":2,"title":["Regret Lower Bounds for Learning Linear Quadratic Gaussian Systems"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4140-1279","authenticated-orcid":false,"given":"Ingvar","family":"Ziemann","sequence":"first","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1835-2963","authenticated-orcid":false,"given":"Henrik","family":"Sandberg","sequence":"additional","affiliation":[{"name":"KTH Royal Institute of Technology, Stockholm, Sweden"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1","article-title":"Data efficient reinforcement learning for legged robots","volume-title":"Proc. Conf. Robot Learn.","author":"Yang","year":"2020"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/nature24270"},{"key":"ref3","first-page":"8937","article-title":"Naive exploration is optimal for online LQR","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Simchowitz","year":"2020"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(86)90004-7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1986.1104138"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0005-1098(94)00127-5"},{"issue":"9","key":"ref8","first-page":"1240","article-title":"Dual control theory. I","volume":"21","author":"Feldbaum","year":"1960","journal-title":"Avtomatika i Telemekhanika"},{"issue":"11","key":"ref9","first-page":"1453","article-title":"Dual control theory. II","volume":"21","author":"Feldbaum","year":"1960","journal-title":"Avtomatika i Telemekhanika"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.2307\/1905261"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0005-1098(73)90073-3"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1115\/1.4012407"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/0319052"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176345697"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1985.1103963"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012997317499"},{"key":"ref17","first-page":"1","article-title":"Regret bounds for the adaptive control of linear quadratic systems","volume-title":"Proc. 24th Annu. Conf. Learn. Theory","author":"Abbasi-Yadkori","year":"2011"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2950156"},{"key":"ref19","first-page":"4188","article-title":"Regret bounds for robust adaptive control of the linear quadratic regulator","volume-title":"Proc. Conf. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Dean","year":"2018"},{"key":"ref20","first-page":"1","article-title":"Improved regret bounds for Thompson sampling in linear quadratic control problems","volume-title":"Proc. Mach. Learn. Res.","volume":"80","author":"Abeille","year":"2018"},{"key":"ref21","first-page":"3108","article-title":"Model-free linear quadratic control via reduction to expert prediction","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist.","author":"Abbasi-Yadkori","year":"2019"},{"key":"ref22","first-page":"10154","article-title":"Certainty equivalence is efficient for linear quadratic control","volume-title":"Adv. Neural Inf. Process. Syst.","volume":"32","author":"Mania","year":"2019"},{"key":"ref23","article-title":"Learning linear-quadratic regulators efficiently with only $\\sqrt{T}$ regret","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Cohen","year":"2019"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2020.108950"},{"key":"ref25","article-title":"Efficient optimistic exploration in linear-quadratic regulators via Lagrangian relaxation","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Abeille","year":"2020"},{"key":"ref26","article-title":"Minimal expected regret in linear quadratic control","volume-title":"Proc. Int. Conf. Artif. Intell.","author":"Jedra","year":"2022"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CDC45484.2021.9682778"},{"key":"ref28","first-page":"3820","article-title":"Learning to control linear systems can be hard","volume-title":"Proc. Conf. Learn. Theory","author":"Tsiamis","year":"2022"},{"key":"ref29","first-page":"3320","article-title":"Improper learning for non-stochastic control","volume-title":"Proc. Conf. Learn. Theory","author":"Simchowitz","year":"2020"},{"key":"ref30","first-page":"20876","article-title":"Logarithmic regret bound in partially observable linear dynamical systems","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Lale","year":"2020"},{"key":"ref31","first-page":"64","article-title":"On optimal algorithms of adaptive control","volume":"12","author":"Nemirovski","year":"1984","journal-title":"Avtomatika i Telemekhanika"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706895"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2018.8431891"},{"key":"ref34","article-title":"Logarithmic regret for learning linear quadratic regulators efficiently","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Cassel","year":"2020"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2020.3005224"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/0005-1098(86)90064-6"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6911(85)90001-5"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6911(86)90065-4"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/S0005-1098(96)80003-3"},{"key":"ref40","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719109","volume-title":"Optimal Design of Experiments","author":"Pukelsheim","year":"2006"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.2307\/1913267"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1979.1101953"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1080\/00207178208932896"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/78.890346"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1002\/0471221082"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176350602"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.2307\/3318681"},{"volume-title":"Asymptotic Statistics","year":"2000","author":"Van der Vaart","key":"ref48"},{"volume-title":"Introduction to Nonparametric Estimation","year":"2008","author":"Tsybakov","key":"ref49"},{"key":"ref50","volume-title":"Statistical Estimation: Asymptotic Theory","volume":"16","author":"Ibragimov","year":"2013"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2018.07.008"},{"key":"ref52","first-page":"439","article-title":"Learning without mixing: Towards a sharp analysis of linear system identification","volume-title":"Proc. Mach. Learn. Res.","volume":"75","author":"Simchowitz","year":"2018"},{"key":"ref53","first-page":"5610","article-title":"Near optimal finite time identification of arbitrary linear dynamical systems","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Sarkar","year":"2019"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/CDC42340.2020.9304362"},{"key":"ref55","article-title":"Task-optimal exploration in linear dynamical systems","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wagenmaker","year":"2021"},{"key":"ref56","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-0101-7","volume-title":"Discrete-Time Stochastic Systems: Estimation and Control","author":"Sderstrm","year":"2002"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/9\/10818614\/10623691.pdf?arnumber=10623691","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T06:19:59Z","timestamp":1735625999000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10623691\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":56,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tac.2024.3439132","relation":{},"ISSN":["0018-9286","1558-2523","2334-3303"],"issn-type":[{"type":"print","value":"0018-9286"},{"type":"electronic","value":"1558-2523"},{"type":"electronic","value":"2334-3303"}],"subject":[],"published":{"date-parts":[[2025,1]]}}}