{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:55:54Z","timestamp":1740178554690,"version":"3.37.3"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Control Syst. Lett."],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/lcsys.2023.3289154","type":"journal-article","created":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T06:17:47Z","timestamp":1687587467000},"page":"1-1","source":"Crossref","is-referenced-by-count":1,"title":["Zeroth-Order Non-Convex Optimization for Cooperative Multi-Agent Systems with Diminishing Step Size and Smoothing Radius"],"prefix":"10.1109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0595-2284","authenticated-orcid":false,"given":"Xinran","family":"Zheng","sequence":"first","affiliation":[{"name":"Electrical and Computer Engineering Department, University of California, San Diego, California"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7112-1043","authenticated-orcid":false,"given":"Tara","family":"Javidi","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering Department, University of California, San Diego, California"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4724-7329","authenticated-orcid":false,"given":"Behrouz","family":"Touri","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering Department, University of California, San Diego, California"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2022.110741"},{"key":"ref24","article-title":"DIMIX: Diminishing mixing for sloppy agents","author":"reisizadeh","year":"2022","journal-title":"arXiv 2204 10974"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CDC42340.2020.9304302"},{"key":"ref23","volume":"40","author":"folland","year":"1999","journal-title":"Real Analysis Modern Techniques and Their Applications"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CDC51059.2022.9992950"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CDC45484.2021.9683470"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/9781108591034"},{"key":"ref11","article-title":"Online convex optimization in the bandit setting: Gradient descent without a gradient","author":"flaxman","year":"2004","journal-title":"arXiv cs\/0408007"},{"journal-title":"Elementary Calculus An infinitesimal approach","year":"2013","author":"keisler","key":"ref22"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9296-2"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TW.2013.072313.120739"},{"key":"ref1","first-page":"2681","article-title":"Deep decentralized multi-task multi-agent reinforcement learning under partial observability","author":"omidshafiei","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.3003837"},{"key":"ref16","first-page":"5666","article-title":"Bandit learning in concave N-person games","volume":"31","author":"bravo","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"journal-title":"Linear Algebra and its Applications","year":"2006","author":"strang","key":"ref19"},{"key":"ref18","first-page":"2916","article-title":"Derivative-free methods for policy optimization: Guarantees for linear quadratic systems","author":"malik","year":"2019","journal-title":"Proc 22nd Int Conf Artif Intell Stat"},{"key":"ref8","first-page":"4420","article-title":"Distributed optimization over time-varying graphs with imperfect sharing of information","volume":"68","author":"reisizadeh","year":"2023","journal-title":"IEEE Trans Autom Control"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2818081"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729392"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2013.2257780"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2648041"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"}],"container-title":["IEEE Control Systems Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7782633\/7912304\/10160147.pdf?arnumber=10160147","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T21:46:11Z","timestamp":1689284771000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10160147\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/lcsys.2023.3289154","relation":{},"ISSN":["2475-1456"],"issn-type":[{"type":"electronic","value":"2475-1456"}],"subject":[],"published":{"date-parts":[[2023]]}}}