{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T14:06:36Z","timestamp":1768399596199,"version":"3.49.0"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001729","name":"Swedish Foundation for Strategic Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001729","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Swedish Science Foundation (VR)"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1109\/tac.2016.2525015","type":"journal-article","created":{"date-parts":[[2016,2,3]],"date-time":"2016-02-03T19:09:41Z","timestamp":1454526581000},"page":"3740-3754","source":"Crossref","is-referenced-by-count":62,"title":["An Asynchronous Mini-Batch Algorithm for Regularized Stochastic Optimization"],"prefix":"10.1109","volume":"61","author":[{"given":"Hamid Reza","family":"Feyzmahdavian","sequence":"first","affiliation":[]},{"given":"Arda","family":"Aytekin","sequence":"additional","affiliation":[]},{"given":"Mikael","family":"Johansson","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-37801-0","author":"rauber","year":"2013","journal-title":"Parallel Programming For Multicore and Cluster Systems"},{"key":"ref38","year":"2015","journal-title":"Pascal Large Scale Learning Challenge"},{"key":"ref33","first-page":"14","article-title":"Composite objective mirror descent","author":"duchi","year":"0","journal-title":"Proc Conf Learn Theory"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0394-2"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/120894464"},{"key":"ref37","first-page":"361","article-title":"RCV1: A new benchmark collection for text categorization research","volume":"5","author":"lewis","year":"2004","journal-title":"J Mach Learn Res"},{"key":"ref36","year":"2015","journal-title":"Open MPI Open Source High Performance Computing"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1080\/17442508208833217"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0864-7"},{"key":"ref40","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","author":"nesterov","year":"2004","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2091295"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-013-0053-8"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2640087.2644155"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2012.2209984"},{"key":"ref15","first-page":"1","article-title":"Communication-efficient distributed dual coordinate ascent","author":"jaggi","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref16","first-page":"1","article-title":"Parallel coordinate descent methods for big data optimization","volume":"156","author":"richt\u00e1rik","year":"2015","journal-title":"Math Programm"},{"key":"ref17","first-page":"1223","article-title":"Large scale distributed deep networks","author":"dean","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref18","first-page":"571","article-title":"Project Adam: Building an efficient and scalable deep learning training system","author":"chilimbi","year":"0","journal-title":"Proc Symp Oper Syst Des Implementation"},{"key":"ref19","first-page":"165","article-title":"Optimal distributed online prediction using mini-batches","volume":"13","author":"dekel","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/110848876"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426626"},{"key":"ref3","first-page":"1865","article-title":"Stochastic methods for $l_{1}$-regularized loss minimization","volume":"12","author":"shalev-shwartz","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0434-y"},{"key":"ref29","first-page":"449","article-title":"Making gradient descent optimal for strongly convex stochastic optimization","author":"rakhlin","year":"0","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/110848864"},{"key":"ref7","first-page":"781","article-title":"Accelerated gradient methods for stochastic optimization and online learning","author":"hu","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-84858-7","author":"hastie","year":"2009","journal-title":"The Elements of Statistical Learning"},{"key":"ref9","first-page":"2116","article-title":"Dual averaging method for regularized stochastic learning and online optimization","author":"xiao","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00503.x"},{"key":"ref46","first-page":"1647","article-title":"Better mini-batch algorithms via accelerated gradient methods","author":"cotter","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref20","author":"bertsekas","year":"1989","journal-title":"Parallel and Distributed Computation"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/0803026"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2012.6315289"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S1570-579X(01)80023-9"},{"key":"ref42","first-page":"395","article-title":"Optimal regularized dual averaging methods for stochastic optimization","author":"chen","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref24","first-page":"693","article-title":"Hogwild!: A lock-free approach to parallelizing stochastic gradient descent","author":"niu","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0149-x"},{"key":"ref23","first-page":"2915","article-title":"Delay-tolerant algorithms for asynchronous distributed online learning","author":"mcmahan","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/110836043"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/140961134"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/110831659"},{"key":"ref25","first-page":"469","article-title":"An asynchronous parallel stochastic coordinate descent algorithm","author":"liu","year":"0","journal-title":"Proc Int Conf Mach Learn (ICML)"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/7763889\/07397922.pdf?arnumber=7397922","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T18:55:30Z","timestamp":1692212130000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7397922\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":46,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tac.2016.2525015","relation":{},"ISSN":["0018-9286","1558-2523"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12]]}}}