{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T17:11:41Z","timestamp":1767978701744,"version":"3.49.0"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"AFOSR MURI","award":["FA 9550-10-1-0573"],"award-info":[{"award-number":["FA 9550-10-1-0573"]}]},{"DOI":"10.13039\/100000006","name":"ONR","doi-asserted-by":"publisher","award":["N00014-13-1-003"],"award-info":[{"award-number":["N00014-13-1-003"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CNS-1161404"],"award-info":[{"award-number":["CNS-1161404"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Cyber Security Research Center at Ben-Gurion University of the Negev"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1109\/tac.2017.2705559","type":"journal-article","created":{"date-parts":[[2017,5,19]],"date-time":"2017-05-19T18:31:36Z","timestamp":1495218696000},"page":"5974-5981","source":"Crossref","is-referenced-by-count":40,"title":["On Projected Stochastic Gradient Descent Algorithm with Weighted Averaging for Least Squares Regression"],"prefix":"10.1109","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0532-009X","authenticated-orcid":false,"given":"Kobi","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9365-6321","authenticated-orcid":false,"given":"Angelia","family":"Nedic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Srikant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"591","article-title":"The million song dataset","author":"bertin-mahieux","year":"2011","journal-title":"Proc Int Conf Music Inf Retr"},{"key":"ref38","article-title":"UCI machine learning repository","author":"lichman","year":"2013"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/BF02614063"},{"key":"ref32","first-page":"2663","article-title":"A stochastic gradient method with an exponential convergence rate for finite training sets","author":"roux","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623495294797"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/040615961"},{"key":"ref37","first-page":"64","article-title":"Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization","author":"shalev-shwartz","year":"2014","journal-title":"Proc Int Conf Mach Learning (ICML)"},{"key":"ref36","first-page":"728","article-title":"Competing with the empirical risk minimizer in a single pass","author":"frostig","year":"2015","journal-title":"Proc Conf Learn Theory (COLT)"},{"key":"ref35","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","author":"johnson","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/9.362902"},{"key":"ref10","first-page":"639","article-title":"Stability results for smoothed stochastic approximation procedures","volume":"73","author":"schwabe","year":"1993","journal-title":"Z Angew Math Mech"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6594-6_11"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012998308169"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S1570-579X(01)80024-0"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/78.912925"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2003.821722"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOS546"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1155\/2008\/529480"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2009.2027653"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2254619"},{"key":"ref4","article-title":"A simpler approach to obtaining an $O(1\/t)$ convergence rate for the projected stochastic subgradient method","author":"lacoste-julien","year":"2012"},{"key":"ref27","article-title":"Minimizing finite sums with the stochastic average gradient","author":"schmidt","year":"2013"},{"key":"ref3","article-title":"On accelerated proximal gradient methods for convex-concave optimization","author":"tseng","year":"2008"},{"key":"ref6","first-page":"1056","article-title":"Cezare convergence of gradient method approximation of saddle points for convex-concave functions","volume":"239","author":"nemirovskii","year":"1978","journal-title":"Dokl Akad Nauk SSSR"},{"key":"ref29","first-page":"205","article-title":"Averaged least-mean-squares: Bias-variance trade-offs and optimal sampling distributions","author":"d\u00e9fossez","year":"2015","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/120894464"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1109\/TAC.1985.1104076","article-title":"Convergence of parameter sensitivity estimates in a stochastic experiment","volume":"30","author":"cao","year":"1985","journal-title":"IEEE Trans Autom Control"},{"key":"ref7","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate $O(1\/k^2)$","volume":"27","author":"nesterov","year":"1983","journal-title":"Sov Math Dokl"},{"key":"ref2","first-page":"9","article-title":"Online learning and stochastic approximations","volume":"17","author":"bottou","year":"1998","journal-title":"On-Line Learning on Neural Networks"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/0330046"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472090"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0149-x"},{"key":"ref22","first-page":"2116","article-title":"Dual averaging method for regularized stochastic learning and online optimization","author":"xiao","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/110848864"},{"key":"ref41","first-page":"773","article-title":"Non-strongly-convex smooth stochastic approximation with convergence rate $O(1\/n)$","author":"bach","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref23","first-page":"449","article-title":"Making gradient descent optimal for strongly convex stochastic optimization","author":"rakhlin","year":"2012","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref26","first-page":"71","article-title":"Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes.","author":"shamir","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0434-y"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/9\/8082390\/7932172-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/8082390\/07932172.pdf?arnumber=7932172","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:48:36Z","timestamp":1649443716000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7932172\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":41,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tac.2017.2705559","relation":{},"ISSN":["0018-9286","1558-2523"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11]]}}}