Robust classification via MOM minimization

Guillaume Lecué (1) , Matthieu Lerasle (2, 3, 4) , Timothée Mathieu (2, 4)

1 ENSAE - Ecole Nationale de la Statistique et de l'Analyse Economique
2 LMO - Laboratoire de Mathématiques d'Orsay
3 SELECT - Model selection in statistical learning
4 CELESTE - Statistique mathématique et apprentissage

We present an extension of Vapnik's classical empirical risk minimizer (ERM) where the empirical risk is replaced by a median-of-means (MOM) estimator, the new estimators are called MOM minimizers. While ERM is sensitive to corruption of the dataset for many classical loss functions used in classification, we show that MOM minimizers behave well in theory, in the sense that it achieves Vapnik's (slow) rates of convergence under weak assumptions: data are only required to have a finite second moment and some outliers may also have corrupted the dataset. We propose an algorithm inspired by MOM minimizers. These algorithms can be analyzed using arguments quite similar to those used for Stochastic Block Gradient descent. As a proof of concept, we show how to modify a proof of consistency for a descent algorithm to prove consistency of its MOM version. As MOM algorithms perform a smart subsampling, our procedure can also help to reduce substantially time computations and memory ressources when applied to non linear algorithms. These empirical performances are illustrated on both simulated and real datasets.

Mots clés: Robust Machine Learning; Empirical Processes

Domaines: Théorie [stat.TH]

Guillaume Lecué, Matthieu Lerasle, Timothée Mathieu. Robust classification via MOM minimization. Machine Learning, 2020. ⟨hal-01923035⟩