{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T22:46:52Z","timestamp":1777675612318,"version":"3.51.4"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1109\/bigdata.2018.8622172","type":"proceedings-article","created":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T03:07:18Z","timestamp":1548385638000},"page":"65-73","source":"Crossref","is-referenced-by-count":4,"title":["Linear Models with Many Cores and CPUs: A Stochastic Atomic Update Scheme"],"prefix":"10.1109","author":[{"given":"Edward","family":"Raff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jared","family":"Sylvester","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2015.83"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1145\/1015330.1015435","article-title":"Feature selection, L1 vs. L2 regularization, and rotational invariance","volume":"78","author":"ng","year":"2004","journal-title":"Twenty-first international conference on Machine learning  - ICML '04"},{"key":"ref12","first-page":"1","volume":"18","author":"raff","year":"2017","journal-title":"JSAT Java Statistical Analysis Tool a Library for Machine Learning 1"},{"key":"ref13","first-page":"693","article-title":"Hogwild: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent","volume":"24","author":"recht","year":"2011","journal-title":"Advances in neural information processing systems"},{"key":"ref14","first-page":"567","article-title":"Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization","volume":"14","author":"shalev-shwartz","year":"2012","journal-title":"Journal ofMachine Learning Research"},{"key":"ref15","article-title":"The architecture of the Nehalem processor and Nehalem-EP SMP platforms","volume":"3","author":"thomadakis","year":"2011","journal-title":"Resource"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783412"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.2307\/3001968"},{"key":"ref18","author":"zar","year":"1999","journal-title":"Biostatistical Analysis"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0073"},{"key":"ref4","first-page":"1","article-title":"Statistical Comparisons of Classifiers over Multiple Data Sets","volume":"7","author":"dem\u0161ar","year":"2006","journal-title":"Journal of Machine Learning Research"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729330"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/88.242438"},{"key":"ref5","first-page":"1871","article-title":"LIBLINEAR: A Library for Large Linear Classification","volume":"9","author":"fan","year":"2008","journal-title":"The Journal of Machine Learning Research"},{"key":"ref8","author":"lea","year":"2018","journal-title":"DoubleAdder"},{"key":"ref7","first-page":"2370","article-title":"PASSCoDe: Parallel Asynchronous Stochastic Dual Co-ordinate Descent","author":"hsieh","year":"2015","journal-title":"Proceedings of the 32Nd International Conference on International Conference on Machine Learning - Volume 37 ICML’15"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"ref1","first-page":"1","volume":"17","author":"benavoli","year":"2016","journal-title":"Should We Really Use Post-Hoc Tests Based on Mean-Ranks? 1"},{"key":"ref9","first-page":"46","article-title":"ASAGA: Asynchronous Parallel SAGA. In A. Singh and J. Zhu, editors","volume":"54","author":"leblond","year":"2017","journal-title":"Proc of the International Conference on Artificial Intelligence and Statistics"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0074"},{"key":"ref21","first-page":"2379","article-title":"Fast Asynchronous Parallel Stochastic Gradient Descent: A Lock-free Approach with Convergence Guarantee","author":"zhao","year":"2016","journal-title":"Proc of the Thirtieth AAAI Conference on Artificial Intelligence"}],"event":{"name":"2018 IEEE International Conference on Big Data (Big Data)","location":"Seattle, WA, USA","start":{"date-parts":[[2018,12,10]]},"end":{"date-parts":[[2018,12,13]]}},"container-title":["2018 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8610059\/8621858\/08622172.pdf?arnumber=8622172","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T23:02:04Z","timestamp":1643238124000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8622172\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2018.8622172","relation":{},"subject":[],"published":{"date-parts":[[2018,12]]}}}