A Survey on Metric Learning for Feature Vectors and Structured Data
read the original abstract
The need for appropriate ways to measure the distance or similarity between data is ubiquitous in machine learning, pattern recognition and data mining, but handcrafting such good metrics for specific problems is generally difficult. This has led to the emergence of metric learning, which aims at automatically learning a metric from data and has attracted a lot of interest in machine learning and related fields for the past ten years. This survey paper proposes a systematic review of the metric learning literature, highlighting the pros and cons of each approach. We pay particular attention to Mahalanobis distance metric learning, a well-studied and successful framework, but additionally present a wide range of methods that have recently emerged as powerful alternatives, including nonlinear metric learning, similarity learning and local metric learning. Recent trends and extensions, such as semi-supervised metric learning, metric learning for histogram data and the derivation of generalization guarantees, are also covered. Finally, this survey addresses metric learning for structured data, in particular edit distance learning, and attempts to give an overview of the remaining challenges in metric learning for the years to come.
This paper has not been read by Pith yet.
Forward citations
Cited by 4 Pith papers
-
UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction
UMAP is a novel, scalable manifold learning algorithm for dimension reduction that competes with t-SNE while preserving more global structure and having no embedding dimension restrictions.
-
The Matching Principle: A Geometric Theory of Loss Functions for Nuisance-Robust Representation Learning
The matching principle unifies nuisance-robust representation learning by requiring Jacobian regularization whose range covers the covariance of label-preserving deployment nuisances, with closed-form optimality proof...
-
Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty
IDEAL is a selective dual ambulance dispatch framework that learns context-specific travel times via weakly supervised bilevel networks and models uncertainty with Burg-divergence perturbations to achieve better respo...
-
Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models
An algorithm learns a Mahalanobis metric from triplet queries via spectral initialization and gradient descent in the Bradley-Terry model, with convergence guarantees and transfer of individual fairness from estimated...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.