Safe triplet screening for distance metric learning
From MaRDI portal
Publication:5214409
Abstract: We study safe screening for metric learning. Distance metric learning can optimize a metric over a set of triplets, each one of which is defined by a pair of same class instances and an instance in a different class. However, the number of possible triplets is quite huge even for a small dataset. Our safe triplet screening identifies triplets which can be safely removed from the optimization problem without losing the optimality. Compared with existing safe screening studies, triplet screening is particularly significant because of (1) the huge number of possible triplets, and (2) the semi-definite constraint in the optimization. We derive several variants of screening rules, and analyze their relationships. Numerical experiments on benchmark datasets demonstrate the effectiveness of safe triplet screening.
Recommendations
- Deep metric learning using triplet network
- Joint distance and similarity measure learning based on triplet-based constraints
- Efficient distance metric learning by adaptive sampling and mini-batch stochastic gradient descent (SGD)
- Learning a distance metric from relative comparisons between quadruplets of images
- Metric learning: a survey
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Dual Approach to Semidefinite Least-Squares Problems
- Conjugate gradient methods for the Rayleigh quotient minimization of generalized eigenvalue problems
- Deep metric learning using triplet network
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- Distance metric learning for large margin nearest neighbor classification
- FaceNet
- Gap safe screening rules for sparsity enforcing penalties
- Lasso screening rules via dual polytope projection
- Least-Squares Covariance Matrix Adjustment
- Metric learning: a survey
- Safe Feature Elimination in Sparse Supervised Learning
- Scaling up sparse support vector machines by simultaneous feature and sample reduction
- Two-Point Step Size Gradient Methods
Cited in
(5)
This page was built for publication: Safe triplet screening for distance metric learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5214409)
