Difference between revisions of "learning a Nonlinear Embedding by Preserving Class Neighborhood Structure"

From statwiki
Jump to: navigation, search
(Neighborhood Component Analysis)
(Neighborhood Component Analysis)
Line 61: Line 61:
 
where
 
where
  
<br> <center> <math> \mathbf  \frac{\partial O_{NCA}}{\partial f(x^a|W)}= </math> </center>
+
<br> <center> <math> \mathbf  \frac{\partial O_{NCA}}{\partial f(x^a|W)}= -2 \[\sum_{b:c^a=c^b} p_{ab}d_{ab} - \sum_{b:c^a=c^b} p_{ab} \[\sum_{z \neq a} p_{az}d_{az}\] \]  </math> </center>
  
 
and <math> \mathbf \frac{\partial f(x^a|W)}{\partial W} </math> is computed using the standard backpropagation algorithm.
 
and <math> \mathbf \frac{\partial f(x^a|W)}{\partial W} </math> is computed using the standard backpropagation algorithm.

Revision as of 12:26, 1 July 2009

Introduction

The paper <ref>Salakhutdinov, R., & Hinton, G. E. (2007). Learning a nonlinear embedding by preserving class neighbourhood structure. AI and Statistics.</ref> presented here describes a method to learn a nonlinear transformation from the input space to a low-dimensional feature space in which K-nearest neighbour classification performs well. As the performance of algorithms like K-nearest neighbours (KNN) that are based on computing distances, the main objective of the proposed algorithm is to learn a good similarity measure that can provide insight into how high-dimensional data is organized. The nonlinear transformation is learned by pre-training and fine-tuning a multilayer neural network. The authors also show how to enhance the performance of non-linear transformation further using unlabeled data. Experimental results on a widely used version of the MNIST handwritten digit recognition task show that proposed algorithm achieves a much lower error rate than SVM or standard backpropagation.

Background and Related Work

Learning a similarity measure (or distance metric) over the input space [math] {\mathbf X} [/math] is an important task in machine learning, and is closely related to the feature extraction problem. A distance metric [math] \mathbf D [/math] (e. g. Euclidean) measures the similarity between two input vectors [math] {\mathbf x}^a, {\mathbf x}^b \in {\mathbf X} [/math] by computing [math] \mathbf D[{\mathbf f}(x^a|W),{\mathbf f}(x^b|W)][/math], where [math] {\mathbf f}(x|W)[/math] represents the mapping function from input vector [math] {\mathbf X} [/math] to feature space [math] {\mathbf Y} [/math] parametrized by [math] {\mathbf W} [/math]. Previous work studied this problem where [math] \mathbf D [/math] is the Euclidean distance and [math] {\mathbf f} [/math] is simple linear projection, i.e. [math] {\mathbf f}(x|W)=Wx [/math]. For example Linear discriminant analysis (LDA) learns the matrix [math] W [/math] that minimizes the within-class distances to between-class distances ratio.

Globerson and Roweis <ref> A. Globerson and S. T. Roweis. Metric learning by collapsing classes. In NIPS, 2005 </ref> proposed a method for learning the matrix [math] W [/math] such that the input vectors from the same class are mapped to a tight cluster. Also, Weinberger et.al. <ref> K. Q.Weinberger, J. Blitzer, and L. K. Saul. Distance metric learning for large margin nearest neighbor classification. In NIPS, 2005. </ref> also learned [math] W [/math] with the goals of both making the K-nearest neighbours belong to the same class and making examples from different classes be separated by a large margin. All these methods rely on linear transformation, which has a limited number of parameters and thus cannot model higher-order correlations between the original data dimensions.

Proposed Method

In this paper, authors show that a nonlinear transformation function, with many more parameters, enables us to discover low-dimensional representations of high-dimensional data that perform much better than existing linear methods provided the dataset is large enough to allow for the parameters to be estimated. Regarding the digit recognition application considered in the paper and adopting a probabilistic approach, one can learn the non-linear transformation by maximizing the log probability of the pairs that occur in the training set. The probability distribution over all possible pairs of images [math] \mathbf x^a, \mathbf x^b [/math], is defined using the squared distances between their codes, [math] {\mathbf f}(x^a),{\mathbf f}(x^b) [/math]:


