{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:36:27Z","timestamp":1768030587772,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T00:00:00Z","timestamp":1534118400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,8,13]]},"DOI":"10.1145\/3225058.3225131","type":"proceedings-article","created":{"date-parts":[[2018,8,8]],"date-time":"2018-08-08T19:13:06Z","timestamp":1533755586000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Reducing Communication in Proximal Newton Methods for Sparse Least Squares Problems"],"prefix":"10.1145","author":[{"given":"Saeed","family":"Soori","sequence":"first","affiliation":[{"name":"Rutgers University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aditya","family":"Devarakonda","sequence":"additional","affiliation":[{"name":"University of California Berkeley"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zachary","family":"Blanco","sequence":"additional","affiliation":[{"name":"Rutgers University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Demmel","sequence":"additional","affiliation":[{"name":"University of California Berkeley"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mert","family":"Gurbuzbalaban","sequence":"additional","affiliation":[{"name":"Rutgers University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maryam Mehri","family":"Dehnavi","sequence":"additional","affiliation":[{"name":"Rutgers University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,8,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492914000038"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"e_1_3_2_1_3_1","volume-title":"Templates for convex cone problems with applications to sparse signal recovery. Mathematical programming computation 3, 3","author":"Becker Stephen R","year":"2011","unstructured":"Stephen R Becker , Emmanuel J Cand\u00e8s , and Michael C Grant . 2011. Templates for convex cone problems with applications to sparse signal recovery. Mathematical programming computation 3, 3 ( 2011 ), 165--218. Stephen R Becker, Emmanuel J Cand\u00e8s, and Michael C Grant. 2011. Templates for convex cone problems with applications to sparse signal recovery. Mathematical programming computation 3, 3 (2011), 165--218."},{"key":"e_1_3_2_1_4_1","volume-title":"Incremental proximal methods for large scale convex optimization. Mathematical programming 129, 2","author":"Bertsekas Dimitri P","year":"2011","unstructured":"Dimitri P Bertsekas . 2011. Incremental proximal methods for large scale convex optimization. Mathematical programming 129, 2 ( 2011 ), 163. Dimitri P Bertsekas. 2011. Incremental proximal methods for large scale convex optimization. Mathematical programming 129, 2 (2011), 163."},{"key":"e_1_3_2_1_5_1","volume-title":"Optimization methods for large-scale machine learning. arXiv preprint arXiv:1606.04838","author":"Bottou L\u00e9on","year":"2016","unstructured":"L\u00e9on Bottou , Frank E Curtis , and Jorge Nocedal . 2016. Optimization methods for large-scale machine learning. arXiv preprint arXiv:1606.04838 ( 2016 ). L\u00e9on Bottou, Frank E Curtis, and Jorge Nocedal. 2016. Optimization methods for large-scale machine learning. arXiv preprint arXiv:1606.04838 (2016)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/120881191"},{"key":"e_1_3_2_1_7_1","volume-title":"Communication-avoiding Krylov subspace methods in theory and practice","author":"Carson Erin Claire","unstructured":"Erin Claire Carson . 2015. Communication-avoiding Krylov subspace methods in theory and practice . University of California , Berkeley. Erin Claire Carson. 2015. Communication-avoiding Krylov subspace methods in theory and practice. University of California, Berkeley."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-010-0251-1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(96)00022-1"},{"key":"e_1_3_2_1_11_1","volume-title":"An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Communications on pure and applied mathematics 57, 11","author":"Daubechies Ingrid","year":"2004","unstructured":"Ingrid Daubechies , Michel Defrise , and Christine De Mol . 2004. An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Communications on pure and applied mathematics 57, 11 ( 2004 ), 1413--1457. Ingrid Daubechies, Michel Defrise, and Christine De Mol. 2004. An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Communications on pure and applied mathematics 57, 11 (2004), 1413--1457."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/080731992"},{"key":"e_1_3_2_1_13_1","volume-title":"Avoiding communication in primal and dual block coordinate descent methods. arXiv preprint arXiv:1612.04003","author":"Devarakonda Aditya","year":"2016","unstructured":"Aditya Devarakonda , Kimon Fountoulakis , James Demmel , and Michael W Mahoney . 2016. Avoiding communication in primal and dual block coordinate descent methods. arXiv preprint arXiv:1612.04003 ( 2016 ). Aditya Devarakonda, Kimon Fountoulakis, James Demmel, and Michael W Mahoney. 2016. Avoiding communication in primal and dual block coordinate descent methods. arXiv preprint arXiv:1612.04003 (2016)."},{"key":"e_1_3_2_1_14_1","volume-title":"Avoiding Synchronization in First-Order Methods for Sparse Convex Optimization. arXiv preprint arXiv:1712.06047","author":"Devarakonda Aditya","year":"2017","unstructured":"Aditya Devarakonda , Kimon Fountoulakis , James Demmel , and Michael W Mahoney . 2017. Avoiding Synchronization in First-Order Methods for Sparse Convex Optimization. arXiv preprint arXiv:1712.06047 ( 2017 ). Aditya Devarakonda, Kimon Fountoulakis, James Demmel, and Michael W Mahoney. 2017. Avoiding Synchronization in First-Order Methods for Sparse Convex Optimization. arXiv preprint arXiv:1712.06047 (2017)."},{"key":"e_1_3_2_1_15_1","volume-title":"Applied mathematics research for exascale computing","author":"Dongarra Jack","unstructured":"Jack Dongarra , Jeffrey Hittinger , John Bell , Luis Chacon , Robert Falgout , Michael Heroux , Paul Hovland , Esmond Ng , Clayton Webster , and Stefan Wild . 2014. Applied mathematics research for exascale computing . Technical Report. Lawrence Livermore National Laboratory (LLNL), Livermore, CA. Jack Dongarra, Jeffrey Hittinger, John Bell, Luis Chacon, Robert Falgout, Michael Heroux, Paul Hovland, Esmond Ng, Clayton Webster, and Stefan Wild. 2014. Applied mathematics research for exascale computing. Technical Report. Lawrence Livermore National Laboratory (LLNL), Livermore, CA."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v033.i01"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2011.15"},{"key":"e_1_3_2_1_18_1","volume-title":"Conference on Learning Theory. 797--842","author":"Ge Rong","year":"2015","unstructured":"Rong Ge , Furong Huang , Chi Jin , and Yang Yuan . 2015 . Escaping from saddle points---online stochastic gradient for tensor decomposition . In Conference on Learning Theory. 797--842 . Rong Ge, Furong Huang, Chi Jin, and Yang Yuan. 2015. Escaping from saddle points---online stochastic gradient for tensor decomposition. In Conference on Learning Theory. 797--842."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2673815"},{"key":"e_1_3_2_1_20_1","volume-title":"International Conference on Machine Learning. 1171--1179","author":"Johnson Tyler","year":"2015","unstructured":"Tyler Johnson and Carlos Guestrin . 2015 . Blitz: A principled meta-algorithm for scaling sparse optimization . In International Conference on Machine Learning. 1171--1179 . Tyler Johnson and Carlos Guestrin. 2015. Blitz: A principled meta-algorithm for scaling sparse optimization. In International Conference on Machine Learning. 1171--1179."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2505682"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/130921428"},{"key":"e_1_3_2_1_23_1","first-page":"1","article-title":"A distributed block coordinate descent method for training l 1 regularized linear classifiers","volume":"18","author":"Mahajan Dhruv","year":"2017","unstructured":"Dhruv Mahajan , S Sathiya Keerthi , and S Sundararajan . 2017 . A distributed block coordinate descent method for training l 1 regularized linear classifiers . Journal of Machine Learning Research 18 , 91 (2017), 1 -- 35 . Dhruv Mahajan, S Sathiya Keerthi, and S Sundararajan. 2017. A distributed block coordinate descent method for training l 1 regularized linear classifiers. Journal of Machine Learning Research 18, 91 (2017), 1--35.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553463"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2946645.2946679"},{"key":"e_1_3_2_1_26_1","volume-title":"Advances in Neural Information Processing Systems 27","author":"Nitanda Atsushi","unstructured":"Atsushi Nitanda . 2014. Stochastic Proximal Gradient Descent with Acceleration Techniques . In Advances in Neural Information Processing Systems 27 , Z. Ghahramani, M. Welling, C. Cortes, N. D. Lawrence, and K. Q. Weinberger (Eds.). Curran Associates, Inc. , 1574--1582. http:\/\/papers.nips.cc\/paper\/5610-stochastic-proximal-gradient-descent-with-acceleration-techniques.pdf Atsushi Nitanda. 2014. Stochastic Proximal Gradient Descent with Acceleration Techniques. In Advances in Neural Information Processing Systems 27, Z. Ghahramani, M. Welling, C. Cortes, N. D. Lawrence, and K. Q. Weinberger (Eds.). Curran Associates, Inc., 1574--1582. http:\/\/papers.nips.cc\/paper\/5610-stochastic-proximal-gradient-descent-with-acceleration-techniques.pdf"},{"key":"e_1_3_2_1_27_1","unstructured":"Atsushi Nitanda. 2014. Stochastic proximal gradient descent with acceleration techniques. In Advances in Neural Information Processing Systems. 1574--1582.   Atsushi Nitanda. 2014. Stochastic proximal gradient descent with acceleration techniques. In Advances in Neural Information Processing Systems. 1574--1582."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"e_1_3_2_1_29_1","first-page":"1278","article-title":"Learning graphical model structure using L1-regularization paths","volume":"7","author":"Schmidt Mark","year":"2007","unstructured":"Mark Schmidt , Alexandru Niculescu-Mizil , Kevin Murphy , and others. 2007 . Learning graphical model structure using L1-regularization paths . In AAAI , Vol. 7. 1278 -- 1283 . Mark Schmidt, Alexandru Niculescu-Mizil, Kevin Murphy, and others. 2007. Learning graphical model structure using L1-regularization paths. In AAAI, Vol. 7. 1278--1283.","journal-title":"AAAI"},{"key":"e_1_3_2_1_30_1","volume-title":"L1-regularized distributed optimization: A communication-efficient primal-dual framework. arXiv preprint arXiv:1512.04011","author":"Smith Virginia","year":"2015","unstructured":"Virginia Smith , Simone Forte , Michael I Jordan , and Martin Jaggi . 2015. L1-regularized distributed optimization: A communication-efficient primal-dual framework. arXiv preprint arXiv:1512.04011 ( 2015 ). Virginia Smith, Simone Forte, Michael I Jordan, and Martin Jaggi. 2015. L1-regularized distributed optimization: A communication-efficient primal-dual framework. arXiv preprint arXiv:1512.04011 (2015)."},{"key":"e_1_3_2_1_31_1","volume-title":"CoCoA: A General Framework for Communication-Efficient Distributed Optimization. arXiv preprint arXiv:1611.02189","author":"Smith Virginia","year":"2016","unstructured":"Virginia Smith , Simone Forte , Chenxin Ma , Martin Takac , Michael I Jordan , and Martin Jaggi . 2016. CoCoA: A General Framework for Communication-Efficient Distributed Optimization. arXiv preprint arXiv:1611.02189 ( 2016 ). Virginia Smith, Simone Forte, Chenxin Ma, Martin Takac, Michael I Jordan, and Martin Jaggi. 2016. CoCoA: A General Framework for Communication-Efficient Distributed Optimization. arXiv preprint arXiv:1611.02189 (2016)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2014.80"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOAS147"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/140961791"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.29"}],"event":{"name":"ICPP 2018: 47th International Conference on Parallel Processing","location":"Eugene OR USA","acronym":"ICPP 2018","sponsor":["University of Oregon University of Oregon"]},"container-title":["Proceedings of the 47th International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3225058.3225131","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3225058.3225131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:50Z","timestamp":1750210790000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3225058.3225131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,13]]},"references-count":35,"alternative-id":["10.1145\/3225058.3225131","10.1145\/3225058"],"URL":"https:\/\/doi.org\/10.1145\/3225058.3225131","relation":{},"subject":[],"published":{"date-parts":[[2018,8,13]]},"assertion":[{"value":"2018-08-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}