{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:52Z","timestamp":1750306372186,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,8,13]],"date-time":"2016-08-13T00:00:00Z","timestamp":1471046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"This work was supported in part by research grants from NIH (R01 LM010730 and RF1AG051710) and NSF (IIS-0953662 and III-1421057)."}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,8,13]]},"DOI":"10.1145\/2939672.2939859","type":"proceedings-article","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T18:33:46Z","timestamp":1470681226000},"page":"1705-1714","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Parallel Lasso Screening for Big Data Optimization"],"prefix":"10.1145","author":[{"given":"Qingyang","family":"Li","sequence":"first","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuang","family":"Qiu","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuiwang","family":"Ji","sequence":"additional","affiliation":[{"name":"Washington State University, Pullman, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul M.","family":"Thompson","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jieping","family":"Ye","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,8,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"e_1_3_2_2_3_1","article-title":"Safe feature elimination for the lasso and sparse supervised learning problems","author":"Ghaoui L. E.","year":"2012","unstructured":"L. E. Ghaoui , V. Viallon , and T. Rabbani . Safe feature elimination for the lasso and sparse supervised learning problems . Pacific Journal of Optimization, (8):667--698 , 2012 . L. E. Ghaoui, V. Viallon, and T. Rabbani. Safe feature elimination for the lasso and sparse supervised learning problems. Pacific Journal of Optimization, (8):667--698, 2012.","journal-title":"Pacific Journal of Optimization, (8):667--698"},{"key":"e_1_3_2_2_4_1","volume-title":"Proceedings of the 31st International Conference on Machine Learning (ICML-15)","author":"Hsieh C.-J.","year":"2015","unstructured":"C.-J. Hsieh , H.-F. Yu , and I. S. Dhillon . Passcode: Parallel asynchronous stochastic dual co-ordinate descent . In Proceedings of the 31st International Conference on Machine Learning (ICML-15) , 2015 . C.-J. Hsieh, H.-F. Yu, and I. S. Dhillon. Passcode: Parallel asynchronous stochastic dual co-ordinate descent. In Proceedings of the 31st International Conference on Machine Learning (ICML-15), 2015."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-005-0768-5"},{"key":"e_1_3_2_2_6_1","first-page":"321","volume-title":"Proceedings of the 28th International Conference on Machine Learning (ICML-11)","author":"Kyrola A.","year":"2011","unstructured":"A. Kyrola , D. Bickson , C. Guestrin , and J. K. Bradley . Parallel coordinate descent for l_1-regularized loss minimization . In Proceedings of the 28th International Conference on Machine Learning (ICML-11) , pages 321 -- 328 , 2011 . A. Kyrola, D. Bickson, C. Guestrin, and J. K. Bradley. Parallel coordinate descent for l_1-regularized loss minimization. In Proceedings of the 28th International Conference on Machine Learning (ICML-11), pages 321--328, 2011."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1005332.1005345"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.3934\/ipi.2009.3.487"},{"key":"e_1_3_2_2_10_1","volume-title":"SLEP: Sparse Learning with Efficient Projections","author":"Liu J.","year":"2009","unstructured":"J. Liu , S. Ji , and J. Ye . SLEP: Sparse Learning with Efficient Projections . Arizona State University , 2009 . J. Liu, S. Ji, and J. Ye. SLEP: Sparse Learning with Efficient Projections. Arizona State University, 2009."},{"key":"e_1_3_2_2_11_1","first-page":"469","volume-title":"Proceedings of the 31st International Conference on Machine Learning (ICML-14)","author":"Liu J.","year":"2014","unstructured":"J. Liu , S. Wright , C. Re , V. Bittorf , and S. Sridhar . An asynchronous parallel stochastic coordinate descent algorithm . In Proceedings of the 31st International Conference on Machine Learning (ICML-14) , pages 469 -- 477 , 2014 . J. Liu, S. Wright, C. Re, V. Bittorf, and S. Sridhar. An asynchronous parallel stochastic coordinate descent algorithm. In Proceedings of the 31st International Conference on Machine Learning (ICML-14), pages 469--477, 2014."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/100802001"},{"key":"e_1_3_2_2_13_1","first-page":"1","volume-title":"Mathematical Programming","author":"Richt\u00e1rik P.","unstructured":"P. Richt\u00e1rik and M. Tak\u00e1\u010d . Parallel coordinate descent methods for big data optimization . Mathematical Programming , pages 1 -- 52 . P. Richt\u00e1rik and M. Tak\u00e1\u010d. Parallel coordinate descent methods for big data optimization. Mathematical Programming, pages 1--52."},{"key":"e_1_3_2_2_14_1","volume-title":"Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Mathematical Programming, 144(1--2):1--38","author":"Richt\u00e1rik P.","year":"2014","unstructured":"P. Richt\u00e1rik and M. Tak\u00e1\u010d . Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Mathematical Programming, 144(1--2):1--38 , 2014 . P. Richt\u00e1rik and M. Tak\u00e1\u010d. Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Mathematical Programming, 144(1--2):1--38, 2014."},{"key":"e_1_3_2_2_15_1","volume-title":"Proceedings of the 29st International Conference on Machine Learning (ICML-12)","author":"Scherrer C.","year":"2012","unstructured":"C. Scherrer , M. Halappanavar , A. Tewari , and D. Haglin . Scaling up coordinate descent algorithms for large regularization problems . In Proceedings of the 29st International Conference on Machine Learning (ICML-12) , 2012 . C. Scherrer, M. Halappanavar, A. Tewari, and D. Haglin. Scaling up coordinate descent algorithms for large regularization problems. In Proceedings of the 29st International Conference on Machine Learning (ICML-12), 2012."},{"key":"e_1_3_2_2_16_1","first-page":"28","volume-title":"Advances in Neural Information Processing Systems","author":"Scherrer C.","year":"2012","unstructured":"C. Scherrer , A. Tewari , M. Halappanavar , and D. Haglin . Feature clustering for accelerating parallel coordinate descent . In Advances in Neural Information Processing Systems , pages 28 -- 36 , 2012 . C. Scherrer, A. Tewari, M. Halappanavar, and D. Haglin. Feature clustering for accelerating parallel coordinate descent. In Advances in Neural Information Processing Systems, pages 28--36, 2012."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2021059"},{"key":"e_1_3_2_2_18_1","series-title":"Series B (Methodological)","first-page":"267","volume-title":"Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society","author":"Tibshirani R.","year":"1996","unstructured":"R. Tibshirani . Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society . Series B (Methodological) , pages 267 -- 288 , 1996 . R. Tibshirani. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society. Series B (Methodological), pages 267--288, 1996."},{"key":"e_1_3_2_2_19_1","volume-title":"Strong rules for discarding predictors in lasso-type problems. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 74(2):245--266","author":"Tibshirani R.","year":"2012","unstructured":"R. Tibshirani , J. Bien , J. Friedman , T. Hastie , N. Simon , J. Taylor , and R. J. Tibshirani . Strong rules for discarding predictors in lasso-type problems. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 74(2):245--266 , 2012 . R. Tibshirani, J. Bien, J. Friedman, T. Hastie, N. Simon, J. Taylor, and R. J. Tibshirani. Strong rules for discarding predictors in lasso-type problems. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 74(2):245--266, 2012."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783412"},{"key":"e_1_3_2_2_21_1","first-page":"235","volume-title":"Proceedings of the 31st International Conference on Machine Learning (ICML-14)","author":"Wang J.","year":"2014","unstructured":"J. Wang , Q. Li , S. Yang , W. Fan , P. Wonka , and J. Ye . A highly scalable parallel algorithm for isotropic total variation models . In Proceedings of the 31st International Conference on Machine Learning (ICML-14) , pages 235 -- 243 , 2014 . J. Wang, Q. Li, S. Yang, W. Fan, P. Wonka, and J. Ye. A highly scalable parallel algorithm for isotropic total variation models. In Proceedings of the 31st International Conference on Machine Learning (ICML-14), pages 235--243, 2014."},{"key":"e_1_3_2_2_22_1","first-page":"2132","volume-title":"Advances in Neural Information Processing Systems","author":"Wang J.","year":"2014","unstructured":"J. Wang and J. Ye . Two-layer feature reduction for sparse-group lasso via decomposition of convex sets . In Advances in Neural Information Processing Systems , pages 2132 -- 2140 , 2014 . J. Wang and J. Ye. Two-layer feature reduction for sparse-group lasso via decomposition of convex sets. In Advances in Neural Information Processing Systems, pages 2132--2140, 2014."},{"key":"e_1_3_2_2_23_1","volume-title":"Proceedings of the 32nd International Conference on Machine Learning","author":"Wang J.","year":"2015","unstructured":"J. Wang and J. Ye . Safe screening for multi-task feature learning with multiple data matrices . In Proceedings of the 32nd International Conference on Machine Learning , 2015 . J. Wang and J. Ye. Safe screening for multi-task feature learning with multiple data matrices. In Proceedings of the 32nd International Conference on Machine Learning, 2015."},{"key":"e_1_3_2_2_24_1","first-page":"1070","volume-title":"Advances in Neural Information Processing Systems","author":"Wang J.","year":"2013","unstructured":"J. Wang , J. Zhou , P. Wonka , and J. Ye . Lasso screening rules via dual polytope projection . In Advances in Neural Information Processing Systems , pages 1070 -- 1078 , 2013 . J. Wang, J. Zhou, P. Wonka, and J. Ye. Lasso screening rules via dual polytope projection. In Advances in Neural Information Processing Systems, pages 1070--1078, 2013."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638277"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015332"}],"event":{"name":"KDD '16: The 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"San Francisco California USA","acronym":"KDD '16"},"container-title":["Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2939672.2939859","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2939672.2939859","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:31Z","timestamp":1750222591000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2939672.2939859"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,13]]},"references-count":26,"alternative-id":["10.1145\/2939672.2939859","10.1145\/2939672"],"URL":"https:\/\/doi.org\/10.1145\/2939672.2939859","relation":{},"subject":[],"published":{"date-parts":[[2016,8,13]]},"assertion":[{"value":"2016-08-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}