{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T13:48:43Z","timestamp":1768744123667,"version":"3.49.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"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":[[2020,5]]},"DOI":"10.1109\/icassp40776.2020.9054279","type":"proceedings-article","created":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T20:21:13Z","timestamp":1586463673000},"page":"8594-8598","source":"Crossref","is-referenced-by-count":5,"title":["On Distributed Stochastic Gradient Algorithms for Global Optimization"],"prefix":"10.1109","author":[{"given":"Brian","family":"Swenson","sequence":"first","affiliation":[]},{"given":"Anirudh","family":"Sridhar","sequence":"additional","affiliation":[]},{"given":"H. Vincent","family":"Poor","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2016.7869154"},{"key":"ref11","first-page":"4134","article-title":"Pa-gd: On the convergence of perturbed alternating gradient descent to second-order stationary points for structured nonconvex optimization","author":"lu","year":"2019","journal-title":"Proceedings of International Conference on Machine Learning"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2648041"},{"key":"ref13","first-page":"681","article-title":"Bayesian learning via stochastic gradient Langevin dynamics","author":"welling","year":"2011","journal-title":"Proceedings of the International Conference on Machine Learning"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.1985.268602"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/0325042"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/0329055"},{"key":"ref17","first-page":"1980","article-title":"A hitting time analysis of stochastic gradient Langevin dynamics","author":"zhang","year":"2017","journal-title":"Proc Conf Learn Theory"},{"key":"ref18","first-page":"857","article-title":"Local optimality and generalization guarantees for the Langevin algorithm via empirical metastability","author":"tzen","year":"2018","journal-title":"Proc Conf Learn Theory"},{"key":"ref19","article-title":"Breaking reversibility accelerates Langevin dynamics for global non-convex optimization","author":"gao","year":"2018","journal-title":"arXiv preprint arXiv 1812 02588"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2914998"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984626"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1255-7"},{"key":"ref5","first-page":"1246","article-title":"Gradient descent only converges to minimizers","author":"lee","year":"2016","journal-title":"Proc Conf Learn Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2012.2209984"},{"key":"ref7","first-page":"2933","article-title":"Identifying and attacking the saddle point problem in high-dimensional nonconvex optimization","author":"dauphin","year":"2014","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2016.2524588"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919658"},{"key":"ref20","first-page":"1674","article-title":"Non-convex learning via stochastic gradient Langevin dynamics: a nonasymptotic analysis","author":"raginsky","year":"2017","journal-title":"Proc Conf Learn Theory"},{"key":"ref22","article-title":"Annealing for distributed global optimization","author":"swenson","year":"0","journal-title":"Proceedings of 58th IEEE Conference on Decision and Control arXiv preprint"},{"key":"ref21","first-page":"3122","article-title":"Global convergence of Langevin dynamics based algorithms for nonconvex optimization","author":"xu","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/110848396"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813658"}],"event":{"name":"ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","location":"Barcelona, Spain","start":{"date-parts":[[2020,5,4]]},"end":{"date-parts":[[2020,5,8]]}},"container-title":["ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9040208\/9052899\/09054279.pdf?arnumber=9054279","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T00:27:01Z","timestamp":1656376021000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9054279\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/icassp40776.2020.9054279","relation":{},"subject":[],"published":{"date-parts":[[2020,5]]}}}