Similarity learning

 Similarity learning is an area of supervised machine learning in artificial intelligence. It is closely related to regression and classification, but the goal is to learn a similarity function that measures how similar or related two objects are. It has applications in ranking, in recommendation systems, visual identity tracking, face verification, and speaker verification.

Learning setupEdit

There are four common setups for similarity and metric distance learning.

Regression similarity learning

In this setup, pairs of objects are given ${\displaystyle (x_{i}^{1},x_{i}^{2})}$ together with a measure of their similarity ${\displaystyle y_{i}\in R}$. The goal is to learn a function that approximates ${\displaystyle f(x_{i}^{1},x_{i}^{2})\sim y_{i}}$ for every new labeled triplet example ${\displaystyle (x_{i}^{1},x_{i}^{2},y_{i})}$. This is typically achieved by minimizing a regularized loss ${\displaystyle \min _{W}\sum _{i}loss(w;x_{i}^{1},x_{i}^{2},y_{i})+reg(w)}$.

Classification similarity learning

Given are pairs of similar objects ${\displaystyle (x_{i},x_{i}^{+})}$ and non similar objects ${\displaystyle (x_{i},x_{i}^{-})}$. An equivalent formulation is that every pair ${\displaystyle (x_{i}^{1},x_{i}^{2})}$ is given together with a binary label ${\displaystyle y_{i}\in \{0,1\}}$ that determines if the two objects are similar or not. The goal is again to learn a classifier that can decide if a new pair of objects is similar or not.

Ranking similarity learning

Given are triplets of objects ${\displaystyle (x_{i},x_{i}^{+},x_{i}^{-})}$ whose relative similarity obey a predefined order: ${\displaystyle x_{i}}$ is known to be more similar to ${\displaystyle x_{i}^{+}}$ than to ${\displaystyle x_{i}^{-}}$. The goal is to learn a function ${\displaystyle f}$ such that for any new triplet of objects ${\displaystyle (x,x^{+},x^{-})}$, it obeys ${\displaystyle f(x,x^{+})>f(x,x^{-})}$ (contrastive learning). This setup assumes a weaker form of supervision than in regression, because instead of providing an exact measure of similarity, one only has to provide the relative order of similarity. For this reason, ranking-based similarity learning is easier to apply in real large-scale applications.^[1]

Locality sensitive hashing (LSH)^[2]

Hashes input items so that similar items map to the same "buckets" in memory with high probability (the number of buckets being much smaller than the universe of possible input items). It is often applied in nearest neighbor search on large-scale high-dimensional data, e.g., image databases, document collections, time-series databases, and genome databases.^[3]

A common approach for learning similarity, is to model the similarity function as a bilinear form. For example, in the case of ranking similarity learning, one aims to learn a matrix W that parametrizes the similarity function ${\displaystyle f_{W}(x,z)=x^{T}Wz}$. When data is abundant, a common approach is to learn a siamese network - A deep network model with parameter sharing.

Metric learningEdit

Similarity learning is closely related to distance metric learning. Metric learning is the task of learning a distance function over objects. A metric or distance function has to obey four axioms: non-negativity, identity of indiscernibles, symmetry and subadditivity (or the triangle inequality). In practice, metric learning algorithms ignore the condition of identity of indiscernibles and learn a pseudo-metric.

When the objects ${\displaystyle x_{i}}$ are vectors in ${\displaystyle R^{d}}$, then any matrix ${\displaystyle W}$ in the symmetric positive semi-definite cone ${\displaystyle S_{+}^{d}}$ defines a distance pseudo-metric of the space of x through the form ${\displaystyle D_{W}(x_{1},x_{2})^{2}=(x_{1}-x_{2})^{\top }W(x_{1}-x_{2})}$. When ${\displaystyle W}$ is a symmetric positive definite matrix, ${\displaystyle D_{W}}$ is a metric. Moreover, as any symmetric positive semi-definite matrix ${\displaystyle W\in S_{+}^{d}}$ can be decomposed as ${\displaystyle W=L^{\top }L}$ where ${\displaystyle L\in R^{e\times d}}$ and ${\displaystyle e\geq rank(W)}$, the distance function ${\displaystyle D_{W}}$ can be rewritten equivalently ${\displaystyle D_{W}(x_{1},x_{2})^{2}=(x_{1}-x_{2})^{\top }L^{\top }L(x_{1}-x_{2})=\|L(x_{1}-x_{2})\|_{2}^{2}}$. The distance ${\displaystyle D_{W}(x_{1},x_{2})^{2}=\|x_{1}'-x_{2}'\|_{2}^{2}}$ corresponds to the Euclidean distance between the transformed feature vectors ${\displaystyle x_{1}'=Lx_{1}}$ and ${\displaystyle x_{2}'=Lx_{2}}$.

Many formulations for metric learning have been proposed.^[4][5] Some well-known approaches for metric learning include Learning from relative comparisons^[6] which is based on the Triplet loss, Large margin nearest neighbor,^[7] Information theoretic metric learning (ITML).^[8]

In statistics, the covariance matrix of the data is sometimes used to define a distance metric called Mahalanobis distance.

ApplicationsEdit

Similarity learning is used in information retrieval for learning to rank, in face verification or face identification,^[9][10] and in recommendation systems. Also, many machine learning approaches rely on some metric. This includes unsupervised learning such as clustering, which groups together close or similar objects. It also includes supervised approaches like K-nearest neighbor algorithm which rely on labels of nearby objects to decide on the label of a new object. Metric learning has been proposed as a preprocessing step for many of these approaches.^[11]

ScalabilityEdit

Metric and similarity learning naively scale quadratically with the dimension of the input space, as can easily see when the learned metric has a bilinear form ${\displaystyle f_{W}(x,z)=x^{T}Wz}$. Scaling to higher dimensions can be achieved by enforcing a sparseness structure over the matrix model, as done with HDSL,^[12] and with COMET.^[13]

This article uses material from the Wikipedia article  Metasyntactic variable, which is released under the  Creative Commons Attribution-ShareAlike 3.0 Unported License.