{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T17:22:08Z","timestamp":1778865728321,"version":"3.51.4"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Max Planck ETH Center for Learning Systems"},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1636123"],"award-info":[{"award-number":["U1636123"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1109\/tnnls.2018.2889976","type":"journal-article","created":{"date-parts":[[2019,3,6]],"date-time":"2019-03-06T20:27:00Z","timestamp":1551904020000},"page":"3233-3245","source":"Crossref","is-referenced-by-count":6,"title":["Parallel Coordinate Descent Newton Method for Efficient $L_{1}$ -Regularized Loss Minimization"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2368-4084","authenticated-orcid":false,"given":"Yatao An","family":"Bian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuncai","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4848-2304","authenticated-orcid":false,"given":"Ming-Hsuan","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"777","article-title":"Sparse online learning via truncated gradient","volume":"10","author":"langford","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref11","first-page":"987","article-title":"Distributed box-constrained quadratic optimization for dual linear SVM","author":"lee","year":"2015","journal-title":"Proc ICML"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553453"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623498345075"},{"key":"ref14","author":"luo","year":"2014","journal-title":"Accelerated parallel optimization methods for large scale machine learning"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/978-3-319-17689-5_11","article-title":"Distributed block coordinate descent for minimizing partially separable functions","author":"mare?ek","year":"2015","journal-title":"Numerical analysis and optimization"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015435"},{"key":"ref17","first-page":"693","article-title":"HOGWILD: A lock-free approach to parallelizing stochastic gradient descent","author":"niu","year":"2011","journal-title":"Proc NIPS"},{"key":"ref18","first-page":"2657","article-title":"Distributed coordinate descent method for learning with big data","volume":"17","author":"richt\u00e1rik","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0901-6"},{"key":"ref28","first-page":"2331","article-title":"Slow learners are fast","author":"zinkevich","year":"2009","journal-title":"Proc NIPS"},{"key":"ref4","first-page":"1369","article-title":"Coordinate descent method for large-scale $\\ell_{1}$ -loss linear support vector machines","volume":"9","author":"chang","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref27","first-page":"33","article-title":"An improved GLMNET for $\\ell_{1}$ -regularized logistic regression","author":"yuan","year":"2011","journal-title":"Proc KDD"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584377"},{"key":"ref6","first-page":"1871","article-title":"LIBLINEAR: A library for large linear classification","volume":"9","author":"fan","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref29","first-page":"2595","article-title":"Parallelized stochastic gradient descent","author":"zinkevich","year":"2010","journal-title":"Proc NIPS"},{"key":"ref5","first-page":"1223","article-title":"Large scale distributed deep networks","author":"dean","year":"2012","journal-title":"Proc NIPS"},{"key":"ref8","first-page":"1223","article-title":"More effective distributed ML via a stale synchronous parallel parameter server","author":"ho","year":"2013","journal-title":"Proc NIPS"},{"key":"ref7","first-page":"4537","article-title":"COLA: Communication-efficient decentralized linear learning","author":"he","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref2","first-page":"321","article-title":"Parallel coordinate descent for $\\ell_{1}$ -regularized loss minimization","author":"bradley","year":"2011","journal-title":"Proc ICML"},{"key":"ref9","first-page":"1519","article-title":"An interior-point method for large-scale $\\ell_{1}$ -regularized logistic regression","volume":"8","author":"koh","year":"2007","journal-title":"J Mach Learn Res"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40994-3_6"},{"key":"ref20","first-page":"1","article-title":"Scaling up coordinate descent algorithms for large $\\ell_{1}$ -regularization problems","author":"scherrer","year":"2012","journal-title":"Proc ICML"},{"key":"ref22","first-page":"117","article-title":"Stochastic methods for $\\ell_{1}$ regularized loss minimization","author":"shalev-shwartz","year":"2009","journal-title":"Proc ICML"},{"key":"ref21","first-page":"28","article-title":"Feature clustering for accelerating parallel coordinate descent","author":"scherrer","year":"2012","journal-title":"Proc NIPS"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0170-0"},{"key":"ref23","first-page":"230","article-title":"CoCoA: A general framework for communication-efficient distributed optimization","volume":"18","author":"smith","year":"2018","journal-title":"J Mach Learn Res"},{"key":"ref26","first-page":"3183","article-title":"A comparison of optimization methods and software for large-scale L1-regularized linear classification","volume":"11","author":"yuan","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.79"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/8886738\/08661743.pdf?arnumber=8661743","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T12:43:01Z","timestamp":1721047381000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8661743\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":29,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2018.2889976","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11]]}}}