Similarity Function Tracking Using Pairwise Comparisons

DOI10.1109/TSP.2017.2739100MaRDI QIDQ4621918zbMATH OpenOpenAlexFDO

Authors Kristjan Greenewald, Stephen J. Kelley, Brandon Oselio, Alfred O. III Hero

Publication date 8 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1701.02804

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Paired and multiple comparisons; multiple testing (62J15) Measures of information, entropy (94A17)

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 online learners. Specifically, we create a retro-initialized composite objective mirror descent (COMID) ensemble (RICE) consisting of a set of parallel COMID learners with different learning rates, and demonstrate parameter-free RICE-OCELAD metric learning on both synthetic data and a highly nonstationary Twitter dataset. We show significant performance improvements and increased robustness to nonstationary effects relative to previously proposed batch and online distance metric learning algorithms.

Recommendations

• scientific article; zbMATH DE number 802810
• scientific article; zbMATH DE number 4215137
• Comparing resemblance measures
• scientific article; zbMATH DE number 7299845
• Computing similarity between piecewise-linear functions
• A comparative study of similarity measures
• Statistical properties of similarity score functions

Cited in

(2)

• scientific article; zbMATH DE number 7299845 (Why is no real title available?)
• Similarity-Based Equality with Lazy Evaluation

This page was built for publication: Similarity Function Tracking Using Pairwise Comparisons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4621918)