Similarity Function Tracking Using Pairwise Comparisons

Abstract

Recent work in distance metric learning has focused on learning transformations of data that best align with specified pairwise similarity and dissimilarity constraints, often supplied by a human observer. The learned transformations lead to improved retrieval, classification, and clustering algorithms due to the better adapted distance or similarity measures. Here, we address the problem of learning these transformations when the underlying constraint generation process is nonstationary. This nonstationarity can be due to changes in either the ground-truth clustering used to generate constraints or changes in the feature subspaces in which the class structure is apparent. We propose Online Convex Ensemble StrongLy Adaptive Dynamic Learning (OCELAD), a general adaptive, online approach for learning and tracking optimal metrics as they change over time that is highly robust to a variety of nonstationary behaviors in the changing metric. We apply the OCELAD framework to an ensemble of on

Stats

• citations1
• S2 citations—
• github stars0
• HF likes0
• heat score2.26
• arxiv keygreenewald2017similarity

Related papers

• Dynamic Metric Learning From Pairwise Comparisons (2016)3.58
• Nonstationary Distance Metric Learning (2016)0.00
• Large Scale Local Online Similarity/distance Learning Framework Based On Passive/aggressive (2018)2.26
• Sparse Online Relative Similarity Learning (2021)2.26
• Active Metric Learning And Classification Using Similarity Queries (2022)0.00
• Discriminative Learning Of Similarity And Group Equivariant Representations (2018)0.00
• A New Similarity Space Tailored For Supervised Deep Metric Learning (2020)3.58
• Deep Metric Learning Using Similarities From Nonlinear Rank Approximations (2019)2.26