{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:24:56Z","timestamp":1729643096031,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/acc.2016.7526120","type":"proceedings-article","created":{"date-parts":[[2016,8,5]],"date-time":"2016-08-05T13:52:25Z","timestamp":1470405145000},"page":"4847-4852","source":"Crossref","is-referenced-by-count":12,"title":["Doubly random parallel stochastic methods for large scale learning"],"prefix":"10.1109","author":[{"given":"Aryan","family":"Mokhtari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alec","family":"Koppel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"Ribeiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Parallel random coordinate descent method for composite minimization","author":"necoara","year":"2013","journal-title":"Submitted to the SIAM Journal on Control and Optimization"},{"key":"ref11","article-title":"An asynchronous parallel stochastic coordinate descent algorithm","author":"liu","year":"2013","journal-title":"arXiv preprint arXiv 1311 1873"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref13","article-title":"Minimizing finite sums with the stochastic average gradient","author":"schmidt","year":"2013","journal-title":"arXiv preprint arXiv 1309 2388"},{"key":"ref14","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","author":"johnson","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref15","first-page":"1646","article-title":"Saga: A fast incremental gradient method with support for non-strongly convex composite objectives","author":"defazio","year":"2014","journal-title":"Advances in neural information processing systems"},{"article-title":"A stochastic quasi-newton method for online convex optimization","year":"2007","author":"schraudolph","key":"ref16"},{"key":"ref17","first-page":"1737","article-title":"Sgd-qn: Careful quasi-newton stochastic gradient descent","volume":"10","author":"bordes","year":"2009","journal-title":"The Journal of Machine Learning Research"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2357775"},{"key":"ref19","first-page":"3151","article-title":"Global convergence of online limited memory bfgs","volume":"16","author":"mokhtari","year":"2015","journal-title":"Journal of Machine Learning Research"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017501703105"},{"article-title":"The MNIST database of handwritten digits","year":"0","author":"lecun","key":"ref27"},{"key":"ref3","article-title":"selecting causal genes from genome-wide association studies via functionally coherent subnetworks","author":"ta?an","year":"2014","journal-title":"Nature Methods"},{"key":"ref6","article-title":"Parallel coordinate descent methods for big data optimization","author":"richt\u00e1rik","year":"2012","journal-title":"arXiv preprint arXiv 1212 0873"},{"key":"ref5","article-title":"A globally convergent algorithm for nonconvex optimization based on block coordinate update","author":"xu","year":"2014","journal-title":"arXiv preprint arXiv 1410 1386"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/100802001"},{"key":"ref7","first-page":"1","article-title":"On the complexity analysis of randomized block-coordinate descent methods","author":"lu","year":"2013","journal-title":"Mathematical Programming"},{"key":"ref2","first-page":"19","article-title":"Online learning for matrix factorization and sparse coding","volume":"11","author":"mairal","year":"2010","journal-title":"The Journal of Machine Learning Research"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0892-3"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1080\/09528138908953710","article-title":"Natural language analysis by stochastic optimization: A progress report on project april","volume":"1","author":"sampson","year":"1990","journal-title":"J Exp Theor Artif Intell"},{"key":"ref20","article-title":"Block stochastic gradient iteration for convex and nonconvex optimization","author":"xu","year":"2014","journal-title":"ArXiv preprint 1408 2597v2"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2013.6612036"},{"key":"ref21","article-title":"Hogwild: A lock-free approach to parallelizing stochastic gradient descent","author":"niu","year":"2011","journal-title":"NIPS"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2399858"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2436357"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2016.7526120"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"}],"event":{"name":"2016 American Control Conference (ACC)","start":{"date-parts":[[2016,7,6]]},"location":"Boston, MA, USA","end":{"date-parts":[[2016,7,8]]}},"container-title":["2016 American Control Conference (ACC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7518121\/7524873\/07526120.pdf?arnumber=7526120","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T16:04:55Z","timestamp":1498320295000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7526120\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/acc.2016.7526120","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}