{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T01:15:10Z","timestamp":1776474910454,"version":"3.51.2"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T00:00:00Z","timestamp":1559779200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T00:00:00Z","timestamp":1559779200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11401524, 11531013"],"award-info":[{"award-number":["11401524, 11531013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11571078, 11631015"],"award-info":[{"award-number":["11571078, 11631015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSFC\/RGC Joint Research Fund","award":["11461161006, CityU 104012"],"award-info":[{"award-number":["11461161006, CityU 104012"]}]},{"DOI":"10.13039\/501100012242","name":"Program of Shanghai Subject Chief Scientist","doi-asserted-by":"crossref","award":["18XD1400700"],"award-info":[{"award-number":["18XD1400700"]}],"id":[{"id":"10.13039\/501100012242","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10444-019-09707-8","type":"journal-article","created":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T09:02:36Z","timestamp":1559811756000},"page":"2745-2770","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Fast and strong convergence of online learning algorithms"],"prefix":"10.1007","volume":"45","author":[{"given":"Zheng-Chu","family":"Guo","sequence":"first","affiliation":[]},{"given":"Lei","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,6]]},"reference":[{"issue":"3","key":"9707_CR1","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1090\/S0002-9947-1950-0051437-7","volume":"68","author":"N Aronszajn","year":"1950","unstructured":"Aronszajn, N.: Theory of reproducing kernels. Trans. Am. Math. Soc. 68(3), 337\u2013404 (1950)","journal-title":"Trans. Am. Math. Soc."},{"issue":"3","key":"9707_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1070\/SM1967v002n03ABEH002343","volume":"2","author":"MS Birman","year":"1967","unstructured":"Birman, M.S., Solomjak, M.Z.: Piecewise-polynomial approximations of functions of the classes ${W}_{p}^{\\alpha }$. Math. USSR-Sbornik 2(3), 295\u2013317 (1967)","journal-title":"Math. USSR-Sbornik"},{"issue":"Aug","key":"9707_CR3","first-page":"1875","volume":"9","author":"ML Braun","year":"2008","unstructured":"Braun, M.L., Buhmann, J.M., M\u00fcller, K.-R.: On relevant dimensions in kernel feature spaces. J. Mach. Learn. Res. 9(Aug), 1875\u20131908 (2008)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"9707_CR4","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10208-006-0196-8","volume":"7","author":"A Caponnetto","year":"2007","unstructured":"Caponnetto, A., DeVito, E.: Optimal rates for the regularized least squares algorithm. Found. Comput. Math. 7(3), 331\u2013368 (2007)","journal-title":"Found. Comput. Math."},{"key":"9707_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511618796","volume-title":"Learning Theory: an Approximation Theory Viewpoint","author":"F Cucker","year":"2007","unstructured":"Cucker, F., Zhou, D.X.: Learning Theory: an Approximation Theory Viewpoint. Cambridge University Press, Cambridge (2007)"},{"issue":"1","key":"9707_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10444-007-9061-4","volume":"30","author":"S Didas","year":"2009","unstructured":"Didas, S., Setzer, S., Steidl, G.: Combined \u2113\n2 data and gradient fitting in conjunction with \u2113\n1 regularization. Adv. Comput. Math. 30(1), 79\u201399 (2009)","journal-title":"Adv. Comput. Math."},{"issue":"4","key":"9707_CR7","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1214\/15-AOS1391","volume":"44","author":"A Dieuleveut","year":"2016","unstructured":"Dieuleveut, A., Bach, F.: Nonparametric stochastic approximation with large step-sizes. Ann. Stat. 44(4), 1363\u20131399 (2016)","journal-title":"Ann. Stat."},{"key":"9707_CR8","volume-title":"Smoothing Spline ANOVA Models. Springer Series in Statistics","author":"C Gu","year":"2002","unstructured":"Gu, C.: Smoothing Spline ANOVA Models. Springer Series in Statistics. Springer, New York (2002)"},{"issue":"1","key":"9707_CR9","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10444-016-9479-7","volume":"43","author":"ZC Guo","year":"2017","unstructured":"Guo, Z.C., Ying, Y., Zhou, D.X.: Online regularized learning with pairwise loss functions. Adv. Comput. Math. 43(1), 127\u2013150 (2017)","journal-title":"Adv. Comput. Math."},{"issue":"8","key":"9707_CR10","doi-asserted-by":"publisher","first-page":"2165","DOI":"10.1109\/TSP.2004.830991","volume":"52","author":"J Kivinen","year":"2004","unstructured":"Kivinen, J., Smola, A.J., Williamson, R.C.: Online learning with kernels. IEEE Trans. Signal Process. 52(8), 2165\u20132176 (2004)","journal-title":"IEEE Trans. Signal Process."},{"issue":"171","key":"9707_CR11","first-page":"1","volume":"18","author":"Y Lei","year":"2018","unstructured":"Lei, Y., Shi, L., Guo, Z.C.: Convergence of unregularized online learning algorithms. J. Mach. Learn. Res. 18(171), 1\u201333 (2018)","journal-title":"J. Mach. Learn. Res."},{"key":"9707_CR12","unstructured":"Lin, J., Rosasco, L.: Optimal learning for multi-pass stochastic gradient methods. In: Advances in Neural Information Processing Systems, pp 4556\u20134564 (2016)"},{"issue":"1","key":"9707_CR13","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1214\/09-AOS728","volume":"38","author":"S Mendelson","year":"2010","unstructured":"Mendelson, S., Neeman, J.: Regularization in kernel learning. Ann. Stat. 38(1), 526\u2013565 (2010)","journal-title":"Ann. Stat."},{"key":"9707_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-5567-9","volume-title":"The Bochner Integral","author":"J Mikusi\u0144ski","year":"1978","unstructured":"Mikusi\u0144ski, J.: The Bochner Integral. Birkh\u00e4user, Basel (1978)"},{"issue":"4","key":"9707_CR15","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19 (4), 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"9707_CR16","unstructured":"Pillaud-Vivien, L., Alessandro, R., Francis, B.: Statistical optimality of stochastic gradient descent on hard learning problems through multiple passes. In: Advances in Neural Information Processing Systems, pp 8114\u20138124 (2018)"},{"key":"9707_CR17","unstructured":"Rakhlin, A., Shamir, O., Sridharan, K.: Making gradient descent optimal for strongly convex stochastic optimization. In: Proceedings of the 29th International Conference on Machine Learning (ICML-12), pp 449\u2013456 (2012)"},{"key":"9707_CR18","unstructured":"Rosasco, L., Tacchetti, A., Villa, S.: Regularization by early stopping for online learning algorithms. arXiv:\n1405.0042\n\n (2014)"},{"issue":"1","key":"9707_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-010-0420-4","volume":"127","author":"S Shalev-Shwartz","year":"2011","unstructured":"Shalev-Shwartz, S., Singer, Y., Srebro, N., Cotter, A.: Pegasos: primal estimated sub-gradient solver for svm. Math. Program. 127(1), 3\u201330 (2011)","journal-title":"Math. Program."},{"issue":"1","key":"9707_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1142\/S0219530503000089","volume":"1","author":"S Smale","year":"2003","unstructured":"Smale, S., Zhou, D.X.: Estimating the approximation error in learning theory. Anal. Appl. 1(1), 17\u201341 (2003)","journal-title":"Anal. Appl."},{"issue":"2","key":"9707_CR21","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10208-004-0160-z","volume":"6","author":"S Smale","year":"2006","unstructured":"Smale, S., Yao, Y.: Online learning algorithms. Found. Comput. Math. 6 (2), 145\u2013170 (2006)","journal-title":"Found. Comput. Math."},{"issue":"2","key":"9707_CR22","doi-asserted-by":"publisher","first-page":"153C","DOI":"10.1007\/s00365-006-0659-y","volume":"26","author":"S Smale","year":"2007","unstructured":"Smale, S., Zhou, D.X.: Learning theory estimates via integral of operators and their approximations. Constr. Approx. 26(2), 153C\u2013172 (2007)","journal-title":"Constr. Approx."},{"key":"9707_CR23","volume-title":"Support Vector Machines","author":"I Steinwart","year":"2008","unstructured":"Steinwart, I., Christmann, A.: Support Vector Machines. Springer, New York (2008)"},{"key":"9707_CR24","unstructured":"Steinwart, I., Hush, D.R., Scovel, C.: Optimal rates for regularized least squares regression. In: Conference on Learning Theory (2009)"},{"key":"9707_CR25","unstructured":"Sutskever, I., Martens, J., Dahl, G., Hinton, G.: On the importance of initialization and momentum in deep learning. In: International Conference on Machine Learning, pp 1139\u20131147 (2013)"},{"issue":"9","key":"9707_CR26","doi-asserted-by":"publisher","first-page":"5716","DOI":"10.1109\/TIT.2014.2332531","volume":"60","author":"P Tarres","year":"2014","unstructured":"Tarres, P., Yao, Y.: Online learning as stochastic approximation of regularization paths: optimality and almost-sure convergence. IEEE Trans. Inf. Theory 60(9), 5716\u20135735 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9707_CR27","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970128","volume-title":"Spline Models for Observational Data","author":"G Wahba","year":"1990","unstructured":"Wahba, G.: Spline Models for Observational Data. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1990)"},{"key":"9707_CR28","volume-title":"Scattered Data Approximation","author":"H Wendland","year":"2005","unstructured":"Wendland, H.: Scattered Data Approximation. Cambridge University Press, Cambridge (2005)"},{"issue":"12","key":"9707_CR29","doi-asserted-by":"publisher","first-page":"6470","DOI":"10.1109\/TIT.2010.2079010","volume":"56","author":"Y Yao","year":"2010","unstructured":"Yao, Y.: On complexity issues of online learning algorithms. IEEE Trans. Inf. Theory 56(12), 6470\u20136481 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"9707_CR30","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s00365-006-0663-2","volume":"26","author":"Y Yao","year":"2007","unstructured":"Yao, Y., Rosasco, L., Caponnetto, A.: On early stopping in gradient descent learning. Constr. Approx. 26(2), 289\u2013315 (2007)","journal-title":"Constr. Approx."},{"issue":"3","key":"9707_CR31","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10444-005-9002-z","volume":"27","author":"Y Ying","year":"2007","unstructured":"Ying, Y.: Convergence analysis of online algorithms. Adv. Comput. Math. 27 (3), 273\u2013291 (2007)","journal-title":"Adv. Comput. Math."},{"issue":"5","key":"9707_CR32","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s10208-006-0237-y","volume":"8","author":"Y Ying","year":"2008","unstructured":"Ying, Y., Pontil, M.: Online gradient descent learning algorithms. Found. Comput. Math. 8(5), 561\u2013596 (2008)","journal-title":"Found. Comput. Math."},{"issue":"11","key":"9707_CR33","doi-asserted-by":"publisher","first-page":"4775","DOI":"10.1109\/TIT.2006.883632","volume":"52","author":"Y Ying","year":"2006","unstructured":"Ying, Y., Zhou, D.X.: Online regularized classification algorithms. IEEE Trans. Inf. Theory 52(11), 4775\u20134788 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"9707_CR34","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1162\/NECO_a_00817","volume":"28","author":"Y Ying","year":"2016","unstructured":"Ying, Y., Zhou, D.X.: Online Online pairwise learning algorithms. Neural Comput. 28(4), 743\u2013777 (2016)","journal-title":"Neural Comput."},{"issue":"42","key":"9707_CR35","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.acha.2015.08.007","volume":"2","author":"Y Ying","year":"2017","unstructured":"Ying, Y., Zhou, D.X.: Unregularized online learning algorithms with general loss functions. Appl. Comput. Harmon. Anal. 2(42), 224\u2013244 (2017)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"4","key":"9707_CR36","doi-asserted-by":"publisher","first-page":"1538","DOI":"10.1214\/009053605000000255","volume":"33","author":"T Zhang","year":"2005","unstructured":"Zhang, T., Yu, B.: Boosting with early stopping: convergence and consistency. Ann. Stat. 33(4), 1538\u20131579 (2005)","journal-title":"Ann. Stat."},{"issue":"3","key":"9707_CR37","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1006\/jcom.2002.0635","volume":"18","author":"DX Zhou","year":"2002","unstructured":"Zhou, D.X.: The covering number in learning theory. J. Complex. 18(3), 739\u2013767 (2002)","journal-title":"J. Complex."}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-019-09707-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10444-019-09707-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-019-09707-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,4]],"date-time":"2020-06-04T23:22:41Z","timestamp":1591312961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10444-019-09707-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,6]]},"references-count":37,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["9707"],"URL":"https:\/\/doi.org\/10.1007\/s10444-019-09707-8","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,6]]},"assertion":[{"value":"3 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}