{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T16:24:52Z","timestamp":1730305492469,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,21]],"date-time":"2023-06-21T00:00:00Z","timestamp":1687305600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,21]],"date-time":"2023-06-21T00:00:00Z","timestamp":1687305600000},"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,6,21]]},"DOI":"10.1109\/wimob58348.2023.10187884","type":"proceedings-article","created":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T14:08:16Z","timestamp":1690380496000},"page":"350-355","source":"Crossref","is-referenced-by-count":1,"title":["A Low Complexity Approximation of Gradient Descent for Learning over Single and Multi-Agent Systems"],"prefix":"10.1109","author":[{"given":"Mohammad H.","family":"Nassralla","sequence":"first","affiliation":[{"name":"American University of Beirut,Lebanon"}]},{"given":"Naeem","family":"Akl","sequence":"additional","affiliation":[{"name":"Qualcomm Bridgewater NJ,USA"}]},{"given":"Amr","family":"Mohamed","sequence":"additional","affiliation":[{"name":"Qatar University,Qatar"}]},{"given":"Zaher","family":"Dawy","sequence":"additional","affiliation":[{"name":"American University of Beirut,Lebanon"}]}],"member":"263","reference":[{"key":"ref13","article-title":"On the Convergence of Adam and Beyond","author":"reddi s","year":"2018","journal-title":"ICLRE"},{"key":"ref12","article-title":"Incorporating Nesterov Momentum into Adam","author":"dozat","year":"2016","journal-title":"ICLR Workshop"},{"key":"ref15","article-title":"Adaptation, Learning, and Optimization over Networks","author":"h","year":"2014","journal-title":"Adaptation Learning and Optimization Over Networks"},{"journal-title":"Numerical Optimization","year":"2006","author":"nocedal","key":"ref14"},{"journal-title":"Linear and Nonlinear Optimization","year":"2008","author":"griva","key":"ref30"},{"key":"ref11","first-page":"1","article-title":"Adam: a Method for Stochastic Optimization","author":"kingma","year":"2015","journal-title":"International Conference on Learning Representations"},{"article-title":"ADADELTA: An Adaptive Learning Rate Method","year":"2012","author":"zeiler","key":"ref10"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2015.2448520"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2019.2917084"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2021.3050916"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CICN.2014.220"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ABLAZE.2015.7154919"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.2307\/2334940"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2003.1272421"},{"journal-title":"Adaptive Filters","year":"2011","author":"sayed","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1015346318"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISDA.2005.12"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2396477"},{"journal-title":"Spectra of Graphs Theory and Application","year":"1980","author":"cvetkovi?","key":"ref28"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4"},{"journal-title":"Graphs Algorithms and Optimization","year":"2004","author":"kocay","key":"ref29"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2933452"},{"key":"ref7","first-page":"543","article-title":"A Method for Unconstrained Convex Minimization Problem with the Rate of Convergence o(1\/k2)","volume":"269","author":"nesterov","year":"1983","journal-title":"Doklady AN SSSR (Translated As Soviet Math Docl )"},{"key":"ref9","first-page":"2121","article-title":"Adaptive Subgradient Methods for Online Learning and Stochastic Optimization","volume":"12","author":"duchi j","year":"2011","journal-title":"Machine Learning Research"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2019.2947893"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2019.2941458"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(98)00116-6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"}],"event":{"name":"2023 19th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)","start":{"date-parts":[[2023,6,21]]},"location":"Montreal, QC, Canada","end":{"date-parts":[[2023,6,23]]}},"container-title":["2023 19th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10187718\/10187720\/10187884.pdf?arnumber=10187884","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T13:38:11Z","timestamp":1692020291000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10187884\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,21]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/wimob58348.2023.10187884","relation":{},"subject":[],"published":{"date-parts":[[2023,6,21]]}}}