[math] \mathbf p(x^a,x^b)= \frac{||f(x^a)-f(x^b)||^2}{\sum_{k\lt l} ||f(x^k)-f(x^l)||^2}[/math]

This formulation is an attempt to model the structure in the pairings, not the structure in the individual images or the mutual information between the code vectors. An alternative approach used here is based on a recent discovery of an effective and unsupervised algorithm for training a multi-layer, non-linear ”encoder” network that transforms the input data vector [math] \mathbf X [/math] into a low-dimensional feature representation [math] \mathbf f(x|W) [/math] capturing a lot of the structure in the input data <ref> G. E. Hinton and R. R. Salakhutdinov. Reducing the dimensionality of data with neural networks. Science, 313(5786):504–507, July 2006. </ref>.

They proposed algorithm performs two steps: First, the recently discovered unsupervised algorithm is used in a pre-training stage, i.e.to initialize the parameter vector [math] W [/math] that defines the mapping from input vectors to their low-dimensional representation. Next, the initial parameters are finetuned by performing gradient descent in the objective function defined by Neighbourhood Component Analysis (NCA) method <ref> J. Goldberger, S. T. Roweis, G. E. Hinton, and Ruslan Salakhutdinov. Neighbourhood components analysis. In NIPS, 2004 </ref>. The resultant learning algorithm is a non-linear transformation of the input space optimized to make KNN perform well in the low-dimensional feature space.

Neighborhood Component Analysis

Assuming a given set of N labeled training cases [math] (x^a,c^a),\ a=1, 2, 3, \ldots, N [/math], where [math] x^a \in R^d [/math], and [math] c^a \in \{1,2, \ldots, C\} [/math]. For each training vector [math] \mathbf x^a [/math], the probability that point [math] \mathbf a [/math] selects one of its neighbours [math] \mathbf b [/math] in the transformed feature space as, is defined as below:


[math] p_{ab}=\frac{exp(-d_{ab})}{\sum_{z \neq a} exp(-d_{az})} [/math]

Assuming Euclidean distance metric we have:


[math] \mathbf d_{ab}=||f(x^a|W)-f(x^b|W) ||^2[/math]


If [math] \mathbf f(x|W)=Wx [/math] is constrained to be a linear transformation, we get linear NCA. However, here authors define [math] \mathbf f(x|W) [/math] using a multi-layer, nonlinear neural network, parametrized by the weight vector [math] W [/math]. The probability that point [math] a [/math] belongs to class [math] k [/math] depends on the relative proximity of all other data points that belong to class [math] k [/math], i.e.


[math] \mathbf p(c^a=k)=\sum_{b:c^b=k} p_{ab} [/math]

The NCA goal is to maximize the expected number of correctly classified points on the training data:


[math] \mathbf O_{NCA}= \sum_{a=1}^{N} \sum_{b:c^a=c^b} p_{ab}[/math]

In order to maximize the above-mentioned objective function, we need to compute its derivative with respect to vector [math] W [/math] for the [math] a^th [/math] training case as below


[math] \mathbf \frac{\partial O_{NCA}}{\partial W} = \mathbf \frac{\partial O_{NCA}}{\partial f(x^a|W)} \mathbf \frac{\partial f(x^a|W)}{\partial W} [/math]

where


[math] \mathbf \frac{\partial O_{NCA}}{\partial f(x^a|W)}= -2 \[\sum_{b:c^a=c^b} p_{ab}d_{ab} - \sum_{b:c^a=c^b} p_{ab} \[\sum_{z \neq a} p_{az}d_{az}\] \] [/math]

and [math] \mathbf \frac{\partial f(x^a|W)}{\partial W} [/math] is computed using the standard backpropagation algorithm.

For a more detailed discussion on NCA click on the link below:

Neighbourhood Components Analysis

Pre-training step

Fine-tuning step

Regularized Nonlinear NCA

Splitting codes into class-relevant and class-irrelevant parts

Experiments

References

<references/>