Comparer des méthodes

	Apprentissage métrique robuste	Régression linéaire robuste
Domaine	Apprentissage automatique	Apprentissage automatique
Famille	Machine learning	Machine learning
Année d'origine	2009–2012	1964–1987
Auteur d'origine	Various (Weinberger, Saul, Schultz et al.; robust extensions by Shen, Cao and others, 2009–2012)	Huber, P. J.; Rousseeuw, P. J.
Type	Supervised/semi-supervised distance metric learning with robustness to noise and outliers	Outlier-resistant supervised regression
Source fondatrice	Shen, C., Kim, J., Wang, L., & van den Hengel, A. (2012). Positive Semidefinite Metric Learning Using Boosting-like Algorithms. Journal of Machine Learning Research, 13, 1007–1036.	Huber, P. J. (1964). Robust Estimation of a Location Parameter. Annals of Mathematical Statistics, 35(1), 73–101.
Alias	robust distance metric learning, noise-robust metric learning, outlier-robust similarity learning, robust DML	robust regression, M-estimator regression, Huber regression, outlier-resistant regression
Apparentées	5	5
Résumé	Robust Metric Learning learns a Mahalanobis distance function from labeled or pairwise-constrained data while actively resisting the distortion caused by noisy labels, corrupted examples, or outliers. By replacing standard hinge or squared losses with robust alternatives and adding regularization, it produces a distance metric that generalises well even when the training set is imperfect — a common situation in real-world scientific and applied tasks.	Robust linear regression fits a linear model between predictors and a continuous outcome while down-weighting or discarding influential outliers, preventing the few anomalous observations that OLS is famously sensitive to from distorting the entire estimated line. Major variants include Huber regression, iteratively reweighted least squares (IRLS), RANSAC, and Theil-Sen estimation.