Nonstationary Distance Metric Learning
Recent work in distance metric learning has focused on learning transformations of data that best align with provided sets of pairwise similarity and dissimilarity constraints. The learned transformations lead to improved retrieval, classification, and clustering algorithms due to the better adapted distance or similarity measures. Here, we introduce 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 to the feature subspaces in which the class structure is apparent. We propose and evaluate COMID-SADL, an 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 demonstrate COMID-SADL on both real and synthetic data sets and show significant performance improvements relative to previously proposed batch and online distance metric learning algorithms.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringMetric LearningRetrievalSimilar Papers 제목 키워드 기반
Similarity Function Tracking using Pairwise Comparisons
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 tr…
ClusteringMetric LearningRetrievalDynamic Metric Learning from Pairwise Comparisons
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 tr…
ClusteringMetric LearningRetrievalTesting for high frequency features in a noisy signal
Given nonstationary data, one generally wants to extract the trend from the noise by smoothing or filtering. However, it is often important to delineate a third intermediate category, that we call high frequency (HF) fea…
Vocal Bursts Intensity PredictionConfidence intervals for nonparametric regression
We demonstrate and discuss nonasymptotic bounds in probability for the cost of a regression scheme with a general loss function from the perspective of the Rademacher theory, and for the optimality with respect to the av…
regressionHellinger distance based drift detection for nonstationary environments
Most machine learning algorithms, including many online learners, assume that the data distribution to be learned is fixed. There are many real-world problems where the distribution of the data changes as a function of t…
Drift Detection