Proceedings

Distance Metric Learning under Covariate Shift

Bin Cao, Xiaochuan Ni, Jian-Tao Sun, Gang Wang, Qiang Yang

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 1204-1209.

https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-205

Abstract

Learning distance metrics is a fundamental problem in machine learning. Previous distance-metric learning research assumes that the training and test data are drawn from the same distribution, which may be violated in practical applications. When the distributions differ, a situation referred to as covariate shift, the metric learned from training data may not work well on the test data. In this case the metric is said to be inconsistent. In this paper, we address this problem by proposing a novel metric learning framework known as consistent distance metric learning (CDML), which solves the problem under covariate shift situations. We theoretically analyze the conditions when the metrics learned under covariate shift are consistent. Based on the analysis, a convex optimization problem is proposed to deal with the CDML problem. An importance sampling method is proposed for metric learning and two importance weighting strategies are proposed and compared in this work. Experiments are carried out on synthetic and real world datasets to show the effectiveness of the proposed method.

Bin Cao, Xiaochuan Ni, Jian-Tao Sun, Gang Wang, and Qiang Yang. 2011. Distance Metric Learning under Covariate Shift. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11. IJCAI, 1204–1209. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-205
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards