{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:57:04Z","timestamp":1775012224412,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,10,1]],"date-time":"2005-10-01T00:00:00Z","timestamp":1128124800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2005,10,1]],"date-time":"2005-10-01T00:00:00Z","timestamp":1128124800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2005,10]]},"DOI":"10.1007\/s11122-006-0005-2","type":"journal-article","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T05:22:36Z","timestamp":1138166556000},"page":"368-384","source":"Crossref","is-referenced-by-count":55,"title":["Recursive Aggregation of Estimators by the Mirror Descent Algorithm with Averaging"],"prefix":"10.1007","volume":"41","author":[{"given":"A. B.","family":"Juditsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. V.","family":"Nazin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. B.","family":"Tsybakov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Vayatis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1022648800760","volume":"5","author":"R.E. Schapire","year":"1990","unstructured":"Schapire, R.E., The Strength of Weak Learnability, Machine Learning, 1990, vol. 5, no.2, pp. 197\u2013227.","journal-title":"Machine Learning"},{"issue":"2","key":"5_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, Inform. Comput., 1995, vol. 121, no.2, pp. 256\u2013285.","journal-title":"Inform. Comput."},{"issue":"5","key":"5_CR3","first-page":"1651","volume":"26","author":"R.E. Schapire","year":"1998","unstructured":"Schapire, R.E., Freund, Y., Bartlett, P.L., and Lee, W.S., Boosting the Margin: a New Explanation for the Effectiveness of Voting Methods, Ann. Statist., 1998, vol. 26, no.5, pp. 1651\u20131686.","journal-title":"Ann. Statist."},{"key":"5_CR4","volume-title":"Statistical Learning Theory","author":"V.N. Vapnik","year":"1998","unstructured":"Vapnik, V.N., Statistical Learning Theory, New York: Wiley, 1998."},{"key":"5_CR5","unstructured":"Bartlett, P.L, Jordan, M.I., and McAuliffe, J.D., Convexity, Classification, and Risk Bounds, Tech. Report of Dept. Statist., Univ. of California, Berkeley, 2003, no. 638."},{"issue":"1","key":"5_CR6","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1214\/aos\/1079120129","volume":"32","author":"G. Lugosi","year":"2004","unstructured":"Lugosi, G. and Vayatis, N., On the Bayes-Risk Consistency of Regularized Boosting Methods (With Discussion), Ann. Statist., 2004, vol. 32, no.1, pp. 30\u201355.","journal-title":"Ann. Statist."},{"key":"5_CR7","unstructured":"Scovel, J.C. and Steinwart, I., Fast Rates for Support Vector Machines, Los Alamos National Lab. Tech. Report, 2003, no. LA-UR-03-9117."},{"issue":"1","key":"5_CR8","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1214\/aos\/1079120130","volume":"32","author":"T. Zhang","year":"2004","unstructured":"Zhang, T., Statistical Behavior and Consistency of Classification Methods Based on Convex Risk Minimization (With Discussion), Ann. Statist., 2004, vol. 32, no.1, pp. 56\u201385.","journal-title":"Ann. Statist."},{"key":"5_CR9","volume-title":"Osnovy teorii obychayushchikhsya sistem","author":"Ya.Z. Tsypkin","year":"1970","unstructured":"Tsypkin, Ya.Z., Osnovy teorii obychayushchikhsya sistem, Moscow: Nauka, 1970. Translated under the title Foundations of the Theory of Learning Systems, New York: Academic, 1973."},{"key":"5_CR10","volume-title":"Metod potential'nykh funktsyi v teorii obycheniya mashin","author":"M.A. Aizerman","year":"1970","unstructured":"Aizerman, M.A., Braverman, E.M., and Rozonoer, L.I., Metod potential'nykh funktsyi v teorii obycheniya mashin (Method of Potential Functions in the Theory of Learning Machines), Moscow: Nauka, 1970."},{"key":"5_CR11","first-page":"281","volume":"87","author":"M. Aizerman","year":"1970","unstructured":"Aizerman, M., Braverman, E., and Rozonoer, L., Extrapolative Problems in Automatic Control and the Method of Potential Functions, Am. Math. Soc. Transl., 1970, vol. 87, pp. 281\u2013303.","journal-title":"Am. Math. Soc. Transl."},{"key":"5_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0711-5","volume-title":"A Probabilistic Theory of Pattern Recognition","author":"L. Devroye","year":"1996","unstructured":"Devroye, L., Gyorfi, L., and Lugosi, G., A Probabilistic Theory of Pattern Recognition, New York: Springer, 1996."},{"issue":"3","key":"5_CR13","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1137\/S0097539703432542","volume":"34","author":"N. Cesa-Bianchi","year":"2005","unstructured":"Cesa-Bianchi, N., Conconi, A., and Gentile, C., A Second-Order Perceptron Algorithm, SIAM J. Comput., 2005, vol. 34, no.3, pp. 640\u2013668.","journal-title":"SIAM J. Comput."},{"issue":"8","key":"5_CR14","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., and Williamson, R.C., Online Learning with Kernels, IEEE Trans. Signal Process., 2004, vol. 52, no.8, pp. 2165\u20132176.","journal-title":"IEEE Trans. Signal Process."},{"key":"5_CR15","first-page":"116","volume-title":"Proc. 21st Int. Conf. on Machine Learning, Banff, Alberta, Canada, 2004 (ICML'04)","author":"T. Zhang","year":"2004","unstructured":"Zhang, T., Solving Large Scale Linear Prediction Problems Using Stochastic Gradient Descent Algorithms, in Proc. 21st Int. Conf. on Machine Learning, Banff, Alberta, Canada, 2004 (ICML'04), New York: ACM, 2004, vol. 69, p. 116."},{"issue":"4","key":"5_CR16","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0330046","volume":"30","author":"B.T. Polyak","year":"1992","unstructured":"Polyak, B.T. and Juditsky, A.B., Acceleration of Stochastic Approximation by Averaging, SIAM J. Control Optim., 1992, vol. 30, no.4, pp. 838\u2013855.","journal-title":"SIAM J. Control Optim."},{"key":"5_CR17","volume-title":"Slozhnost' zadach i effektivnost' metodov optimizatsii","author":"A.S. Nemirovskii","year":"1979","unstructured":"Nemirovskii, A.S. and Yudin, D.B., Slozhnost' zadach i effektivnost' metodov optimizatsii, Moscow: Nauka, 1979. Translated under the title Problem Complexity and Method Efficiency in Optimization, Chichester: Wiley, 1983."},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1137\/S1052623499354564","volume":"12","author":"A. Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Margalit, T., and Nemirovski, A., The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography, SIAM J. Optim., 2001, vol. 12, no.1, pp. 79\u2013108.","journal-title":"SIAM J. Optim."},{"key":"5_CR19","unstructured":"Ben-Tal, A. and Nemirovski, A., The Conjugate Barrier Mirror Descent Method for Non-Smooth Convex Optimization, Preprint of the Faculty of Industr. Eng. Manag., Technion-Israel Inst. Technol., Haifa, 1999. Available at http:\/\/iew3.technion.ac.il\/Labs\/Opt\/opt\/Pap\/CP MD.pdf."},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1996.2612","volume":"132","author":"J. Kivinen","year":"1997","unstructured":"Kivinen, J. and Warmuth, M.K., Additive Versus Exponentiated Gradient Updates for Linear Prediction, Inform. Comput., 1997, vol. 132, no.1, pp. 1\u201364.","journal-title":"Inform. Comput."},{"issue":"6","key":"5_CR21","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1109\/72.809075","volume":"10","author":"D.P. Helmbold","year":"1999","unstructured":"Helmbold, D.P., Kivinen, J., and Warmuth, M.K., Relative Loss Bounds for Single Neurons, IEEE Trans. Neural Networks, 1999, vol. 10, no.6, pp. 1291\u20131304.","journal-title":"IEEE Trans. Neural Networks"},{"issue":"3","key":"5_CR22","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1023\/A:1017938623079","volume":"45","author":"J. Kivinen","year":"2001","unstructured":"Kivinen, J. and Warmuth, M.K., Relative Loss Bounds for Multidimensional Regression Problems, Machine Learning, 2001, vol. 45, no.3, pp. 301\u2013329.","journal-title":"Machine Learning"},{"key":"5_CR23","unstructured":"Cesa-Bianchi, N. and Gentile, C., Improved Risk Tail Bounds for On-Line Algorithms, Neural Information Processing Systems, NIPS 2004 Workshop on (Ab)Use of Bounds, Whistler, BC, Canada, December 18, 2004. Available at http:\/\/mercurio.srv.dsi.unimi.it\/\u223ccesabian\/Pubblicazioni\/iada.pdf."},{"issue":"9","key":"5_CR24","doi-asserted-by":"publisher","first-page":"2050","DOI":"10.1109\/TIT.2004.833339","volume":"50","author":"N. Cesa-Bianchi","year":"2004","unstructured":"Cesa-Bianchi, N., Conconi, A., and Gentile, C., On the Generalization Ability of On-Line Learning Algorithms, IEEE Trans. Inform. Theory, 2004, vol. 50, no.9, pp. 2050\u20132057.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"5_CR25","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1214\/aos\/1015951994","volume":"28","author":"A. Juditsky","year":"2000","unstructured":"Juditsky, A. and Nemirovski, A., Functional Aggregation for Nonparametric Estimation, Ann. Statist., 2000, vol. 28, no.3, pp. 681\u2013712.","journal-title":"Ann. Statist."},{"key":"5_CR26","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/978-3-540-45167-9_23","volume-title":"Computational Learning Theory and Kernel Machines","author":"A. Tsybakov","year":"2003","unstructured":"Tsybakov, A., Optimal Rates of Aggregation, Computational Learning Theory and Kernel Machines, Scholkopf, B. and Warmuth, M., Eds., Lecture Notes in Artificial Intelligence, Heidelberg: Springer, 2003, vol. 2777, pp. 303\u2013313."},{"key":"5_CR27","volume-title":"Teoriya raspoznavaniya obrazov","author":"V. Vapnik","year":"1974","unstructured":"Vapnik, V. and Chervonenkis, A., Teoriya raspoznavaniya obrazov, Moscow: Nauka, 1974. Translated under the title Theorie der Zeichenerkennung, Berlin: Akademie-Verlag, 1979."},{"key":"5_CR28","unstructured":"Breiman, L., Arcing the Edge, Tech. Rep. of Statist. Dept., Univ. of California, Berkeley, 1997, no. 486."},{"issue":"2","key":"5_CR29","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1214\/aos\/1016218223","volume":"28","author":"J. Friedman","year":"2000","unstructured":"Friedman, J., Hastie, T., and Tibshirani, R., Additive Logistic Regression: a Statistical View of Boosting (With Discussion and a Rejoinder by the Authors), Ann. Statist., 2000, vol. 28, no.2, pp. 337\u2013407.","journal-title":"Ann. Statist."},{"issue":"1","key":"5_CR30","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1214\/aos\/1079120131","volume":"32","author":"A. Tsybakov","year":"2004","unstructured":"Tsybakov, A., Optimal Aggregation of Classifiers in Statistical Learning, Ann. Statist., 2004, vol. 32, no.1, pp. 135\u2013166.","journal-title":"Ann. Statist."},{"key":"5_CR31","unstructured":"Tarigan, B. and van de Geer, S.A., Adaptivity of Support Vector Machines with \u21131 Penalty, Tech. Rep. of Math. Inst., Univ. of Leiden, Leiden, 2004, no. MI 2004-14. Available at http:\/\/www.math.leidenuniv.nl\/\u223cgeer\/svm4.pdf."},{"key":"5_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"R.T. Rockafellar","year":"1998","unstructured":"Rockafellar, R.T. and Wets, R.J.B., Variational Analysis, New York: Springer, 1998."},{"issue":"4","key":"5_CR33","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1137\/S0363012995281742","volume":"35","author":"K.C. Kiwiel","year":"1997","unstructured":"Kiwiel, K.C., Proximal Minimization Methods with Generalized Bregman Functions, SIAM J. Control Optim., 1997, vol. 35, no.4, pp. 1142\u20131168.","journal-title":"SIAM J. Control Optim."},{"issue":"3","key":"5_CR34","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A. Beck","year":"2003","unstructured":"Beck, A. and Teboulle, M., Mirror Descent and Nonlinear Projected Subgradient Methods for Convex Optimization, Oper. Research Letters, 2003, vol. 31, no.3, pp. 167\u2013175.","journal-title":"Oper. Research Letters"},{"key":"5_CR35","unstructured":"Polyak, B.T. and Tsypkin, Ya.Z., Criterial Algorithms of Stochastic Optimization, Avtom. Telemekh., 1984, no. 6. pp. 95\u2013104 [Autom. Remote Contr. (Engl. Transl.), vol. 45, no. 6, part 2, pp. 766\u2013774]."},{"key":"5_CR36","volume-title":"Theory of Statistical Inference and Information","author":"I. Vajda","year":"1986","unstructured":"Vajda, I., Theory of Statistical Inference and Information, Dordrecht: Kluwer, 1986."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11122-006-0005-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11122-006-0005-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11122-006-0005-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11122-006-0005-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T01:53:57Z","timestamp":1775008437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11122-006-0005-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,10]]}},"alternative-id":["5"],"URL":"https:\/\/doi.org\/10.1007\/s11122-006-0005-2","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10]]}}}