Acceleration Of Large Margin Metric Learning For Nearest Neighbor Classification Using Triplet Mining And Stratified Sampling

Abstract

Metric learning is one of the techniques in manifold learning with the goal of finding a projection subspace for increasing and decreasing the inter- and intra-class variances, respectively. Some of the metric learning methods are based on triplet learning with anchor-positive-negative triplets. Large margin metric learning for nearest neighbor classification is one of the fundamental methods to do this. Recently, Siamese networks have been introduced with the triplet loss. Many triplet mining methods have been developed for Siamese networks; however, these techniques have not been applied on the triplets of large margin metric learning for nearest neighbor classification. In this work, inspired by the mining methods for Siamese networks, we propose several triplet mining techniques for large margin metric learning. Moreover, a hierarchical approach is proposed, for acceleration and scalability of optimization, where triplets are selected by stratified sampling in hierarchical hyper-sp

Stats

• citations1
• S2 citations—
• github stars0
• HF likes0
• heat score2.26
• arxiv keypoorheravi2020acceleration

Related papers

• Neighborhood Watch: Representation Learning With Local-margin Triplet Loss And Sampling Strategy For K-nearest-neighbor Image Classification (2019)0.00
• Feasibility Based Large Margin Nearest Neighbor Metric Learning (2016)0.00
• Adaptive Neighborhood Metric Learning (2022)10.07
• Rethinking Preventing Class-collapsing In Metric Learning With Margin-based Losses (2020)9.23
• Improving Collaborative Metric Learning With Efficient Negative Sampling (2019)10.07
• Dynamic Sampling For Deep Metric Learning (2020)5.84
• Local Distance Metric Learning For Nearest Neighbor Algorithm (2018)0.00
• Mining On Manifolds: Metric Learning Without Labels (2018)14.31