Feasibility Based Large Margin Nearest Neighbor Metric Learning

Abstract

Large margin nearest neighbor (LMNN) is a metric learner which optimizes the performance of the popular \(k\)NN classifier. However, its resulting metric relies on pre-selected target neighbors. In this paper, we address the feasibility of LMNN's optimization constraints regarding these target points, and introduce a mathematical measure to evaluate the size of the feasible region of the optimization problem. We enhance the optimization framework of LMNN by a weighting scheme which prefers data triplets which yield a larger feasible region. This increases the chances to obtain a good metric as the solution of LMNN's problem. We evaluate the performance of the resulting feasibility-based LMNN algorithm using synthetic and real datasets. The empirical results show an improved accuracy for different types of datasets in comparison to regular LMNN.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyhosseini2016feasibility

Related papers

• Local Distance Metric Learning For Nearest Neighbor Algorithm (2018)0.00
• Adaptive Nearest Neighbor: A General Framework For Distance Metric Learning (2019)0.00
• Interpretable Locally Adaptive Nearest Neighbors (2020)3.58
• Acceleration Of Large Margin Metric Learning For Nearest Neighbor Classification Using Triplet Mining And Stratified Sampling (2020)2.26
• Active Nearest-neighbor Learning In Metric Spaces (2016)0.00
• Robust Mahalanobis Metric Learning Via Geometric Approximation Algorithms (2019)0.00
• On High-dimensional Modifications Of The Nearest Neighbor Classifier (2024)0.00
• Rethinking Preventing Class-collapsing In Metric Learning With Margin-based Losses (2020)9.23