Large margin nearest neighbor

The main intuition behind LMNN is to learn a pseudometric under which all data instances in the training set are surrounded by at least k instances that share the same class label. If this is achieved, the leave-one-out error (a special case of cross validation) is minimized. Let the training data consist of a data set ${\displaystyle D=\{({\vec {x}}_{1},y_{1}),\dots ,({\vec {x}}_{n},y_{n})\}\subset R^{d}\times C}$, where the set of possible class categories is ${\displaystyle C=\{1,\dots ,c\}}$.

The algorithm learns a pseudometric of the type

${\displaystyle d({\vec {x}}_{i},{\vec {x}}_{j})=({\vec {x}}_{i}-{\vec {x}}_{j})^{\top }\mathbf {M} ({\vec {x}}_{i}-{\vec {x}}_{j})}$.

For ${\displaystyle d(\cdot ,\cdot )}$ to be well defined, the matrix ${\displaystyle \mathbf {M} }$ needs to be positive semi-definite. The Euclidean metric is a special case, where ${\displaystyle \mathbf {M} }$ is the identity matrix. This generalization is often (falsely) referred to as Mahalanobis metric.

Figure 1 illustrates the effect of the metric under varying ${\displaystyle \mathbf {M} }$. The two circles show the set of points with equal distance to the center ${\displaystyle {\vec {x}}_{i}}$. In the Euclidean case this set is a circle, whereas under the modified (Mahalanobis) metric it becomes an ellipsoid.

Figure 1: Schematic illustration of LMNN.

The algorithm distinguishes between two types of special data points: target neighbors and impostors.

Large margin nearest neighbors optimizes the matrix ${\displaystyle \mathbf {M} }$ with the help of semidefinite programming. The objective is twofold: For every data point ${\displaystyle {\vec {x}}_{i}}$, the target neighbors should be close and the impostors should be far away. Figure 1 shows the effect of such an optimization on an illustrative example. The learned metric causes the input vector ${\displaystyle {\vec {x}}_{i}}$ to be surrounded by training instances of the same class. If it was a test point, it would be classified correctly under the ${\displaystyle k=3}$ nearest neighbor rule.

The first optimization goal is achieved by minimizing the average distance between instances and their target neighbors

${\displaystyle \sum _{i,j\in N_{i}}d({\vec {x}}_{i},{\vec {x}}_{j})}$.

The second goal is achieved by penalizing distances to impostors ${\displaystyle {\vec {x}}_{l}}$ that are less than one unit further away than target neighbors ${\displaystyle {\vec {x}}_{j}}$ (and therefore pushing them out of the local neighborhood of ${\displaystyle {\vec {x}}_{i}}$). The resulting value to be minimized can be stated as:

${\displaystyle \sum _{i,j\in N_{i},l,y_{l}\neq y_{i}}[d({\vec {x}}_{i},{\vec {x}}_{j})+1-d({\vec {x}}_{i},{\vec {x}}_{l})]_{+}}$

With a hinge loss function ${\textstyle [\cdot ]_{+}=\max(\cdot ,0)}$, which ensures that impostor proximity is not penalized when outside the margin. The margin of exactly one unit fixes the scale of the matrix ${\displaystyle M}$. Any alternative choice ${\displaystyle c>0}$ would result in a rescaling of ${\displaystyle M}$ by a factor of ${\displaystyle 1/c}$.

The final optimization problem becomes:

${\displaystyle \min _{\mathbf {M} }\sum _{i,j\in N_{i}}d({\vec {x}}_{i},{\vec {x}}_{j})+\lambda \sum _{i,j,l}\xi _{ijl}}$

${\displaystyle \forall _{i,j\in N_{i},l,y_{l}\neq y_{i}}}$

${\displaystyle d({\vec {x}}_{i},{\vec {x}}_{j})+1-d({\vec {x}}_{i},{\vec {x}}_{l})\leq \xi _{ijl}}$

${\displaystyle \xi _{ijl}\geq 0}$

${\displaystyle \mathbf {M} \succeq 0}$

The hyperparameter ${\textstyle \lambda >0}$ is some positive constant (typically set through cross-validation). Here the variables ${\displaystyle \xi _{ijl}}$ (together with two types of constraints) replace the term in the cost function. They play a role similar to slack variables to absorb the extent of violations of the impostor constraints. The last constraint ensures that ${\displaystyle \mathbf {M} }$ is positive semi-definite. The optimization problem is an instance of semidefinite programming (SDP). Although SDPs tend to suffer from high computational complexity, this particular SDP instance can be solved very efficiently due to the underlying geometric properties of the problem. In particular, most impostor constraints are naturally satisfied and do not need to be enforced during runtime (i.e. the set of variables ${\displaystyle \xi _{ijl}}$is sparse). A particularly well suited solver technique is the working set method, which keeps a small set of constraints that are actively enforced and monitors the remaining (likely satisfied) constraints only occasionally to ensure correctness.

LMNN was extended to multiple local metrics in the 2008 paper.[2] This extension significantly improves the classification error, but involves a more expensive optimization problem. In their 2009 publication in the Journal of Machine Learning Research,[3] Weinberger and Saul derive an efficient solver for the semi-definite program. It can learn a metric for the MNIST handwritten digit data set in several hours, involving billions of pairwise constraints. An open source Matlab implementation is freely available at the authors web page.

Kumal et al.[4] extended the algorithm to incorporate local invariances to multivariate polynomial transformations and improved regularization.

• Matlab Implementation
• ICML 2010 Tutorial on Metric Learning