{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T14:49:22Z","timestamp":1775486962927,"version":"3.50.1"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"UF Informatics Institute"},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS 1854476"],"award-info":[{"award-number":["DMS 1854476"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS 2210358"],"award-info":[{"award-number":["DMS 2210358"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tsp.2022.3223214","type":"journal-article","created":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T20:36:54Z","timestamp":1670445414000},"page":"6065-6079","source":"Crossref","is-referenced-by-count":40,"title":["DAdam: A Consensus-Based Distributed Adaptive Gradient Method for Online Optimization"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3435-6219","authenticated-orcid":false,"given":"Parvin","family":"Nazari","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), Rasht St, Iran"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1267-3889","authenticated-orcid":false,"given":"Davoud Ataee","family":"Tarzanagh","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3676-1739","authenticated-orcid":false,"given":"George","family":"Michailidis","sequence":"additional","affiliation":[{"name":"Department of Statistics, University of Florida, Gainesville, FL, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1561\/9781680831719"},{"key":"ref3","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","volume-title":"Proc. 20th Int. Conf. Mach. Learn.","author":"Zinkevich","year":"2003"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2404790"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1408"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7799379"},{"key":"ref7","first-page":"732","article-title":"Improved dynamic regret for non-degenerate functions","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Zhang","year":"2017"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1986.1104412"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/79.985674"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984626"},{"key":"ref11","volume-title":"Distributed Sensor Networks: A Multiagent Perspective","volume":"9","author":"Lesser","year":"2012"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2161027"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6425904"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2308612"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2304432"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1355-4"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/130943170"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2818081"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084316"},{"key":"ref22","first-page":"4848","article-title":"D$^{2}$: Decentralized training over decentralized data","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Tang","year":"2018"},{"key":"ref23","first-page":"5904","article-title":"Collaborative deep learning in fixed topology networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Jiang","year":"2017"},{"key":"ref24","first-page":"5330","article-title":"Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Lian","year":"2017"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2013.6760092"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2830299"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3559765"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2743462"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3033712"},{"key":"ref30","first-page":"244","article-title":"Adaptive bound optimization for online convex optimization","volume-title":"Proc. 23rd Conf. Learn. Theory","author":"McMahan","year":"2010"},{"key":"ref31","first-page":"2121","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","author":"Duchi","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref32","first-page":"1","article-title":"ADAM: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kingma","year":"2015"},{"key":"ref33","first-page":"1","article-title":"On the convergence of ADAM and beyond","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Reddi","year":"2018"},{"key":"ref34","article-title":"AdaDelta: An adaptive learning rate method","author":"Zeiler","year":"2012"},{"key":"ref35","article-title":"Divide the gradient by a running average of its recent magnitude. coursera: Neural networks for machine learning","author":"Tieleman","year":"2021"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2525928"},{"key":"ref37","first-page":"1","article-title":"Cooperative SGD: A unified framework for the design and analysis of local-update SGD algorithms","volume":"22","author":"Wang","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"ref39","first-page":"415","article-title":"Optimal strategies and minimax lower bounds for online convex games","volume-title":"Proc. 21st Annu. Conf. Comput. Learn. Theory","author":"Abernethy","year":"2008"},{"key":"ref40","first-page":"1433","article-title":"Efficient regret minimization in non-convex games","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Hazan","year":"2017"},{"key":"ref41","first-page":"7982","article-title":"Dynamic local regret for non-convex online forecasting","volume-title":"Proc. 33rd Int. Conf. Neural Inf. Process. Syst.","author":"Aydore","year":"2019"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2022.2112958"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2650563"},{"key":"ref46","article-title":"Central server free federated learning over single-sided trust social networks","author":"He","year":"2019"},{"key":"ref47","first-page":"2218","article-title":"Online learning with continuous variations: Dynamic regret and reductions","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Cheng"},{"key":"ref48","first-page":"4148","article-title":"The marginal value of adaptive gradient methods in machine learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wilson","year":"2017"},{"key":"ref49","article-title":"On the convergence of adaptive gradient methods for nonconvex optimization","author":"Zhou","year":"2018"},{"key":"ref50","first-page":"1","article-title":"On the convergence of a class of ADAM-type algorithms for non-convex optimization","volume-title":"Proc. 7th Int. Conf. Learn. Representations","author":"Chen","year":"2019"},{"key":"ref51","article-title":"Adaptive first-and zeroth-order methods for weakly convex stochastic optimization problems","author":"Nazari","year":"2020"},{"issue":"1","key":"ref52","first-page":"9047","article-title":"Adagrad stepsizes: Sharp convergence over nonconvex landscapes","volume":"21","author":"Ward","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref53","article-title":"Convergence guarantees for RMSProp and ADAM in non-convex optimization and an empirical comparison to Nesterov acceleration","volume-title":"Proc. ICML Workshop Modern Trends Nonconvex Optim. Mach. Learn.","author":"De","year":"2018"},{"key":"ref54","first-page":"9815","article-title":"Adaptive methods for nonconvex optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zaheer","year":"2018"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144503423264"},{"issue":"215","key":"ref56","first-page":"1","article-title":"SGDLibrary: A. MATLAB library for stochastic optimization algorithms","volume":"18","author":"Kasai","year":"2018","journal-title":"J. Mach. Learn. Res."},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.243"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2916341"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/78\/9675017\/9973382-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/9675017\/09973382.pdf?arnumber=9973382","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T05:42:47Z","timestamp":1706766167000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9973382\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":60,"URL":"https:\/\/doi.org\/10.1109\/tsp.2022.3223214","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}