Safe triplet screening for distance metric learning
From MaRDI portal
Publication:5214409
DOI10.1162/NECO_A_01240zbMATH Open1494.68234arXiv1802.03923OpenAlexW2980471706WikidataQ90718188 ScholiaQ90718188MaRDI QIDQ5214409FDOQ5214409
Authors: Tomoki Yoshida, Ichiro Takeuchi, Masayuki Karasuyama 
Publication date: 7 February 2020
Published in: Neural Computation (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1802.03923
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
Learning and adaptive systems in artificial intelligence (68T05) Applications of mathematical programming (90C90)
Cites Work
- Distance metric learning for large margin nearest neighbor classification
- FaceNet
- Title not available (Why is that?)
- Two-Point Step Size Gradient Methods
- Title not available (Why is that?)
- A Dual Approach to Semidefinite Least-Squares Problems
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- Safe Feature Elimination in Sparse Supervised Learning
- Least-Squares Covariance Matrix Adjustment
- Metric learning: a survey
- Gap safe screening rules for sparsity enforcing penalties
- Lasso screening rules via dual polytope projection
- Conjugate gradient methods for the Rayleigh quotient minimization of generalized eigenvalue problems
- Deep metric learning using triplet network
- Scaling up sparse support vector machines by simultaneous feature and sample reduction
Cited In (5)
Uses Software
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)
