{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:55:12Z","timestamp":1760597712463,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":54,"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"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,8,13]]},"DOI":"10.1145\/2939672.2939819","type":"proceedings-article","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T18:33:46Z","timestamp":1470681226000},"page":"2035-2044","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Accelerated Stochastic Block Coordinate Descent with Optimal Sampling"],"prefix":"10.1145","author":[{"given":"Aston","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quanquan","family":"Gu","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,8,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35289-8_25"},{"key":"e_1_3_2_1_2_1","volume-title":"Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection. The annals of applied statistics, 5(1):232","author":"Breheny P.","year":"2011","unstructured":"P. Breheny and J. Huang . Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection. The annals of applied statistics, 5(1):232 , 2011 . P. Breheny and J. Huang. Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection. The annals of applied statistics, 5(1):232, 2011."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1390681.1442778"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623495290179"},{"key":"e_1_3_2_1_6_1","volume-title":"Conference on Uncertainty in Artificial Intelligence","author":"Chen J.","year":"2016","unstructured":"J. Chen and Q. Gu . Accelerated stochastic block coordinate gradient descent for sparsity constrained nonconvex optimization . In Conference on Uncertainty in Artificial Intelligence , 2016 . J. Chen and Q. Gu. Accelerated stochastic block coordinate gradient descent for sparsity constrained nonconvex optimization. In Conference on Uncertainty in Artificial Intelligence, 2016."},{"key":"e_1_3_2_1_7_1","volume-title":"Stochastic dual coordinate ascent with adaptive probabilities. arXiv:1502.08053","author":"Csiba D.","year":"2015","unstructured":"D. Csiba , Z. Qu , and P. Richt\u00e1rik . Stochastic dual coordinate ascent with adaptive probabilities. arXiv:1502.08053 , 2015 . D. Csiba, Z. Qu, and P. Richt\u00e1rik. Stochastic dual coordinate ascent with adaptive probabilities. arXiv:1502.08053, 2015."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/130936361"},{"key":"e_1_3_2_1_9_1","first-page":"1646","volume-title":"Advances in Neural Information Processing Systems","author":"Defazio A.","year":"2014","unstructured":"A. Defazio , F. Bach , and S. Lacoste-Julien . Saga: A fast incremental gradient method with support for non-strongly convex composite objectives . In Advances in Neural Information Processing Systems , pages 1646 -- 1654 , 2014 . A. Defazio, F. Bach, and S. Lacoste-Julien. Saga: A fast incremental gradient method with support for non-strongly convex composite objectives. In Advances in Neural Information Processing Systems, pages 1646--1654, 2014."},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Defazio A. J.","year":"2014","unstructured":"A. J. Defazio , T. S. Caetano , and J. Domke . Finito: A faster, permutable incremental gradient method for big data problems . In Proceedings of the International Conference on Machine Learning , 2014 . A. J. Defazio, T. S. Caetano, and J. Domke. Finito: A faster, permutable incremental gradient method for big data problems. In Proceedings of the International Conference on Machine Learning, 2014."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOAS131"},{"key":"e_1_3_2_1_12_1","volume-title":"Penalized regressions: the bridge versus the lasso. Journal of computational and graphical statistics, 7(3):397--416","author":"Fu W. J.","year":"1998","unstructured":"W. J. Fu . Penalized regressions: the bridge versus the lasso. Journal of computational and graphical statistics, 7(3):397--416 , 1998 . W. J. Fu. Penalized regressions: the bridge versus the lasso. Journal of computational and graphical statistics, 7(3):397--416, 1998."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1148\/radiology.143.1.7063747"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390208"},{"key":"e_1_3_2_1_15_1","first-page":"315","volume-title":"Advances in Neural Information Processing Systems","author":"Johnson R.","year":"2013","unstructured":"R. Johnson and T. Zhang . Accelerating stochastic gradient descent using predictive variance reduction . In Advances in Neural Information Processing Systems , pages 315 -- 323 , 2013 . R. Johnson and T. Zhang. Accelerating stochastic gradient descent using predictive variance reduction. In Advances in Neural Information Processing Systems, pages 315--323, 2013."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1620754.1620794"},{"key":"e_1_3_2_1_17_1","volume-title":"ms2gd: Mini-batch semi-stochastic gradient descent in the proximal setting. arXiv:1410.4744","author":"Kone\u010dn\u1ef3 J.","year":"2014","unstructured":"J. Kone\u010dn\u1ef3 , J. Liu , P. Richt\u00e1rik , and M. Tak\u00e1\u010d . ms2gd: Mini-batch semi-stochastic gradient descent in the proximal setting. arXiv:1410.4744 , 2014 . J. Kone\u010dn\u1ef3, J. Liu, P. Richt\u00e1rik, and M. Tak\u00e1\u010d. ms2gd: Mini-batch semi-stochastic gradient descent in the proximal setting. arXiv:1410.4744, 2014."},{"key":"e_1_3_2_1_18_1","volume-title":"Semi-stochastic coordinate descent. arXiv preprint arXiv:1412.6293","author":"Kone\u010dn\u1ef3 J.","year":"2014","unstructured":"J. Kone\u010dn\u1ef3 , Z. Qu , and P. Richt\u00e1rik . Semi-stochastic coordinate descent. arXiv preprint arXiv:1412.6293 , 2014 . J. Kone\u010dn\u1ef3, Z. Qu, and P. Richt\u00e1rik. Semi-stochastic coordinate descent. arXiv preprint arXiv:1412.6293, 2014."},{"key":"e_1_3_2_1_19_1","volume-title":"Semi-stochastic gradient descent methods. arXiv:1312.1666","author":"Kone\u010dn\u1ef3 J.","year":"2013","unstructured":"J. Kone\u010dn\u1ef3 and P. Richt\u00e1rik . Semi-stochastic gradient descent methods. arXiv:1312.1666 , 2013 . J. Kone\u010dn\u1ef3 and P. Richt\u00e1rik. Semi-stochastic gradient descent methods. arXiv:1312.1666, 2013."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1005332.1005345"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.3934\/ipi.2009.3.487"},{"key":"e_1_3_2_1_22_1","volume-title":"http:\/\/archive.ics.uci.edu\/ml","author":"Lichman M.","year":"2013","unstructured":"M. Lichman . UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml , 2013 . M. Lichman. UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml, 2013."},{"key":"e_1_3_2_1_23_1","volume-title":"An accelerated proximal coordinate gradient method and its application to regularized empirical risk minimization. arXiv preprint arXiv:1407.1296","author":"Lin Q.","year":"2014","unstructured":"Q. Lin , Z. Lu , and L. Xiao . An accelerated proximal coordinate gradient method and its application to regularized empirical risk minimization. arXiv preprint arXiv:1407.1296 , 2014 . Q. Lin, Z. Lu, and L. Xiao. An accelerated proximal coordinate gradient method and its application to regularized empirical risk minimization. arXiv preprint arXiv:1407.1296, 2014."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/0716071"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553458"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0800-2"},{"key":"e_1_3_2_1_27_1","volume-title":"Incremental majorization-minimization optimization with application to large-scale machine learning. arXiv:1402.4419","author":"Mairal J.","year":"2014","unstructured":"J. Mairal . Incremental majorization-minimization optimization with application to large-scale machine learning. arXiv:1402.4419 , 2014 . J. Mairal. Incremental majorization-minimization optimization with application to large-scale machine learning. arXiv:1402.4419, 2014."},{"key":"e_1_3_2_1_28_1","volume-title":"Journal of the American Statistical Association","author":"Mazumder R.","year":"2012","unstructured":"R. Mazumder , J. H. Friedman , and T. Hastie . Sparsenet: Coordinate descent with nonconvex penalties . Journal of the American Statistical Association , 2012 . R. Mazumder, J. H. Friedman, and T. Hastie. Sparsenet: Coordinate descent with nonconvex penalties. Journal of the American Statistical Association, 2012."},{"key":"e_1_3_2_1_29_1","first-page":"1017","volume-title":"Advances in Neural Information Processing Systems","author":"Needell D.","year":"2014","unstructured":"D. Needell , R. Ward , and N. Srebro . Stochastic gradient descent, weighted sampling, and the randomized kaczmarz algorithm . In Advances in Neural Information Processing Systems , pages 1017 -- 1025 , 2014 . D. Needell, R. Ward, and N. Srebro. Stochastic gradient descent, weighted sampling, and the randomized kaczmarz algorithm. In Advances in Neural Information Processing Systems, pages 1017--1025, 2014."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/100802001"},{"key":"e_1_3_2_1_32_1","volume-title":"Gradient methods for minimizing composite objective function. Technical report","author":"Nesterov Y.","year":"2007","unstructured":"Y. Nesterov Gradient methods for minimizing composite objective function. Technical report , Center for Operations Research and Econometrics , 2007 . Y. Nesterov et al. Gradient methods for minimizing composite objective function. Technical report, Center for Operations Research and Econometrics, 2007."},{"key":"e_1_3_2_1_33_1","volume-title":"Coordinate descent with arbitrary sampling i: Algorithms and complexity. arXiv preprint arXiv:1412.8060","author":"Qu Z.","year":"2014","unstructured":"Z. Qu and P. Richt\u00e1rik . Coordinate descent with arbitrary sampling i: Algorithms and complexity. arXiv preprint arXiv:1412.8060 , 2014 . Z. Qu and P. Richt\u00e1rik. Coordinate descent with arbitrary sampling i: Algorithms and complexity. arXiv preprint arXiv:1412.8060, 2014."},{"key":"e_1_3_2_1_34_1","volume-title":"Randomized dual coordinate ascent with arbitrary sampling. arXiv preprint arXiv:1411.5873","author":"Qu Z.","year":"2014","unstructured":"Z. Qu , P. Richt\u00e1rik , and T. Zhang . Randomized dual coordinate ascent with arbitrary sampling. arXiv preprint arXiv:1411.5873 , 2014 . Z. Qu, P. Richt\u00e1rik, and T. Zhang. Randomized dual coordinate ascent with arbitrary sampling. arXiv preprint arXiv:1411.5873, 2014."},{"key":"e_1_3_2_1_35_1","volume-title":"Large-scale randomized-coordinate descent methods with non-separable linear constraints. arXiv preprint arXiv:1409.2617","author":"Reddi S.","year":"2014","unstructured":"S. Reddi , A. Hefny , C. Downey , A. Dubey , and S. Sra . Large-scale randomized-coordinate descent methods with non-separable linear constraints. arXiv preprint arXiv:1409.2617 , 2014 . S. Reddi, A. Hefny, C. Downey, A. Dubey, and S. Sra. Large-scale randomized-coordinate descent methods with non-separable linear constraints. arXiv preprint arXiv:1409.2617, 2014."},{"key":"e_1_3_2_1_36_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_1_37_1","volume-title":"Non-uniform stochastic average gradient method for training conditional random fields. arXiv preprint arXiv:1504.04406","author":"Schmidt M.","year":"2015","unstructured":"M. Schmidt , R. Babanezhad , M. O. Ahmed , A. Defazio , A. Clifton , and A. Sarkar . Non-uniform stochastic average gradient method for training conditional random fields. arXiv preprint arXiv:1504.04406 , 2015 . M. Schmidt, R. Babanezhad, M. O. Ahmed, A. Defazio, A. Clifton, and A. Sarkar. Non-uniform stochastic average gradient method for training conditional random fields. arXiv preprint arXiv:1504.04406, 2015."},{"key":"e_1_3_2_1_38_1","volume-title":"Minimizing finite sums with the stochastic average gradient. arXiv:1309.2388","author":"Schmidt M.","year":"2013","unstructured":"M. Schmidt , N. L. Roux , and F. Bach . Minimizing finite sums with the stochastic average gradient. arXiv:1309.2388 , 2013 . M. Schmidt, N. L. Roux, and F. Bach. Minimizing finite sums with the stochastic average gradient. arXiv:1309.2388, 2013."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2021059"},{"key":"e_1_3_2_1_40_1","volume-title":"Proximal stochastic dual coordinate ascent. arXiv:1211.2717","author":"Shalev-Shwartz S.","year":"2012","unstructured":"S. Shalev-Shwartz and T. Zhang . Proximal stochastic dual coordinate ascent. arXiv:1211.2717 , 2012 . S. Shalev-Shwartz and T. Zhang. Proximal stochastic dual coordinate ascent. arXiv:1211.2717, 2012."},{"key":"e_1_3_2_1_41_1","first-page":"378","volume-title":"Advances in Neural Information Processing Systems","author":"Shalev-Shwartz S.","year":"2013","unstructured":"S. Shalev-Shwartz and T. Zhang . Accelerated mini-batch stochastic dual coordinate ascent . In Advances in Neural Information Processing Systems , pages 378 -- 385 , 2013 . S. Shalev-Shwartz and T. Zhang. Accelerated mini-batch stochastic dual coordinate ascent. In Advances in Neural Information Processing Systems, pages 378--385, 2013."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/2567709.2502598"},{"key":"e_1_3_2_1_43_1","volume-title":"Optimization for machine learning","author":"Sra S.","year":"2012","unstructured":"S. Sra , S. Nowozin , and S. J. Wright . Optimization for machine learning . Mit Press , 2012 . S. Sra, S. Nowozin, and S. J. Wright. Optimization for machine learning. Mit Press, 2012."},{"key":"e_1_3_2_1_44_1","unstructured":"J. Stamper A. Niculescu-Mizil S. Ritter G. Gordon and K. Koedinger. Bridge to algebra dataset from kdd cup 2010 educational data mining challenge. http:\/\/pslcdatashop. web.cmu.edu\/KDDCup\/downloads.jsp 2010.  J. Stamper A. Niculescu-Mizil S. Ritter G. Gordon and K. Koedinger. Bridge to algebra dataset from kdd cup 2010 educational data mining challenge. http:\/\/pslcdatashop. web.cmu.edu\/KDDCup\/downloads.jsp 2010."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9030-4"},{"key":"e_1_3_2_1_46_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_1_47_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_1_48_1","volume-title":"Randomized block coordinate descent for online and stochastic optimization. arXiv preprint arXiv:1407.0107","author":"Wang H.","year":"2014","unstructured":"H. Wang and A. Banerjee . Randomized block coordinate descent for online and stochastic optimization. arXiv preprint arXiv:1407.0107 , 2014 . H. Wang and A. Banerjee. Randomized block coordinate descent for online and stochastic optimization. arXiv preprint arXiv:1407.0107, 2014."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOAS147"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1137\/140961791"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1137\/140983938"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2882977"},{"key":"e_1_3_2_1_53_1","volume-title":"Stochastic optimization with importance sampling. arXiv preprint arXiv:1401.2753","author":"Zhao P.","year":"2014","unstructured":"P. Zhao and T. Zhang . Stochastic optimization with importance sampling. arXiv preprint arXiv:1401.2753 , 2014 . P. Zhao and T. Zhang. Stochastic optimization with importance sampling. arXiv preprint arXiv:1401.2753, 2014."},{"key":"e_1_3_2_1_54_1","first-page":"3329","volume-title":"Advances in Neural Information Processing Systems","author":"Zhao T.","year":"2014","unstructured":"T. Zhao , M. Yu , Y. Wang , R. Arora , and H. Liu . Accelerated mini-batch randomized block coordinate descent method . In Advances in Neural Information Processing Systems , pages 3329 -- 3337 , 2014 . T. Zhao, M. Yu, Y. Wang, R. Arora, and H. Liu. Accelerated mini-batch randomized block coordinate descent method. In Advances in Neural Information Processing Systems, pages 3329--3337, 2014."}],"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.2939819","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2939672.2939819","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:04Z","timestamp":1750223224000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2939672.2939819"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,13]]},"references-count":54,"alternative-id":["10.1145\/2939672.2939819","10.1145\/2939672"],"URL":"https:\/\/doi.org\/10.1145\/2939672.2939819","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"}}]}}