{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T20:43:46Z","timestamp":1776977026511,"version":"3.51.4"},"reference-count":44,"publisher":"Pleiades Publishing Ltd","issue":"9","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Autom Remote Control"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1134\/s0005117919090042","type":"journal-article","created":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T00:39:52Z","timestamp":1568335192000},"page":"1607-1627","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Algorithms of Robust Stochastic Optimization Based on Mirror Descent Method"],"prefix":"10.1134","volume":"80","author":[{"given":"A. V.","family":"Nazin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. S.","family":"Nemirovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. B.","family":"Tsybakov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. B.","family":"Juditsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2019,9,27]]},"reference":[{"issue":"4","key":"1023_CR1","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., and Shapiro, A., Robust Stochastic Approximation Approach to Stochastic Programming, SIAM J. Optim., 2009, vol. 19, no. 4, pp. 1574\u20131609.","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1023_CR2","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1287\/10-SSY010","volume":"4","author":"A Juditsky","year":"2014","unstructured":"Juditsky, A. and Nesterov, Y., Deterministic and Stochastic Primal-Dual Subgradient Algorithms for Uniformly Convex Minimization, Stoch. Syst., 2014, vol. 4, no. 1, pp. 44\u201380.","journal-title":"Stoch. Syst."},{"issue":"4","key":"1023_CR3","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1137\/110848864","volume":"22","author":"S Ghadimi","year":"2012","unstructured":"Ghadimi, S. and Lan, G., Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework, SIAM J. Optim., 2012, vol. 22, no. 4, pp. 1469\u20131492.","journal-title":"SIAM J. Optim."},{"key":"1023_CR4","first-page":"448","volume-title":"Contributions to Probability and Statistics: Essays in Honor of Harold Hotelling","author":"JW Tukey","year":"1960","unstructured":"Tukey, J.W., A Survey of Sampling from Contaminated Distributions, in Contributions to Probability and Statistics: Essays in Honor of Harold Hotelling, Olkin, I., et al., Eds., Palo Alto: Stanford Univ. Press, 1960, pp. 448\u2013485."},{"issue":"1","key":"1023_CR5","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1214\/aoms\/1177703732","volume":"35","author":"PJ Huber","year":"1964","unstructured":"Huber, P.J., Robust Estimation of a Location Parameter, Ann. Math. Statist., 1964, vol. 35, no. 1, pp. 73\u2013101.","journal-title":"Ann. Math. Statist."},{"issue":"4","key":"1023_CR6","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1214\/aoms\/1177692459","volume":"43","author":"PJ Huber","year":"1972","unstructured":"Huber, P.J., Robust Statistics: A Review, Ann. Math. Statist., 1972, vol. 43, no. 4, pp. 1041\u20131067.","journal-title":"Ann. Math. Statist."},{"key":"1023_CR7","doi-asserted-by":"publisher","DOI":"10.1002\/0471725250","volume-title":"Robust Statistics","author":"PJ Huber","year":"1981","unstructured":"Huber, P.J., Robust Statistics, New York: Wiley, 1981."},{"issue":"3","key":"1023_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1109\/TIT.1975.1055386","volume":"21","author":"R Martin","year":"1975","unstructured":"Martin, R. and Masreliez, C., Robust Estimation via Stochastic Approximation, IEEE Trans. Inf. Theory, 1975, vol. 21, no. 3, pp. 263\u2013271.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1023_CR9","first-page":"378","volume":"40","author":"BT Polyak","year":"1979","unstructured":"Polyak, B.T. and Tsypkin, Ya.Z., Adaptive Estimation Algorithms: Convergence, Optimality, Stability, Autom. Remote Control, 1979, vol. 40, no. 3, pp. 378\u2013389.","journal-title":"Autom. Remote Control"},{"issue":"10","key":"1023_CR10","first-page":"1404","volume":"41","author":"BT Polyak","year":"1981","unstructured":"Polyak, B.T. and Tsypkin, Ya.Z., Robust Pseudogradient Adaptation Algorithms, Autom. Remote Control, 1981, vol. 41, no. 10, pp. 1404\u20131409.","journal-title":"Autom. Remote Control"},{"issue":"1","key":"1023_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0005-1098(80)90086-2","volume":"16","author":"B Polyak","year":"1980","unstructured":"Polyak, B. and Tsypkin, J.Z., Robust Identification, Automatica, 1980, vol. 16, no. 1, pp. 53\u201363.","journal-title":"Automatica"},{"issue":"6","key":"1023_CR12","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1109\/TIT.1979.1056111","volume":"25","author":"E Price","year":"1979","unstructured":"Price, E. and VandeLinde, V., Robust Estimation Using the Robbins-Monro Stochastic Approximation Algorithm, IEEE Trans. Inf. Theory, 1979, vol. 25, no. 6, pp. 698\u2013704.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1023_CR13","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1016\/0005-1098(86)90053-1","volume":"22","author":"SS Stankovi\u00b4c","year":"1986","unstructured":"Stankovi\u00b4c, S.S. and Kova\u02c7cevi\u00b4c, B.D., Analysis of Robust Stochastic Approximation Algorithms for Process Identification, Automatica, 1986, vol. 22, no. 4, pp. 483\u2013488.","journal-title":"Automatica"},{"key":"1023_CR14","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-4149(87)90039-1","volume":"27","author":"H-F Chen","year":"1987","unstructured":"Chen, H.-F., Guo, L., and Gao, A.J., Convergence and Robustness of the Robbins-Monro Algorithm Truncated at Randomly Varying Bounds, Stoch. Proc. Appl., 1987, vol. 27, pp. 217\u2013231.","journal-title":"Stoch. Proc. Appl."},{"issue":"1","key":"1023_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/17442508908833545","volume":"26","author":"H-F Chen","year":"1989","unstructured":"Chen, H.-F. and Gao, A.J., Robustness Analysis for Stochastic Approximation Algorithms, Stochast. Stochast. Rep., 1989, vol. 26, no. 1, pp. 3\u201320.","journal-title":"Stochast. Stochast. Rep."},{"issue":"5","key":"1023_CR16","doi-asserted-by":"publisher","first-page":"1577","DOI":"10.1109\/18.149511","volume":"38","author":"AV Nazin","year":"1992","unstructured":"Nazin, A.V., Polyak, B.T., and Tsybakov, A.B., Optimal and Robust Kernel Algorithms for Passive Stochastic Approximation, IEEE Trans. Inf. Theory, 1992, vol. 38, no. 5, pp. 1577\u20131583.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1023_CR17","volume-title":"Osnovy Informatsionnoi Teorii Identifikatsii","author":"YaZ Tsypkin","year":"1984","unstructured":"Tsypkin, Ya.Z., Osnovy Informatsionnoi Teorii Identifikatsii (On the Foundations of Information and Identification Theory), Moscow: Nauka, 1984."},{"key":"1023_CR18","volume-title":"Informatsionnaya Teoriya Identifikatsii","author":"YaZ Tsypkin","year":"1995","unstructured":"Tsypkin, Ya.Z., Informatsionnaya Teoriya Identifikatsii (Information Identification Theory), Moscow: Nauka, 1995."},{"key":"1023_CR19","volume-title":"Median of Means Principle as a Divide-and-Conquer Procedure for Robustness, Sub-Sampling and Hyper-parameters Tuning","author":"J Kwon","year":"2018","unstructured":"Kwon, J., Lecu\u00b4e, G., and Lerasle, M., Median of Means Principle as a Divide-and-Conquer Procedure for Robustness, Sub-Sampling and Hyper-parameters Tuning, 2018, arXiv:1812.02435."},{"key":"1023_CR20","volume-title":"arXiv preprint","author":"G Chinot","year":"2018","unstructured":"Chinot, G., Lecu\u00b4e, G., and Lerasle, M., Statistical Learning with Lipschitz and Convex Loss Functions, 2018, arXiv preprint arXiv:1810.01090."},{"key":"1023_CR21","volume-title":"arXiv preprint","author":"G Lecu\u00b4e","year":"2017","unstructured":"Lecu\u00b4e, G. and Lerasle, M., Robust Machine Learning by Median-of-Means: Theory and Practice, 2017, arXiv preprint arXiv:1711.10306v2. Annals of Stat., to appear."},{"key":"1023_CR22","volume-title":"arXiv preprint","author":"G Lecu\u00b4e","year":"2018","unstructured":"Lecu\u00b4e, G., Lerasle, M., and Mathieu, T., Robust Classification via MOM Minimization, 2018, arXiv preprint arXiv:1808.03106."},{"key":"1023_CR23","volume-title":"arXiv preprint","author":"M Lerasle","year":"2011","unstructured":"Lerasle, M. and Oliveira, R.I., Robust Empirical Mean Estimators, 2011, arXiv preprint arXiv:1112.3914."},{"key":"1023_CR24","volume-title":"arXiv preprint","author":"G Lugosi","year":"2016","unstructured":"Lugosi, G. and Mendelson, S., Risk Minimization by Median-of-Means Tournaments, 2016, arXiv preprint arXiv:1608.00757."},{"key":"1023_CR25","volume-title":"arXiv preprint","author":"G Lugosi","year":"2017","unstructured":"Lugosi, G. and Mendelson, S., Regularization, Sparse Recovery, and Median-of-Means Tournaments, 2017, arXiv preprint arXiv:1701.04112."},{"key":"1023_CR26","volume-title":"arXiv preprint","author":"G Lugosi","year":"2018","unstructured":"Lugosi, G. and Mendelson, S., Near-Optimal Mean Estimators with Respect to General Norms, 2018, arXiv preprint arXiv:1806.06233."},{"issue":"1","key":"1023_CR27","first-page":"543","volume":"17","author":"D Hsu","year":"2016","unstructured":"Hsu, D. and Sabato, S., Loss Minimization and Parameter Estimation with Heavy Tails, J. Machine Learning Res., 2016, vol. 17, no. 1, pp. 543\u2013582.","journal-title":"J. Machine Learning Res."},{"issue":"11","key":"1023_CR28","doi-asserted-by":"publisher","first-page":"7711","DOI":"10.1109\/TIT.2013.2277869","volume":"59","author":"S Bubeck","year":"2013","unstructured":"Bubeck, S., Cesa-Bianchi, N., and Lugosi, G., Bandits with Heavy Tail, IEEE Trans. Inf. Theory, 2013, vol. 59, no. 11, pp. 7711\u20137717.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1023_CR29","doi-asserted-by":"publisher","first-page":"2695","DOI":"10.1214\/16-AOS1440","volume":"44","author":"L Devroye","year":"2016","unstructured":"Devroye, L., Lerasle, M., Lugosi, G., and Oliveira, R.I., Sub-Gaussian Mean Estimators, Ann. Stat., 2016, vol. 44, no. 6, pp. 2695\u20132725.","journal-title":"Ann. Stat."},{"key":"1023_CR30","volume-title":"Slozhnost\u2019 zadach i effektivnost\u2019 metodov optimizatsii","author":"AS Nemirovskii","year":"1979","unstructured":"Nemirovskii, A.S. and Yudin, D.B., Slozhnost\u2019 zadach i effektivnost\u2019 metodov optimizatsii, Moscow: Nauka, 1979. Translated under the title Problem Complexity and Method Efficiency in Optimization, Chichester: Wiley, 1983."},{"issue":"2","key":"1023_CR31","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1214\/17-AOS1639","volume":"47","author":"G Lugosi","year":"2019","unstructured":"Lugosi, G. and Mendelson, S., Sub-Gaussian Estimators of the Mean of a Random Vector, Ann. Stat., 2019, vol. 47, no. 2, pp. 783\u2013794.","journal-title":"Ann. Stat."},{"issue":"4","key":"1023_CR32","first-page":"1148","volume":"48","author":"O Catoni","year":"2012","unstructured":"Catoni, O., Challenging the Empirical Mean and Empirical Variance: A Deviation Study, Ann. IHP: Probab. Stat., 2012, vol. 48, no. 4, pp. 1148\u20131185.","journal-title":"Ann. IHP: Probab. Stat."},{"issue":"5","key":"1023_CR33","doi-asserted-by":"publisher","first-page":"2766","DOI":"10.1214\/11-AOS918","volume":"39","author":"J-Y Audibert","year":"2011","unstructured":"Audibert, J.-Y. and Catoni, O., Robust Linear Least Squares Regression, Ann. Stat., 2011, vol. 39, no. 5, pp. 2766\u20132794.","journal-title":"Ann. Stat."},{"issue":"4","key":"1023_CR34","doi-asserted-by":"publisher","first-page":"2308","DOI":"10.3150\/14-BEJ645","volume":"21","author":"S Minsker","year":"2015","unstructured":"Minsker, S., Geometric Median and Robust Estimation in Banach Spaces, Bernoulli, 2015, vol. 21, no. 4, pp. 2308\u20132335.","journal-title":"Bernoulli"},{"key":"1023_CR35","first-page":"2859","volume-title":"Advances in Neural Information Processing Systems","author":"X Wei","year":"2017","unstructured":"Wei, X. and Minsker, S., Estimation of the Covariance Structure of Heavy-Tailed Distributions, in Advances in Neural Information Processing Systems, 2017, pp. 2859\u20132868."},{"issue":"2","key":"1023_CR36","volume":"1","year":"2017","unstructured":"Chen, Y., Su, L., and Xu, J., Distributed Statistical Machine Learning in Adversarial Settings: Byzantine Gradient Descent, Proc. ACM Measur. Analys. Comput. Syst., 2017, vol. 1, no. 2, article no. 44.","journal-title":"Proc. ACM Measur. Analys. Comput. Syst."},{"key":"1023_CR37","volume-title":"arXiv preprint","author":"D Yin","year":"2018","unstructured":"Yin, D., Chen, Y., Ramchandran, K., and Bartlett, P., Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates, 2018, arXiv preprint arXiv:1803.01498."},{"key":"1023_CR38","first-page":"421","volume-title":"Proc. COMPSTAT\u20192010","author":"H Cardot","year":"2010","unstructured":"Cardot, H., C\u00b4enac, P., and Chaouch, M., Stochastic Approximation for Multivariate and Functional Median, in Proc. COMPSTAT\u20192010, Springer, 2010, pp. 421\u2013428."},{"issue":"2","key":"1023_CR39","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1214\/16-AOS1460","volume":"45","author":"H Cardot","year":"2017","unstructured":"Cardot, H., C\u00b4enac, P., and Godichon-Baggioni, A., Online Estimation of the Geometric Median in Hilbert Spaces: Nonasymptotic Confidence Balls, Ann. Stat., 2017, vol. 45, no. 2, pp. 591\u2013614.","journal-title":"Ann. Stat."},{"issue":"1\u20132","key":"1023_CR40","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10107-010-0434-y","volume":"133","author":"G Lan","year":"2012","unstructured":"Lan, G., An Optimal Method for Stochastic Composite Optimization, Math. Program., 2012, vol. 133, nos. 1\u20132, pp. 365\u2013397.","journal-title":"Math. Program."},{"key":"1023_CR41","first-page":"1","volume-title":"Math. Program.","author":"I Necoara","year":"2018","unstructured":"Necoara, I., Nesterov, Y., and Glineur, F., Linear Convergence of First Order Methods for Non-Strongly Convex Optimization, Math. Program., 2018, pp. 1\u201339."},{"key":"1023_CR42","doi-asserted-by":"crossref","first-page":"121","DOI":"10.7551\/mitpress\/8996.003.0007","volume-title":"Optimization for Machine Learning","author":"A Juditsky","year":"2011","unstructured":"Juditsky, A. and Nemirovski, A., First Order Methods for Nonsmooth Convex Large-Scale Optimization, I: General Purpose Methods, in Optimization for Machine Learning, Sra, S., Nowozin, S., and Wright, S.J., Eds., Boston: MIT Press, 2011, pp. 121\u2013148."},{"issue":"1","key":"1023_CR43","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1214\/aop\/1176996452","volume":"3","author":"DA Freedman","year":"1975","unstructured":"Freedman, D.A., On Tail Probabilities for Martingales, Ann. Probab., 1975, vol. 3, no. 1, pp. 100\u2013118.","journal-title":"Ann. Probab."},{"issue":"3","key":"1023_CR44","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1137\/0803026","volume":"3","author":"G Chen","year":"1993","unstructured":"Chen, G. and Teboulle, M., Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions, SIAM J. Optim., 1993, vol. 3, no. 3, pp. 538\u2013543.","journal-title":"SIAM J. Optim."}],"container-title":["Automation and Remote Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117919090042.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0005117919090042","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117919090042.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:31:52Z","timestamp":1773613912000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0005117919090042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":44,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["1023"],"URL":"https:\/\/doi.org\/10.1134\/s0005117919090042","relation":{},"ISSN":["0005-1179","1608-3032"],"issn-type":[{"value":"0005-1179","type":"print"},{"value":"1608-3032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9]]},"assertion":[{"value":"18 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}