{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:08:10Z","timestamp":1761808090532},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,11,18]],"date-time":"2016-11-18T00:00:00Z","timestamp":1479427200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10994-016-5609-1","type":"journal-article","created":{"date-parts":[[2016,11,18]],"date-time":"2016-11-18T21:06:02Z","timestamp":1479503162000},"page":"595-622","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Proximal average approximated incremental gradient descent for composite penalty regularized empirical risk minimization"],"prefix":"10.1007","volume":"106","author":[{"given":"Yiu-ming","family":"Cheung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Lou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,18]]},"reference":[{"key":"5609_CR1","unstructured":"Azadi, S., & Sra, S. (2014). Towards an optimal stochastic alternating direction method of multipliers. In Proceedings of the 31st international conference on machine learning (pp. 620\u2013628)."},{"issue":"2","key":"5609_CR2","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1137\/070687542","volume":"19","author":"HH Bauschke","year":"2008","unstructured":"Bauschke, H. H., Goebel, R., Lucet, Y., & Wang, X. (2008). The proximal average: Basic theory. SIAM Journal on Optimization, 19(2), 766\u2013785.","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"5609_CR3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., & Teboulle, M. (2009). A fast iterative shrinkage\u2013thresholding algorithm for linear inverse problems. SIAM Journal on Imaging Sciences, 2(1), 183\u2013202.","journal-title":"SIAM Journal on Imaging Sciences"},{"key":"5609_CR4","volume-title":"Convex analysis and nonlinear optimization: Theory and examples","author":"JM Borwein","year":"2010","unstructured":"Borwein, J. M., & Lewis, A. S. (2010). Convex analysis and nonlinear optimization: Theory and examples. Berlin: Springer."},{"key":"5609_CR5","doi-asserted-by":"crossref","unstructured":"Bottou, L. (2010). Large-scale machine learning with stochastic gradient descent. In Proceedings of COMPSTAT\u20192010 (pp. 177\u2013186). Berlin: Springer.","DOI":"10.1007\/978-3-7908-2604-3_16"},{"issue":"1","key":"5609_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011). Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning, 3(1), 1\u2013122.","journal-title":"Foundations and Trends in Machine Learning"},{"key":"5609_CR7","unstructured":"Defazio, A., Bach, F., & Lacoste-Julien, S. (2014a). Saga: A fast incremental gradient method with support for non-strongly convex composite objectives. In NIPS. arXiv:1407.0202 ."},{"key":"5609_CR8","unstructured":"Defazio, A., Domke, J., & Caetano, T. (2014b). Finito: A faster, permutable incremental gradient method for big data problems. In Proceedings of the 31st international conference on machine learning (ICML-14) (pp. 1125\u20131133)."},{"issue":"4","key":"5609_CR9","doi-asserted-by":"crossref","first-page":"1469","DOI":"10.1137\/110848864","volume":"22","author":"S Ghadimi","year":"2012","unstructured":"Ghadimi, S., & Lan, G. (2012). Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization. I: A generic algorithmic framework. SIAM Journal on Optimization, 22(4), 1469\u20131492.","journal-title":"SIAM Journal on Optimization"},{"key":"5609_CR10","unstructured":"Gong, P., Zhang, C., Lu, Z., Huang, J., & Ye, J. (2013). A general iterative shrinkage and thresholding algorithm for non-convex regularized optimization problems. In Proceedings of the 30th international conference on machine learning (pp. 37\u201345)."},{"key":"5609_CR11","doi-asserted-by":"crossref","unstructured":"Jacob, L., Vert, J., & Obozinski, G.\u00a0R. (2009). Group lasso with overlap and graph lasso. In Proceedings of the 26th international conference on machine learning (ICML-09) (p.\u00a055).","DOI":"10.1145\/1553374.1553431"},{"key":"5609_CR12","unstructured":"Johnson, R., & Zhang, T. (2013). Accelerating stochastic gradient descent using predictive variance reduction. In Advances in neural information processing systems (pp. 315\u2013323)."},{"issue":"8","key":"5609_CR13","doi-asserted-by":"crossref","first-page":"e1000587","DOI":"10.1371\/journal.pgen.1000587","volume":"5","author":"S Kim","year":"2009","unstructured":"Kim, S., & Xing, E. P. (2009). Statistical estimation of correlated genome associations to a quantitative trait network. PLoS Genetics, 5(8), e1000587.","journal-title":"PLoS Genetics"},{"key":"5609_CR14","unstructured":"Kone\u010dn\u1ef3, J., & Richt\u00e1rik, P. (2013). Semi-stochastic gradient descent methods. arXiv:1312.1666 ."},{"key":"5609_CR15","unstructured":"Lacoste-Julien, S., Schmidt, M., & Bach, F. (2012). A simpler approach to obtaining an o (1\/t) convergence rate for the projected stochastic subgradient method. arXiv:1212.2002 ."},{"key":"5609_CR16","unstructured":"Lu, Z. (2012). Sequential convex programming methods for a class of structured nonlinear programming. arXiv:1210.3039 ."},{"key":"5609_CR17","unstructured":"Mairal, J. (2014). Incremental majorization-minimization optimization with application to large-scale machine learning. arXiv:1402.4419 ."},{"key":"5609_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory lectures on convex optimization: A basic course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y., & Nesterov, I. U. E. (2004). Introductory lectures on convex optimization: A basic course (Vol. 87). London: Springer."},{"key":"5609_CR19","unstructured":"Ouyang, H., He, N., Tran, L., & Gray, A. (2013). Stochastic alternating direction method of multipliers. In Proceedings of the 30th international conference on machine learning (pp. 80\u201388)."},{"key":"5609_CR20","first-page":"2663","volume-title":"Advances in neural information processing systems","author":"NL Roux","year":"2012","unstructured":"Roux, N. L., Schmidt, M., & Bach, F. R. (2012). A stochastic gradient method with an exponential convergence rate for finite training sets. In F. Pereira, C. J. C. Burges, L. Bottou, & K. Q. Weinberger (Eds.), Advances in neural information processing systems (Vol. 25, pp. 2663\u20132671). Newry: Curran Associates."},{"issue":"1","key":"5609_CR21","first-page":"567","volume":"14","author":"S Shalev-Shwartz","year":"2013","unstructured":"Shalev-Shwartz, S., & Zhang, T. (2013). Stochastic dual coordinate ascent methods for regularized loss. The Journal of Machine Learning Research, 14(1), 567\u2013599.","journal-title":"The Journal of Machine Learning Research"},{"key":"5609_CR22","unstructured":"Shamir, O., & Zhang, T. (2013). Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes. In Proceedings of the 30th international conference on machine learning (pp. 71\u201379)."},{"issue":"490","key":"5609_CR23","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1198\/jasa.2010.tm09380","volume":"105","author":"X Shen","year":"2010","unstructured":"Shen, X., & Huang, H.-C. (2010). Grouping pursuit through a regularization solution surface. Journal of the American Statistical Association, 105(490), 727\u2013739.","journal-title":"Journal of the American Statistical Association"},{"key":"5609_CR24","unstructured":"Suzuki, T. (2013). Dual averaging and proximal gradient descent for online alternating direction multiplier method. In Proceedings of the 30th international conference on machine learning (ICML-13) (pp. 392\u2013400)."},{"key":"5609_CR25","unstructured":"Suzuki, T. (2014). Stochastic dual coordinate ascent with alternating direction method of multipliers. In Proceedings of the 31st international conference on machine learning (pp. 736\u2013744)."},{"key":"5609_CR26","unstructured":"Xiang, S., Tong, X., & Ye, J. (2013). Efficient sparse group feature selection via nonconvex optimization. In Proceedings of the 30th international conference on machine learning (ICML-13) (pp. 284\u2013292)."},{"key":"5609_CR27","first-page":"2543","volume":"11","author":"L Xiao","year":"2010","unstructured":"Xiao, L. (2010). Dual averaging methods for regularized stochastic learning and online optimization. Journal of Machine Learning Research, 11, 2543\u20132596.","journal-title":"Journal of Machine Learning Research"},{"key":"5609_CR28","unstructured":"Xiao, L., & Zhang, T. (2014). A proximal stochastic gradient method with progressive variance reduction. arXiv:1403.4699 ."},{"key":"5609_CR29","unstructured":"Yu, Y.-L. (2013). Better approximation and faster algorithm using the proximal average. In Advances in neural information processing systems (pp. 458\u2013466)."},{"key":"5609_CR30","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"C-H Zhang","year":"2010","unstructured":"Zhang, C.-H. (2010). Nearly unbiased variable selection under minimax concave penalty. The Annals of Statistics, 38, 894\u2013942.","journal-title":"The Annals of Statistics"},{"key":"5609_CR31","first-page":"1081","volume":"11","author":"T Zhang","year":"2010","unstructured":"Zhang, T. (2010). Analysis of multi-stage convex relaxation for sparse regularization. The Journal of Machine Learning Research, 11, 1081\u20131107.","journal-title":"The Journal of Machine Learning Research"},{"key":"5609_CR32","unstructured":"Zheng, S., & Kwok J.\u00a0T. (2016). Fast-and-light stochastic ADMM. arXiv:1604.07070 ."},{"key":"5609_CR33","unstructured":"Zhong, W., & Kwok, J. (2014a). Fast stochastic alternating direction method of multipliers. In Proceedings of the 31st international conference on machine learning (pp. 46\u201354)."},{"key":"5609_CR34","doi-asserted-by":"crossref","unstructured":"Zhong, W., & Kwok, J. (2014b). Gradient descent with proximal average for nonconvex and composite regularization. In AAAI conference on artificial intelligence.","DOI":"10.1609\/aaai.v28i1.8994"},{"key":"5609_CR35","unstructured":"Zhong, L.\u00a0W., & Kwok, J.\u00a0T. (2014c). Accelerated stochastic gradient method for composite regularization. In Proceedings of the seventeenth international conference on artificial intelligence and statistics (pp. 1086\u20131094)."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-016-5609-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-016-5609-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-016-5609-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,14]],"date-time":"2022-07-14T04:28:48Z","timestamp":1657772928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-016-5609-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,18]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["5609"],"URL":"https:\/\/doi.org\/10.1007\/s10994-016-5609-1","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,18]]}}}