{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T06:03:52Z","timestamp":1730268232143,"version":"3.28.0"},"reference-count":38,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T00:00:00Z","timestamp":1684281600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T00:00:00Z","timestamp":1684281600000},"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":[],"published-print":{"date-parts":[[2023,5,17]]},"DOI":"10.1109\/infocom53939.2023.10228879","type":"proceedings-article","created":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T17:40:43Z","timestamp":1693330843000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["A Bayesian Framework for Online Nonconvex Optimization over Distributed Processing Networks"],"prefix":"10.1109","author":[{"given":"Zai","family":"Shi","sequence":"first","affiliation":[{"name":"Alibaba Group,Damo Academy,Hangzhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yilin","family":"Zheng","sequence":"additional","affiliation":[{"name":"The Ohio State University,Electrical and Computer Engineering,Columbus,OH,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atilla","family":"Eryilmaz","sequence":"additional","affiliation":[{"name":"The Ohio State University,Electrical and Computer Engineering,Columbus,OH,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3021011"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"3936","DOI":"10.1109\/TAC.2016.2529285","article-title":"Stochastic gradient-push for strongly convex functions on time-varying directed graphs","volume":"61","author":"nedi?","year":"2016","journal-title":"IEEE Transactions on Automatic Control"},{"journal-title":"Regret bounds for noise-free bayesian optimization","year":"2020","author":"vakili","key":"ref34"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2937496"},{"key":"ref37","first-page":"541","article-title":"To understand deep learning we need to understand kernel learning","author":"belkin","year":"2018","journal-title":"International Conference on Machine Learning"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2015.2505149"},{"key":"ref36","first-page":"370","article-title":"Deep kernel learning","author":"wilson","year":"2016","journal-title":"Artificial Intelligence and Statistics"},{"key":"ref31","article-title":"A tutorial review of rkhs methods in machine learning","author":"hofmann","year":"2005","journal-title":"Technical Report"},{"key":"ref30","first-page":"844","article-title":"On kernelized multi-armed bandits","author":"chowdhury","year":"2017","journal-title":"International Conference on Machine Learning"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2677879"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/060678324"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2304432"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970128"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2417504"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.852876"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2743462"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01487-0"},{"key":"ref38","article-title":"High-dimensional gaussian process bandits","volume":"26","author":"djolonga","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2818081"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2648041"},{"journal-title":"A Tutorial on Bayesian Optimization of Expensive Cost Functions with Application to Active User Modeling and Hierarchical Reinforcement Learning","year":"2010","author":"brochu","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155520"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1201\/b11038"},{"key":"ref25","first-page":"63","article-title":"Gaussian processes in machine learning","author":"rasmussen","year":"2003","journal-title":"Machine Learning Summer School"},{"key":"ref20","first-page":"2009","article-title":"Gradient primal-dual algorithm converges to second-order stationary solution for nonconvex distributed optimization over networks","author":"hong","year":"2018","journal-title":"International Conference on Machine Learning"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619044"},{"key":"ref21","article-title":"Distributed randomized gradient-free mirror descent algorithm for constrained optimization","author":"yu","year":"2021","journal-title":"IEEE Transactions on Automatic Control"},{"key":"ref28","article-title":"Convergence rates of efficient global optimization algorithms","volume":"12","author":"bull","year":"2011","journal-title":"Journal of Machine Learning Research"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.jspi.2010.04.018"},{"journal-title":"Gaussian Process Optimization in the Bandit Setting No Regret and Experimental Design","year":"2009","author":"srinivas","key":"ref29"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2161027"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1986.1104412"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2013.6760092"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2896025"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1214\/17-AOS1637"},{"key":"ref6","article-title":"Linear convergence of first-and zeroth-order primal-dual algorithms for distributed nonconvex optimization","author":"yi","year":"2021","journal-title":"IEEE Transactions on Automatic Control"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2020.3024321"}],"event":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications","start":{"date-parts":[[2023,5,17]]},"location":"New York City, NY, USA","end":{"date-parts":[[2023,5,20]]}},"container-title":["IEEE INFOCOM 2023 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10228851\/10228852\/10228879.pdf?arnumber=10228879","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T17:44:37Z","timestamp":1695059077000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10228879\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,17]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/infocom53939.2023.10228879","relation":{},"subject":[],"published":{"date-parts":[[2023,5,17]]}}}