Classification from triplet comparison data
From MaRDI portal
Abstract: Learning from triplet comparison data has been extensively studied in the context of metric learning, where we want to learn a distance metric between two instances, and ordinal embedding, where we want to learn an embedding in an Euclidean space of the given instances that preserves the comparison order as well as possible. Unlike fully-labeled data, triplet comparison data can be collected in a more accurate and human-friendly way. Although learning from triplet comparison data has been considered in many applications, an important fundamental question of whether we can learn a classifier only from triplet comparison data has remained unanswered. In this paper, we give a positive answer to this important question by proposing an unbiased estimator for the classification risk under the empirical risk minimization framework. Since the proposed method is based on the empirical risk minimization framework, it inherently has the advantage that any surrogate loss function and any model, including neural networks, can be easily applied. Furthermore, we theoretically establish an estimation error bound for the proposed empirical risk minimizer. Finally, we provide experimental results to show that our method empirically works well and outperforms various baseline methods.
Recommendations
- Classification from pairwise similarities/dissimilarities and unlabeled data via empirical risk minimization
- Deep metric learning using triplet network
- Safe triplet screening for distance metric learning
- Joint distance and similarity measure learning based on triplet-based constraints
- Learning a distance metric from relative comparisons between quadruplets of images
Cites work
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- scientific article; zbMATH DE number 3111121 (Why is no real title available?)
- Information-theoretic semi-supervised metric learning via entropy regularization
- Lens depth function and \(k\)-relative neighborhood graph: versatile tools for ordinal data analysis
- Preference learning: An introduction
Cited in
(1)
This page was built for publication: Classification from triplet comparison data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5131191)
