{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T15:33:15Z","timestamp":1783438395801,"version":"3.54.6"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["#FA9550-19-1-0169"],"award-info":[{"award-number":["#FA9550-19-1-0169"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF","award":["CNS-1932011"],"award-info":[{"award-number":["CNS-1932011"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1109\/tac.2024.3382358","type":"journal-article","created":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T19:12:15Z","timestamp":1711653135000},"page":"6309-6316","source":"Crossref","is-referenced-by-count":9,"title":["Boosting One-Point Derivative-Free Online Optimization via Residual Feedback"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4882-9857","authenticated-orcid":false,"given":"Yan","family":"Zhang","sequence":"first","affiliation":[{"name":"Department of Mechanical Engineering and Material Science, Duke University, Durham, NC, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3982-9145","authenticated-orcid":false,"given":"Yi","family":"Zhou","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, The University of Utah, Salt Lake City, UT, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9533-0058","authenticated-orcid":false,"given":"Kaiyi","family":"Ji","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9184-4505","authenticated-orcid":false,"given":"Yi","family":"Shen","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering and Material Science, Duke University, Durham, NC, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1748-8228","authenticated-orcid":false,"given":"Michael M.","family":"Zavlanos","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering and Material Science, Duke University, Durham, NC, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3128572.3140448"},{"key":"ref2","first-page":"1467","article-title":"Global convergence of policy gradient methods for the linear quadratic regulator","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Fazel","year":"2018"},{"key":"ref3","first-page":"2916","article-title":"Derivative-free methods for policy optimization: Guarantees for linear quadratic systems","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist. PMLR,","author":"Malik","year":"2019"},{"key":"ref4","first-page":"28","article-title":"Optimal algorithms for online convex optimization with multi-point bandit feedback","volume-title":"Proc. Annu. Conf. Learn. Theory","author":"Agarwal","year":"2010"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/120880811"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2409256"},{"key":"ref7","first-page":"257","article-title":"Highly-smooth zero-th order online optimization","volume-title":"Proc. Conf. Learn. Theory","author":"Bach","year":"2016"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9296-2"},{"key":"ref9","first-page":"235","article-title":"Online learning with non-convex losses and non-stationary regret","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Gao","year":"2018"},{"issue":"64","key":"ref10","first-page":"1","article-title":"Stochastic zeroth-order optimization under nonstationarity and nonconvexity","volume":"23","author":"Roy","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2968813"},{"key":"ref12","first-page":"385","article-title":"Online convex optimization in the bandit setting: Gradient descent without a gradient","volume-title":"Proc. 17th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Flaxman","year":"2005"},{"key":"ref13","first-page":"636","article-title":"Improved regret guarantees for online smooth convex optimization with bandit feedback","volume-title":"Proc. 14th Int. Conf. Artif. Intell. Statist.","author":"Saha","year":"2011"},{"key":"ref14","first-page":"2926","article-title":"Bandit smooth convex optimization: Improving the bias-variance tradeoff","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Dekel","year":"2015"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1134\/S0005117917020035"},{"key":"ref16","first-page":"1833","article-title":"On graduated optimization for stochastic non-convex problems","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Hazan","year":"2016"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2019.2921593"},{"key":"ref18","first-page":"3455","article-title":"Zeroth-order (non)-convex stochastic optimization via conditional gradient and gradient updates","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Balasubramanian","year":"2018"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/19M1259225"},{"key":"ref20","first-page":"3100","article-title":"Improved zeroth-order variance reduced algorithms and analysis for nonconvex optimization","volume-title":"Proc. Int. Conf. Mach. Learn. PMLR","author":"Ji","year":"2019"},{"key":"ref21","first-page":"1356","article-title":"Stochastic zeroth-order optimization in high dimensions","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Wang","year":"2018"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619333"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919690"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9589"},{"key":"ref25","first-page":"1035","article-title":"Stochastic convex optimization with bandit feedback","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Agarwal","year":"2011"},{"key":"ref26","article-title":"An optimal algorithm for bandit convex optimization","author":"Hazan","year":"2016"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055403"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2021.110006"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3029983"},{"key":"ref30","article-title":"Boosting one-point derivative-free online optimization via residual feedback","author":"Zhang","year":"2020"},{"key":"ref31","first-page":"12510","article-title":"Dynamic regret of convex and smooth functions","volume-title":"proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Zhao","year":"2020"},{"key":"ref32","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","volume":"87","author":"Nesterov","year":"2013"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/9\/10654305\/10480627-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/10654305\/10480627.pdf?arnumber=10480627","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T03:29:32Z","timestamp":1736134172000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10480627\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9]]},"references-count":32,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tac.2024.3382358","relation":{},"ISSN":["0018-9286","1558-2523","2334-3303"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"},{"value":"2334-3303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9]]}}}