{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T13:02:27Z","timestamp":1763643747316,"version":"3.37.3"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,12,6]],"date-time":"2022-12-06T00:00:00Z","timestamp":1670284800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,6]],"date-time":"2022-12-06T00:00:00Z","timestamp":1670284800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,12,6]]},"DOI":"10.1109\/cdc51059.2022.9992353","type":"proceedings-article","created":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T19:26:56Z","timestamp":1673378816000},"page":"2393-2398","source":"Crossref","is-referenced-by-count":1,"title":["Asynchronous Bayesian Learning over a Network"],"prefix":"10.1109","author":[{"given":"Kinjal","family":"Bhar","sequence":"first","affiliation":[{"name":"Oklahoma State University,Stillwater,OK,USA,74078"}]},{"given":"He","family":"Bai","sequence":"additional","affiliation":[{"name":"Oklahoma State University,Stillwater,OK,USA,74078"}]},{"given":"Jemin","family":"George","sequence":"additional","affiliation":[{"name":"U.S. Army Research Laboratory,Adelphi,MD,USA,20783"}]},{"given":"Carl","family":"Busart","sequence":"additional","affiliation":[{"name":"U.S. Army Research Laboratory,Adelphi,MD,USA,20783"}]}],"member":"263","reference":[{"key":"ref1","first-page":"678","article-title":"Further and stronger analogy between sampling and optimization: Langevin monte carlo and gradient descent","volume-title":"Conference on Learning Theory","author":"Dalalyan"},{"key":"ref2","first-page":"300","article-title":"Underdamped langevin mcmc: A non-asymptotic analysis","volume-title":"Conference on learning theory","author":"Cheng"},{"key":"ref3","first-page":"186","article-title":"Convergence of langevin mcmc in kldivergence","volume-title":"Algorithmic Learning Theory","author":"Cheng"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.3150\/18-BEJ1073"},{"key":"ref5","first-page":"1674","article-title":"Non-convex learning via stochastic gradient langevin dynamics: a nonasymptotic analysis","volume-title":"Conference on Learning Theory","author":"Raginsky"},{"key":"ref6","article-title":"Global convergence of langevin dynamics based algorithms for nonconvex optimization","volume":"31","author":"Xu","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00245-022-09932-6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/20M1355392"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3150\/21-bej1343"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1214\/19-AAP1535"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1820003116"},{"article-title":"Sharp convergence rates for langevin dynamics in the nonconvex setting","year":"2018","author":"Cheng","key":"ref12"},{"key":"ref13","first-page":"15978","article-title":"Decentralized langevin dynamics for bayesian learning","volume":"33","author":"Parayil","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-023-06345-6"},{"article-title":"Decentralized langevin dynamics over a directed graph","year":"2021","author":"Kolesov","key":"ref15"},{"issue":"239","key":"ref16","first-page":"1","article-title":"Decentralized stochastic gradient langevin dynamics and hamiltonian monte carlo","volume":"22","author":"G\u00fcrb\u00fczbalaban","year":"2021","journal-title":"Journal of Machine Learning Research"},{"article-title":"Bayesian federated learning over wireless networks","year":"2020","author":"Lee","key":"ref17"},{"key":"ref18","first-page":"1703","article-title":"Federated stochastic gradient langevin dynamics","volume-title":"Uncertainty in Artificial Intelligence","author":"El Mekkaoui"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498447"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2009.5399485"},{"key":"ref21","first-page":"2093","article-title":"Sampling as optimization in the space of measures: The langevin dynamics as a composite optimization problem","volume-title":"Conference on Learning Theory","author":"Wibisono"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2079650"},{"key":"ref23","first-page":"681","article-title":"Bayesian learning via stochastic gradient langevin dynamics","volume-title":"Proceedings of the 28th international conference on machine learning (ICML-11)","author":"Welling"},{"article-title":"Ecdf-based distance measure algorithms","year":"2020","author":"Aslansefat","key":"ref24"}],"event":{"name":"2022 IEEE 61st Conference on Decision and Control (CDC)","start":{"date-parts":[[2022,12,6]]},"location":"Cancun, Mexico","end":{"date-parts":[[2022,12,9]]}},"container-title":["2022 IEEE 61st Conference on Decision and Control (CDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9992315\/9992317\/09992353.pdf?arnumber=9992353","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T02:14:15Z","timestamp":1710382455000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9992353\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,6]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/cdc51059.2022.9992353","relation":{},"subject":[],"published":{"date-parts":[[2022,12,6]]}}}