{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T16:52:00Z","timestamp":1784134320361,"version":"3.55.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T00:00:00Z","timestamp":1701648000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T00:00:00Z","timestamp":1701648000000},"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,12,4]]},"DOI":"10.1109\/gcwkshps58843.2023.10464472","type":"proceedings-article","created":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T17:52:58Z","timestamp":1711043578000},"page":"902-907","source":"Crossref","is-referenced-by-count":4,"title":["Network-GIANT: Fully Distributed Newton-Type Optimization via Harmonic Hessian Consensus"],"prefix":"10.1109","author":[{"given":"Alessio","family":"Maritan","sequence":"first","affiliation":[{"name":"University of Padova,Department of Information Engineering,Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ganesh","family":"Sharma","sequence":"additional","affiliation":[{"name":"Hamilton Institute, Maynooth University,Ireland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luca","family":"Schenato","sequence":"additional","affiliation":[{"name":"University of Padova,Department of Information Engineering,Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Subhrakanti","family":"Dey","sequence":"additional","affiliation":[{"name":"Uppsala University,Department of Electrical Engineering,Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"AISTATS","author":"McMahan","year":"2017"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2975749"},{"key":"ref3","article-title":"Communication-efficient distributed optimization using an approximate newton-type method","volume-title":"International Conference on Machine Learning","author":"Shamir","year":"2014"},{"key":"ref4","article-title":"Giant: Globally improved approximate newton method for distributed optimization","volume":"31","author":"Wang","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2022.3146253"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC54779.2022.9977466"},{"key":"ref7","article-title":"FedNL: Making newton-type methods applicable to federated learning","author":"Safaryan","year":"2021","journal-title":"arXiv preprint"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2298712"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/130943170"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/16m1084316"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2304432"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2367458"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2874748"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2015.2449811"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2617829"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/15M1038049"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2021.3083975"},{"issue":"1","key":"ref19","article-title":"Communication-efficient distributed optimization in networks with gradient tracking and variance reduction","volume":"21","author":"Li","year":"2020","journal-title":"The Journal of Machine Learning Research"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2006.08.010"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/b98874"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2016.2613678"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2023.3281745"},{"key":"ref24","article-title":"Lyapunov theory for discrete time systems","author":"Bof","year":"2018","journal-title":"arXiv preprint"},{"key":"ref25","article-title":"MNIST handwritten digit database","volume":"2","author":"LeCun","year":"2010","journal-title":"ATT Labs"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.1806\/table-3"}],"event":{"name":"2023 IEEE Globecom Workshops (GC Wkshps)","location":"Kuala Lumpur, Malaysia","start":{"date-parts":[[2023,12,4]]},"end":{"date-parts":[[2023,12,8]]}},"container-title":["2023 IEEE Globecom Workshops (GC Wkshps)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10464388\/10464393\/10464472.pdf?arnumber=10464472","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T20:45:26Z","timestamp":1711485926000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10464472\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,4]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/gcwkshps58843.2023.10464472","relation":{},"subject":[],"published":{"date-parts":[[2023,12,4]]}}}