Machine learningMachine learning

Robust Metric Learning

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.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. 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. link
  2. Cao, Q., Guo, Z.-C., & Ying, Y. (2012). Generalization Bounds for Metric and Similarity Learning. Machine Learning, 102(1), 115–132. link

Related methods

ScholarGateRobust Metric Learning (Robust Metric Learning (Outlier-Resistant Distance Metric Learning)). Retrieved 2026-06-04 from https://scholargate.app/en/machine-learning/robust-metric-learning