{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T04:25:12Z","timestamp":1772771112099,"version":"3.50.1"},"reference-count":75,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T00:00:00Z","timestamp":1587945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T00:00:00Z","timestamp":1587945600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ECODEC"],"award-info":[{"award-number":["ECODEC"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s10994-019-05863-6","type":"journal-article","created":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T20:02:27Z","timestamp":1588017747000},"page":"1635-1665","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Robust classification via MOM minimization"],"prefix":"10.1007","volume":"109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6391-8746","authenticated-orcid":false,"given":"Guillaume","family":"Lecu\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthieu","family":"Lerasle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timloth\u00e9e","family":"Mathieu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,27]]},"reference":[{"key":"5863_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-6396-2","volume-title":"Outlier analysis","author":"CC Aggarwal","year":"2013","unstructured":"Aggarwal, C. C. (2013). Outlier analysis. Berlin: Springer."},{"key":"5863_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Matias, Y., & Szegedy, M. (1999). The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58(1, part 2), 137\u2013147. Twenty-eighth Annual ACM Symposium on the Theory of Computing (Philadelphia, PA, 1996).","DOI":"10.1006\/jcss.1997.1545"},{"key":"5863_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational complexity","author":"S Arora","year":"2009","unstructured":"Arora, S., & Barak, B. (2009). Computational complexity. Cambridge: Cambridge University Press. A modern approach."},{"issue":"5","key":"5863_CR4","first-page":"2766","volume":"39","author":"J-Y Audibert","year":"2011","unstructured":"Audibert, J.-Y., & Catoni, O. (2011). Robust linear least squares regression. Annals of Statistics, 39(5), 2766\u20132794.","journal-title":"Annals of Statistics"},{"issue":"4","key":"5863_CR5","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1214\/12-STS394","volume":"27","author":"F Bach","year":"2012","unstructured":"Bach, F., Jenatton, R., Mairal, J., & Obozinski, G. (2012). Structured sparsity through convex optimization. Statistical Science, 27(4), 450\u2013468.","journal-title":"Statistical Science"},{"issue":"2","key":"5863_CR6","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s00222-016-0673-5","volume":"207","author":"Y Baraud","year":"2017","unstructured":"Baraud, Y., Birg\u00e9, L., & Sart, M. (2017). A new method for estimation and model selection: $$\\rho $$-estimation. Inventiones Mathematicae, 207(2), 425\u2013517.","journal-title":"Inventiones Mathematicae"},{"key":"5863_CR7","unstructured":"Bartlett, P. L., & Mendelson, S. (2002). Rademacher and Gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research, 3(Spec. Issue Comput. Learn. Theory), 463\u2013482."},{"issue":"3","key":"5863_CR8","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s00440-005-0462-3","volume":"135","author":"PL Bartlett","year":"2006","unstructured":"Bartlett, P. L., & Mendelson, S. (2006). Empirical minimization. Probability Theory and Related Fields, 135(3), 311\u2013334.","journal-title":"Probability Theory and Related Fields"},{"issue":"1","key":"5863_CR9","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.datak.2006.01.013","volume":"60","author":"D Birant","year":"2007","unstructured":"Birant, D., & Kut, A. (2007). St-dbscan: An algorithm for clustering spatial-temporal data. Data & Knowledge Engineering, 60(1), 208\u2013221.","journal-title":"Data & Knowledge Engineering"},{"key":"5863_CR10","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1051\/ps:2005018","volume":"9","author":"S Boucheron","year":"2005","unstructured":"Boucheron, S., Bousquet, O., & Lugosi, G. (2005). Theory of classification: a survey of some recent advances. ESAIM: Probability and Statistics, 9, 323\u2013375.","journal-title":"ESAIM: Probability and Statistics"},{"key":"5863_CR11","doi-asserted-by":"crossref","unstructured":"Boucheron, S., Lugosi, G., & Massart, P. (2013). Concentration inequalities: A nonasymptotic theory of independence. Oxford University Press.","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"5863_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge: Cambridge University Press."},{"issue":"2","key":"5863_CR13","first-page":"123","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123\u2013140.","journal-title":"Machine Learning"},{"issue":"6","key":"5863_CR14","doi-asserted-by":"crossref","first-page":"2507","DOI":"10.1214\/15-AOS1350","volume":"43","author":"C Brownlees","year":"2015","unstructured":"Brownlees, C., Joly, E., & Lugosi, G. (2015). Empirical risk minimization for heavy-tailed losses. Annals of Statistics, 43(6), 2507\u20132536. 12.","journal-title":"Annals of Statistics"},{"issue":"3\u20134","key":"5863_CR15","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1561\/2200000050","volume":"8","author":"S Bubeck","year":"2015","unstructured":"Bubeck, S. (2015). Convex optimization: Algorithms and complexity. Foundations and Trends in Machine Learning, 8(3\u20134), 231\u2013357.","journal-title":"Foundations and Trends in Machine Learning"},{"issue":"4","key":"5863_CR16","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1214\/aos\/1031689014","volume":"30","author":"P B\u00fchlmann","year":"2002","unstructured":"B\u00fchlmann, P., & Bin, Y. (2002). Analyzing bagging. The Annals of Statistics, 30(4), 927\u2013961.","journal-title":"The Annals of Statistics"},{"issue":"4","key":"5863_CR17","first-page":"1148","volume":"48","author":"O Catoni","year":"2012","unstructured":"Catoni, O. (2012). Challenging the empirical mean and empirical variance: A deviation study. Annales de Institut Henri Poincar\u00e9 Probability and Statistics, 48(4), 1148\u20131185.","journal-title":"Annales de Institut Henri Poincar\u00e9 Probability and Statistics"},{"key":"5863_CR18","unstructured":"Chen, M., Gao, C., & Ren, Z. (2017). Robust covariance and scatter matrix estimation under huber\u2019s contamination model. Technical report, University of Chicago and University of Pittsburgh. Preprint available on arXiv:1506.00691."},{"issue":"5","key":"5863_CR19","doi-asserted-by":"crossref","first-page":"1932","DOI":"10.1214\/17-AOS1607","volume":"46","author":"M Chen","year":"2018","unstructured":"Chen, M., Gao, C., & Ren, Z. (2018). Robust covariance and scatter matrix estimation under Huber\u2019s contamination model. Annals of Statistics, 46(5), 1932\u20131960.","journal-title":"Annals of Statistics"},{"key":"5863_CR20","doi-asserted-by":"crossref","unstructured":"Cheng, Y., Diakonikolas, I., & Ge, R. (2019). High-dimensional robust mean estimation in nearly-linear time. In Proceedings of the thirtieth annual ACM-SIAM symposium on discrete algorithms (pp. 2755\u20132771). SIAM.","DOI":"10.1137\/1.9781611975482.171"},{"key":"5863_CR21","doi-asserted-by":"crossref","unstructured":"Chinot, G., Lecu\u00e9, G., & Lerasle, M. (2019). Robust statistical learning with Lipschitz and convex loss functions. Probability Theory and Related Fields (to appear).","DOI":"10.1007\/s00440-019-00931-3"},{"key":"5863_CR22","doi-asserted-by":"crossref","unstructured":"Christophe, C., & Catherine, D. (2001). Robust linear discriminant analysis using s-estimators. The Canadian Journal of Statistics\/La Revue Canadienne de Statistique, 29(3), 473\u2013493.","DOI":"10.2307\/3316042"},{"key":"5863_CR23","unstructured":"Devroye, L., Gy\u00f6rfi, L., & Lugosi, G. (1997). A probabilistic theory of pattern recognition, volume\u00a031 of Applications of Mathematics. Springer, corrected 2nd edition, missing."},{"issue":"6","key":"5863_CR24","doi-asserted-by":"crossref","first-page":"2695","DOI":"10.1214\/16-AOS1440","volume":"44","author":"L Devroye","year":"2016","unstructured":"Devroye, L., Lerasle, M., Lugosi, G., & Oliveira, R. I. (2016a). Sub-Gaussian mean estimators. Annals of Statistics, 44(6), 2695\u20132725.","journal-title":"Annals of Statistics"},{"issue":"6","key":"5863_CR25","doi-asserted-by":"crossref","first-page":"2695","DOI":"10.1214\/16-AOS1440","volume":"44","author":"L Devroye","year":"2016","unstructured":"Devroye, L., Lerasle, M., Lugosi, G., & Oliveira, R. I. (2016b). Sub-Gaussian mean estimators. The Annals of Statistics, 44(6), 2695\u20132725.","journal-title":"The Annals of Statistics"},{"key":"5863_CR26","doi-asserted-by":"crossref","unstructured":"Diakonikolas, I., Kamath, G., Kane, D.\u00a0M., Li, J., Moitra, A., & Stewart, A. (2016). Robust estimators in high dimensions without the computational intractability. In 57th Annual IEEE symposium on foundations of computer science\u2014FOCS 2016 (pp. 655\u2013664). IEEE Computer Soc., Los Alamitos, CA.","DOI":"10.1109\/FOCS.2016.85"},{"key":"5863_CR27","unstructured":"Diakonikolas, I., Kamath, G., Kane, D.\u00a0M., Li, J., Moitra, A., & Stewart, A. (2017). Being robust (in high dimensions) can be practical. In Proceedings of the 34th international conference on machine learning-volume 70 (pp. 999\u20131008). JMLR.org."},{"key":"5863_CR28","unstructured":"Donoho, D., & Montanari, A. (2015). Variance breakdown of huber (m)-estimators: $$n\/p\\rightarrow m\\in (1, +\\infty )$$. Technical report, Stanford University, Preprint available on arXiv:1503.02106."},{"issue":"523","key":"5863_CR29","doi-asserted-by":"crossref","first-page":"1268","DOI":"10.1080\/01621459.2017.1340888","volume":"113","author":"J Fan","year":"2018","unstructured":"Fan, J., & Kim, D. (2018). Robust high-dimensional volatility matrix estimation for high-frequency factor model. Journal of the American Statistical Association, 113(523), 1268\u20131283.","journal-title":"Journal of the American Statistical Association"},{"issue":"6","key":"5863_CR30","doi-asserted-by":"crossref","first-page":"1558","DOI":"10.1137\/120865094","volume":"41","author":"V Feldman","year":"2012","unstructured":"Feldman, V., Guruswami, V., Raghavendra, P., & Yi, W. (2012). Agnostic learning of monomials by halfspaces is hard. SIAM Journal on Computing, 41(6), 1558\u20131590.","journal-title":"SIAM Journal on Computing"},{"key":"5863_CR31","unstructured":"Gao, C. (2017). Robust regression via mutivariate regression depth. Technical report, University of Chicago, Preprint available on arXiv:1702.04656."},{"key":"5863_CR32","unstructured":"Gao, C., Liu, J., Yao, Y., & Zhu, W. (2018). Robust estimation and generative adversarial nets. arXiv:1810.02030."},{"issue":"2","key":"5863_CR33","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1137\/070685798","volume":"39","author":"V Guruswami","year":"2009","unstructured":"Guruswami, V., & Raghavendra, P. (2009). Hardness of learning halfspaces with noise. SIAM Journal on Computing, 39(2), 742\u2013765.","journal-title":"SIAM Journal on Computing"},{"key":"5863_CR34","unstructured":"Gunduz, N., & Fokou\u00e9, E. (2015). Robust classification of high dimension low sample size data. arXiv:1501.00592."},{"issue":"6","key":"5863_CR35","doi-asserted-by":"crossref","first-page":"1887","DOI":"10.1214\/aoms\/1177693054","volume":"42","author":"FR Hampel","year":"1971","unstructured":"Hampel, F. R. (1971). A general qualitative definition of robustness. The Annals of Mathematical Statistics, 42(6), 1887\u20131896.","journal-title":"The Annals of Mathematical Statistics"},{"issue":"346","key":"5863_CR36","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1080\/01621459.1974.10482962","volume":"69","author":"FR Hampel","year":"1974","unstructured":"Hampel, F. R. (1974). The influence curve and its role in robust estimation. Journal of the American Statistical Association, 69(346), 383\u2013393.","journal-title":"Journal of the American Statistical Association"},{"key":"5863_CR37","unstructured":"Han, Q., & Wellner, J. (2017). A sharp multiplier inequality with applications to heavy-tailed regression problems. arXiv:1706.02410."},{"issue":"2","key":"5863_CR38","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1006\/jmva.1999.1857","volume":"72","author":"X He","year":"2000","unstructured":"He, X., & Fung, W. K. (2000). High breakdown estimation for multiple populations with applications to discriminant analysis. Journal of Multivariate Analysis, 72(2), 151\u2013162.","journal-title":"Journal of Multivariate Analysis"},{"issue":"1","key":"5863_CR39","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","volume":"5","author":"CAR Hoare","year":"1962","unstructured":"Hoare, C. A. R. (1962). Quicksort. The Computer Journal, 5(1), 10\u201316.","journal-title":"The Computer Journal"},{"key":"5863_CR40","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1214\/aoms\/1177703732","volume":"35","author":"PJ Huber","year":"1964","unstructured":"Huber, P. J. (1964). Robust estimation of a location parameter. Annals of Mathematical Statistics, 35, 73\u2013101.","journal-title":"Annals of Mathematical Statistics"},{"key":"5863_CR41","unstructured":"Huber, P.\u00a0J. (1967). The behavior of maximum likelihood estimates under nonstandard conditions. In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability (vol. 1, pp. 221\u2013233). Berkeley, CA."},{"key":"5863_CR42","unstructured":"Huber, P.\u00a0J, & Ronchetti, E.\u00a0M. (2009). Robust statistics, 2nd ed. Wiley Series in Probability and Statistics. Wiley, Hoboken, NJ."},{"issue":"2","key":"5863_CR43","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0167-9473(02)00299-2","volume":"45","author":"M Hubert","year":"2004","unstructured":"Hubert, M., & Van Driessen, K. (2004). Fast and robust discriminant analysis. Computational Statistics & Data Analysis, 45(2), 301\u2013320.","journal-title":"Computational Statistics & Data Analysis"},{"issue":"4","key":"5863_CR44","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s11634-010-0066-3","volume":"4","author":"M Hubert","year":"2010","unstructured":"Hubert, M., & Van Der Veeken, S. (2010). Robust classification for skewed data. Advances in Data Analysis and Classification, 4(4), 239\u2013254.","journal-title":"Advances in Data Analysis and Classification"},{"issue":"2\u20133","key":"5863_CR45","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"MR Jerrum","year":"1986","unstructured":"Jerrum, M. R., Valiant, L. G., & Vazirani, V. V. (1986). Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science, 43(2\u20133), 169\u2013188.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"5863_CR46","doi-asserted-by":"crossref","first-page":"1378","DOI":"10.3150\/12-BEJSP17","volume":"19","author":"MI Jordan","year":"2013","unstructured":"Jordan, M. I. (2013). On statistics, computation and scalability. Bernoulli, 19(4), 1378\u20131390.","journal-title":"Bernoulli"},{"key":"5863_CR47","unstructured":"Koltchinskii, V. (2008). Oracle inequalities in empirical risk minimization and sparse recovery problems, volume 2033 of Lecture Notes in Mathematics. Springer, Heidelberg, 2011. Lectures from the 38th Probability Summer School held in Saint-Flour, 2008, \u00c9cole d\u2019\u00c9t\u00e9 de Probabilit\u00e9s de Saint-Flour. [Saint-Flour Probability Summer School]."},{"key":"5863_CR48","doi-asserted-by":"crossref","unstructured":"Koltchinskii, V. (2011). Oracle inequalities in empirical risk minimization and sparse recovery problems.","DOI":"10.1007\/978-3-642-22147-7"},{"key":"5863_CR49","first-page":"12991","volume":"23","author":"V Koltchinskii","year":"2015","unstructured":"Koltchinskii, V., & Mendelson, S. (2015). Bounding the smallest singular value of a random matrix without concentration. International Mathematics Research Notices, 23, 12991\u201313008.","journal-title":"International Mathematics Research Notices"},{"key":"5863_CR50","unstructured":"Lecu\u00e9, G., & Lerasle, M. (2017). Robust machine learning by median-of-means: Theory and practice. Technical report, CNRS, ENSAE, Paris-sud. Preprint available on arXiv:1711.10306."},{"key":"5863_CR51","unstructured":"Lecu\u00e9, G., & Lerasle, M. (2019). Learning from mom\u2019s principle : Le cam\u2019s approach. Technical report, CNRS, ENSAE, Paris-sud. Preprint available on arXiv:1701.01961."},{"key":"5863_CR52","unstructured":"Lecu\u00e9, G., & Mendelson, S. (2013). Learning subgaussian classes: Upper and minimax bounds. Technical report, CNRS, Ecole polytechnique and Technion."},{"key":"5863_CR53","unstructured":"Ledoux, M., & Talagrand, M. (2011). Probability in Banach spaces. Classics in Mathematics. Springer, Berlin, 2011. Isoperimetry and processes, Reprint of the 1991 edition."},{"key":"5863_CR54","unstructured":"Le Gall, F. (2014). Powers of tensors and fast matrix multiplication. CoRR, arXiv:1401.7714."},{"key":"5863_CR55","doi-asserted-by":"crossref","unstructured":"Liu, F.\u00a0T., Ting, K.\u00a0M., & Zhou, Z.-H. (2008). Isolation forest. In Eighth IEEE international conference on data mining, 2008. ICDM\u201908 (pp. 413\u2013422). IEEE.","DOI":"10.1109\/ICDM.2008.17"},{"key":"5863_CR56","unstructured":"Lugosi, G., & Mendelson, S. (2017). Risk minimization by median-of-means tournaments. Preprint available on arXiv:1608.00757."},{"key":"5863_CR57","doi-asserted-by":"crossref","unstructured":"Lugosi, G., & Mendelson, S. (2019a). Regularization, sparse recovery, and median-of-means tournaments. Preprint available on arXiv:1701.04112.","DOI":"10.3150\/18-BEJ1046"},{"key":"5863_CR58","doi-asserted-by":"crossref","unstructured":"Lugosi, G., & Mendelson, S. (2019b). Sub-gaussian estimators of the mean of a random vector. Preprint available on arXiv:1702.00482.","DOI":"10.1214\/17-AOS1639"},{"key":"5863_CR59","first-page":"000","volume":"000","author":"RJ Lyon","year":"2015","unstructured":"Lyon, R. J., Stappers, B. W., Cooper, S., Brooke, J. D., & Knowles, J. M. (2015). Fifty years of pulsar candidate selection: From simple filters to a new principled real-time classification approach. MNRAS, 000, 000\u2013000.","journal-title":"MNRAS"},{"issue":"6","key":"5863_CR60","doi-asserted-by":"crossref","first-page":"1808","DOI":"10.1214\/aos\/1017939240","volume":"27","author":"E Mammen","year":"1999","unstructured":"Mammen, E., & Tsybakov, A. B. (1999). Smooth discrimination analysis. Annals of Statistics, 27(6), 1808\u20131829.","journal-title":"Annals of Statistics"},{"key":"5863_CR61","unstructured":"Mendelson, S. (2014). Learning without concentration. In Proceedings of the 27th annual conference on Learning Theory COLT14 (pp. 25\u201339)."},{"key":"5863_CR62","unstructured":"Mendelson, S. (2015). Learning without concentration. J. ACM, 62(3):Art. 21, 25."},{"key":"5863_CR63","unstructured":"Mendelson, S. (2017). An optimal unrestricted learning procedure. Preprint available on arXiv:1707.05342."},{"issue":"4","key":"5863_CR64","doi-asserted-by":"crossref","first-page":"2308","DOI":"10.3150\/14-BEJ645","volume":"21","author":"S Minsker","year":"2015","unstructured":"Minsker, S. (2015). Geometric median and robust estimation in Banach spaces. Bernoulli, 21(4), 2308\u20132335.","journal-title":"Bernoulli"},{"issue":"2","key":"5863_CR65","doi-asserted-by":"crossref","first-page":"5213","DOI":"10.1214\/19-EJS1647","volume":"13","author":"S Minsker","year":"2019","unstructured":"Minsker, S. (2019). Distributed statistical estimation and rates of convergence in normal approximation. Electronic Journal of Statistics, 13(2), 5213\u20135252.","journal-title":"Electronic Journal of Statistics"},{"key":"5863_CR66","unstructured":"Moulines, E., & Bach, F.\u00a0R. (2011). Non-asymptotic analysis of stochastic approximation algorithms for machine learning. In Advances in neural information processing systems (pp. 451\u2013459)."},{"key":"5863_CR67","unstructured":"Nemirovsky, A. S., & Yudin, D. B. (1983). Problem complexity and method efficiency in optimization. A Wiley-Interscience Publication. Wiley, New York. Translated from the Russian and with a preface by E. R. Dawson, Wiley-Interscience Series in Discrete Mathematics."},{"key":"5863_CR68","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., et al. (2011). Scikit-learn: Machine learning in Python. Journal of Machine Learning Research, 12, 2825\u20132830.","journal-title":"Journal of Machine Learning Research"},{"key":"5863_CR69","unstructured":"Rosenblatt, F. (1958). The perceptron: A theory of statistical separability in cognitive systems. Cornell Aeronautical Laboratory, Inc., Rep. No. VG-1196-G-1. U.S. Department of Commerce, Office of Technical Services, PB 151247."},{"key":"5863_CR70","doi-asserted-by":"crossref","unstructured":"Roth, V. (2001). Probabilistic discriminative kernel classifiers for multi-class problems. In Joint pattern recognition symposium (pp. 246\u2013253). Springer.","DOI":"10.1007\/3-540-45404-7_33"},{"issue":"3","key":"5863_CR71","doi-asserted-by":"crossref","first-page":"2176","DOI":"10.3150\/17-BEJ925","volume":"24","author":"A Saumard","year":"2018","unstructured":"Saumard, A. (2018). On optimality of empirical risk minimization in linear aggregation. Bernoulli, 24(3), 2176\u20132203.","journal-title":"Bernoulli"},{"key":"5863_CR72","first-page":"448","volume":"2","author":"JW Tukey","year":"1960","unstructured":"Tukey, J. W. (1960). A survey of sampling from contaminated distributions. Contributions to Probability and Statistics, 2, 448\u2013485.","journal-title":"Contributions to Probability and Statistics"},{"issue":"1","key":"5863_CR73","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/aoms\/1177704711","volume":"33","author":"JW Tukey","year":"1962","unstructured":"Tukey, J. W. (1962). The future of data analysis. The Annals of Mathematical Statistics, 33(1), 1\u201367.","journal-title":"The Annals of Mathematical Statistics"},{"key":"5863_CR74","unstructured":"Vapnik, V.\u00a0N. (1998). Statistical learning theory. Adaptive and Learning Systems for Signal Processing, Communications, and Control. Wiley, New York."},{"key":"5863_CR75","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3264-1","volume-title":"The nature of statistical learning theory. Statistics for Engineering and Information Science","author":"VN Vapnik","year":"2000","unstructured":"Vapnik, V. N. (2000). The nature of statistical learning theory. Statistics for Engineering and Information Science (second ed.). New York: Springer.","edition":"second"}],"updated-by":[{"DOI":"10.1007\/s10994-020-05885-5","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2020,6,3]],"date-time":"2020-06-03T00:00:00Z","timestamp":1591142400000}}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-019-05863-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-019-05863-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-019-05863-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T00:23:18Z","timestamp":1619482998000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-019-05863-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,27]]},"references-count":75,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["5863"],"URL":"https:\/\/doi.org\/10.1007\/s10994-019-05863-6","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s10994-020-05885-5","asserted-by":"object"}]},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,27]]},"assertion":[{"value":"6 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2020","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"There is a mistake in one of the authors\u2019 names (in both online and print versions of the article): it should be Timoth\u00e9e Mathieu instead of Timloth\u00e9e Mathieu.","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}