방법 비교

	강건 거리 학습	메트릭 학습
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	2009–2012	2003 (foundational); refined 2009 (LMNN)
창시자	Various (Weinberger, Saul, Schultz et al.; robust extensions by Shen, Cao and others, 2009–2012)	Xing, E. P.; Jordan, M. I.; Russell, S.; Ng, A. Y.
유형	Supervised/semi-supervised distance metric learning with robustness to noise and outliers	Representation learning / supervised distance optimization
원전	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.	Xing, E. P., Jordan, M. I., Russell, S., & Ng, A. Y. (2003). Distance metric learning with application to clustering with side-information. In Advances in Neural Information Processing Systems (NIPS), 16, 505–512.
별칭	robust distance metric learning, noise-robust metric learning, outlier-robust similarity learning, robust DML	Distance Metric Learning, Similarity Learning, DML, Representation Learning via Distance
관련	5	5
요약	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.	Metric learning is a machine-learning framework that trains a distance or similarity function from data so that semantically similar examples end up close together in the learned space while dissimilar examples are pushed apart. Unlike fixed distances such as Euclidean, the learned metric adapts to the structure of the task, making downstream classifiers, clusterers, and retrieval systems significantly more accurate.