{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:40:40Z","timestamp":1740148840648,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T00:00:00Z","timestamp":1640822400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T00:00:00Z","timestamp":1640822400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003398","name":"Shanxi Scholarship Council of China","doi-asserted-by":"publisher","award":["No.2017-104"],"award-info":[{"award-number":["No.2017-104"]}],"id":[{"id":"10.13039\/501100003398","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s12190-021-01684-w","type":"journal-article","created":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T15:02:11Z","timestamp":1640876531000},"page":"3747-3766","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A new accelerated proximal boosting machine with convergence rate $$O(1\/t^2)$$"],"prefix":"10.1007","volume":"68","author":[{"given":"Jinxiang","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4862-2805","authenticated-orcid":false,"given":"Fusheng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Na","family":"Zhen","sequence":"additional","affiliation":[]},{"given":"Yiming","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,30]]},"reference":[{"issue":"2","key":"1684_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/BF00116037","volume":"5","author":"RE Schapire","year":"1990","unstructured":"Schapire, R.E.: The strength of weak learnability. Mach. Learn. 5(2), 197\u2013227 (1990)","journal-title":"Mach. Learn."},{"issue":"2","key":"1684_CR2","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1006\/inco.1995.1136","volume":"121","author":"Y Freund","year":"1995","unstructured":"Freund, Y.: Boosting a weak learning algorithm by majority. Inf. Comput. 121(2), 256\u2013285 (1995)","journal-title":"Inf. Comput."},{"key":"1684_CR3","first-page":"148","volume":"96","author":"Y Freund","year":"1996","unstructured":"Freund, Y., Schapire, R.E.: Experiments with a new boosting algorithm. ICML 96, 148\u2013156 (1996)","journal-title":"ICML"},{"issue":"1","key":"1684_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y Freund","year":"1997","unstructured":"Freund, Y., Schapire, R.E.: A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci. 55(1), 119\u2013139 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"1684_CR5","unstructured":"Breiman, L.: Arcing the edge, Technical report, Technical Report 486. University of California, Statistics Department (1997)"},{"issue":"3","key":"1684_CR6","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1214\/aos\/1024691079","volume":"26","author":"L Breiman","year":"1998","unstructured":"Breiman, L.: Arcing classifier (with discussion and a rejoinder by the author). Ann. Stat. 26(3), 801\u2013849 (1998)","journal-title":"Ann. Stat."},{"issue":"7","key":"1684_CR7","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1162\/089976699300016106","volume":"11","author":"L Breiman","year":"1999","unstructured":"Breiman, L.: Prediction games and arcing algorithms. Neural Comput. 11(7), 1493\u20131517 (1999)","journal-title":"Neural Comput."},{"key":"1684_CR8","unstructured":"Breiman, L.: Some infinity theory for predictor ensembles, Technical Report, Technical Report 579. Statistics Dept, UCB (2000)"},{"issue":"1","key":"1684_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/aos\/1079120126","volume":"32","author":"L Breiman","year":"2004","unstructured":"Breiman, L.: Population theory for boosting ensembles. Ann. Stat. 32(1), 1\u201311 (2004)","journal-title":"Ann. Stat."},{"issue":"2","key":"1684_CR10","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1214\/aos\/1016218223","volume":"28","author":"JH Friedman","year":"2000","unstructured":"Friedman, J.H., Hastie, T., Tibshirani, R., et al.: Additive logistic regression: a statistical view of boosting (with discussion and a rejoinder by the authors). Ann. Stat. 28(2), 337\u2013407 (2000)","journal-title":"Ann. Stat."},{"key":"1684_CR11","doi-asserted-by":"crossref","unstructured":"Friedman, J.H.: Greedy function approximation: a gradient boosting machine. Ann. Stat. pp. 1189-1232 (2001)","DOI":"10.1214\/aos\/1013203451"},{"issue":"4","key":"1684_CR12","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/S0167-9473(01)00065-2","volume":"38","author":"JH Friedman","year":"2002","unstructured":"Friedman, J.H.: Stochastic gradient boosting. Comput. Stat. Data Anal. 38(4), 367\u2013378 (2002)","journal-title":"Comput. Stat. Data Anal."},{"key":"1684_CR13","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., et al.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"1684_CR14","first-page":"1235","volume":"17","author":"X Meng","year":"2016","unstructured":"Meng, X., Bradley, J., Yavuz, B., Sparks, E., Venkataraman, S., Liu, D., Freeman, J., Tsai, D.B., Amde, M., Owen, S., et al.: Mllib: machine learning in apache spark. J. Mach. Learn. Res. 17(1), 1235\u20131241 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"1684_CR15","doi-asserted-by":"crossref","unstructured":"Chen, T., Guestrin, C.: Xgboost: A scalable tree boosting system. In: Proceedings of the 22nd ACM Sigkdd International Conference on Knowledge Discovery and Data Mining, pp. 785\u2013794 (2016)","DOI":"10.1145\/2939672.2939785"},{"key":"1684_CR16","unstructured":"Ke, G. Meng, Q. Finley, T., Wang, T., Chen, W., Ma, W., Ye, Q., Liu, T.-Y.: Lightgbm: A highly efficient gradient boosting decision tree. Adv. Neural Inf. Process. Syst., 3146\u20133154 (2017)"},{"key":"1684_CR17","doi-asserted-by":"crossref","unstructured":"Ponomareva, N., Radpour, S., Hendry, G., Haykal, S., Colthurst, T., Mitrichev, P., Grushetsky, A.: Tf boosted trees: a scalable tensorflow based framework for gradient boosting. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, Springer, pp. 423\u2013427 (2017)","DOI":"10.1007\/978-3-319-71273-4_44"},{"issue":"3","key":"1684_CR18","doi-asserted-by":"publisher","first-page":"1556","DOI":"10.1109\/TCYB.2019.2957101","volume":"51","author":"K Wang","year":"2019","unstructured":"Wang, K., Wang, Y., Zhao, Q., Meng, D., Liao, X., Zongben, X.: Splboost: an improved robust boosting algorithm based on self-paced learning. IEEE Trans. Cybern. 51(3), 1556\u20131570 (2019)","journal-title":"IEEE Trans. Cybern."},{"key":"1684_CR19","first-page":"512","volume":"12","author":"L Mason","year":"1999","unstructured":"Mason, L., Baxter, J., Bartlett, P., Frean, M.: Boosting algorithms as gradient descent. Adv. Neural Inf. Process. Syst. 12, 512\u2013518 (1999)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"1\u20133","key":"1684_CR20","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1023\/A:1013912006537","volume":"48","author":"M Collins","year":"2002","unstructured":"Collins, M., Schapire, R.E., Singer, Y.: Logistic regression, AdaBoost and Bregman distances. Mach. Learn. 48(1\u20133), 253\u2013285 (2002)","journal-title":"Mach. Learn."},{"issue":"5","key":"1684_CR21","first-page":"705","volume":"7","author":"PJ Bickel","year":"2006","unstructured":"Bickel, P.J., Ritov, Y., Zakai, A.: Some theory for generalized boosting algorithms. J. Mach. Learn. Res. 7(5), 705\u2013732 (2006)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"1684_CR22","first-page":"561","volume":"13","author":"M Telgarsky","year":"2012","unstructured":"Telgarsky, M.: A primal-dual convergence analysis of boosting. J. Mach. Learn. Res. 13(1), 561\u2013606 (2012)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"1684_CR23","doi-asserted-by":"publisher","first-page":"2780","DOI":"10.1137\/18M1223277","volume":"30","author":"L Haihao","year":"2020","unstructured":"Haihao, L., Mazumder, R.: Randomized gradient boosting machine. SIAM J. Optim. 30(4), 2780\u20132808 (2020)","journal-title":"SIAM J. Optim."},{"key":"1684_CR24","unstructured":"Wang, C., Wang, Y., Schapire, R. et al.: Functional Frank\u2013Wolfe boosting for general loss functions. arXiv preprint arXiv:1510.02558 (2015)"},{"issue":"6","key":"1684_CR25","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1007\/s10994-019-05787-1","volume":"108","author":"G Biau","year":"2019","unstructured":"Biau, G., Cadre, B., Rouv\u00ed\u00e9re, L.: Accelerated gradient boosting. Mach. Learn. 108(6), 971\u2013992 (2019)","journal-title":"Mach. Learn."},{"key":"1684_CR26","unstructured":"Lu, H., Karimireddy, S.P., Ponomareva, N., Mirrokni, V.: Accelerating gradient boosting machines. In: International Conference on Artificial Intelligence and Statistics, pp. 516\u2013526 (2020)"},{"key":"1684_CR27","unstructured":"Fouillen, E., Boyer, C., Sangnier, M.: Proximal boosting and its acceleration. arXiv-1808 (2018)"},{"key":"1684_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"YE Nesterov","year":"2004","unstructured":"Nesterov, Y.E.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publishers, Dordrech (2004)"},{"key":"1684_CR29","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex-concave optimization. University of Washington, Tech. Rep. (2008)"},{"issue":"3","key":"1684_CR30","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 127\u2013239 (2014)","journal-title":"Found. Trends Optim."},{"issue":"462","key":"1684_CR31","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1198\/016214503000125","volume":"98","author":"P B\u00fchlmann","year":"2003","unstructured":"B\u00fchlmann, P., Bin, Yu.: Boosting with the l2 loss: regression and classification. J. Am. Stat. Assoc. 98(462), 324\u2013339 (2003)","journal-title":"J. Am. Stat. Assoc."},{"issue":"4","key":"1684_CR32","doi-asserted-by":"publisher","first-page":"1538","DOI":"10.1214\/009053605000000255","volume":"33","author":"T Zhang","year":"2005","unstructured":"Zhang, T., Bin, Yu., et al.: Boosting with early stopping: convergence and consistency. Ann. Stat. 33(4), 1538\u20131579 (2005)","journal-title":"Ann. Stat."},{"issue":"10","key":"1684_CR33","first-page":"2347","volume":"8","author":"PL Bartlett","year":"2007","unstructured":"Bartlett, P.L., Traskin, M.: Adaboost is consistent. J. Mach. Learn. Res. 8(10), 2347\u20132368 (2007)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-021-01684-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-021-01684-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-021-01684-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T16:13:15Z","timestamp":1670256795000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-021-01684-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,30]]},"references-count":33,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["1684"],"URL":"https:\/\/doi.org\/10.1007\/s12190-021-01684-w","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2021,12,30]]},"assertion":[{"value":"7 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}