# Difference between revisions of "nonlinear Dimensionality Reduction by Semidefinite Programming and Kernel Matrix Factorization"

(→Reconstructing from landmarks) |
(→Introduction) |
||

Line 1: | Line 1: | ||

==Introduction == | ==Introduction == | ||

− | In recent work, Semidefinite programming (SDE) that learns a kernel matrix by maximizing variance while preserving the distance and angles between nearest neigbors has been introduced. Although it has many advantages such as optimization convexity, it sufferes from computational cost for large problems. In this paper, a new framework based on factorization of the entire kernel matrix in terms of a much smaller submatrix of inner products between randomly chosen landmarks has been proposed. | + | In recent work, Semidefinite programming (SDE) that learns a kernel matrix by maximizing variance while preserving the distance and angles between nearest neigbors has been introduced. Although it has many advantages such as optimization convexity, it sufferes from computational cost for large problems. In this paper<ref> |

+ | K. Q. Weinberger et al. Graph Laplacian Regularization for Larg-Scale Semidefinite Programming, Proceedings of the the Tenth international workshop on Artificial Intelligence and Statistics (AISTATS-05), pages 381-388, Barbados, West Indies, 2005. | ||

+ | </ref>, a new framework based on factorization of the entire kernel matrix in terms of a much smaller submatrix of inner products between randomly chosen landmarks has been proposed. | ||

==Semidefinite Embedding== | ==Semidefinite Embedding== |

## Revision as of 22:20, 8 July 2009

## Contents

## Introduction

In recent work, Semidefinite programming (SDE) that learns a kernel matrix by maximizing variance while preserving the distance and angles between nearest neigbors has been introduced. Although it has many advantages such as optimization convexity, it sufferes from computational cost for large problems. In this paper<ref> K. Q. Weinberger et al. Graph Laplacian Regularization for Larg-Scale Semidefinite Programming, Proceedings of the the Tenth international workshop on Artificial Intelligence and Statistics (AISTATS-05), pages 381-388, Barbados, West Indies, 2005. </ref>, a new framework based on factorization of the entire kernel matrix in terms of a much smaller submatrix of inner products between randomly chosen landmarks has been proposed.

## Semidefinite Embedding

Given high dimensional vectors [math]\,\{x_1, x_2, ..., x_n\} \in R^D [/math] lying on or near a manifold that can be embeded in [math]\,d\ll D[/math] dimensions to produce low dimensional vectors [math]\,\{y_1, y_2, ..., y_n\} \in R^d[/math], the goal is to find d and produce an appropriate embedding. The algorithm starts with computing k-nearest neighbors of each input and adding a constraint to preserve distances and angles between k-nearest neighbors:

[math]\,\|y_i-y_j\|^2 = \|x_i-x_j\|^2 [/math] for all (i,j) in k-nearest neighbors (2)

and also a constraint on outputs to be centerd on the origin:

[math]\,\sum_i{y_i} = 0 [/math] (3)

And maximizining the variance of outputs will be the final step:
[math]\,var(y)=\sum_i{\|y_i\|^2} [/math] (4)

Assuming [math]\,K_{ij}=y_i.y_j[/math], the above optimzation problem can be reformulated as an SDE:

Maximize trace(K) subject to :

1) [math]\,K\succeq 0 [/math]

2)[math]\,\sum_{ij}K_{ij}=0 [/math]

3) For all (i,j) such that [math]\,\eta_{ij}=1 [/math],

[math]\,K_{ij}-2K_{ij}+K_{jj}=\|x_i-x_j\|^2[/math]

the top d eigenvalues and eigenvectors of the kernel matrix will be used to derive the embedding. Here, learning the kernel matrix dominates the total computation time.

## Kernel Matrix Factorization

As we saw in the last section, learning the kernel matrix takes many time. Therefore, if we can approximate it by a much smaller matrix , the computation time will be drastically improved. This can be done through the following steps:

First, reconstructing high dimensional datasate [math]\,\{x_i\}_{i=1}^n[/math] from m randomly chosen landmarks [math]\,\{\mu_{\alpha}\}_{\alpha=1}^m[/math] :

[math]\,\hat{x_i} = \sum_{\alpha}{Q_{i\alpha}\mu_{\alpha}} [/math]

Based on the similar intuition from locally linear embedding (LLE), the same linear transformation (Q) can be used to reconstruct the output:

[math]\,\hat{y_i} = \sum_{\alpha}{Q_{i\alpha}l_{\alpha}} [/math] (6)

Now, if we make the approximation:

[math]\,K_{ij}=y_i.y_j=\hat{y_i}.\hat{y_j}[/math] (7)

substituting (6) into (7) gives [math]\,K\approx QLQ^T[/math] where [math]\,L_{\alpha\beta} = l_{\alpha}.l_{\beta}[/math]

## Reconstructing from landmarks

To derive Q, we assume that the manifold can be locally approximated by a linear subspace. Therefore, each input in the high dimensional space can be reconstructed by a weighted sum of its r-nearest neighbors. These weights are found by :

Minimize :[math]\,\varepsilon(W)=\sum_i{\|x_i-\Sigma_j{W_{ij}x_j}\|^2}[/math]

subject to:[math]\,\Sigma_j{W_{ij}}=1[/math] for all j

and [math]\,W_{ij}=0[/math] if [math]\,x_i[/math] are not r-nearest neighbor of [math]\,x_j[/math]

Rewriting the reconstruction error as function of inputs will give us:
[math]\,\varepsilon(X)=\sum_{ij}{\phi_{ij}x_i.x_j}[/math]

where [math]\,\phi = (I_n-W)^T(I_n-W)[/math] or

[math]\,\phi=\begin{bmatrix} \overbrace{\phi^{ll}}^{m} & \overbrace{\phi^{lu}}^{n-m} \\ \phi^{ul} & \phi^{uu}\end{bmatrix} [/math]

and the solution will be:

[math]\,Q=\begin{bmatrix} I_m \\ -(\phi^{uu})^{-1}\phi^{ul}\end{bmatrix}[/math]

As [math]\,W_{ij}[/math] are invariant to translations and rotations of each input and its r-nearsest neighbors, the same weights can be used to reconstruct [math]\,y_i[/math]

## Embedding the landmarks

Considering the factorization [math]\,K\approx QLQ^T[/math], we will get the following SDP:

Maximize trace([math]\,QLQ^T[/math]) subject to :

1) [math]\,L\succeq 0 [/math]

2)[math]\,\sum_{ij}(QLQ^T)_{ij}=0 [/math]

3) For all (i,j) such that [math]\,\eta_{ij}=1 [/math],

[math]\,(QLQ^T)_{ij}-2(QLQ^T)_{ij}+(QLQ^T)_{jj}\leq\|x_i-x_j\|^2[/math]

Because the matrix factorization is an approximate, the distance constraint has changed from equality to inequality.

The computation time in semidefinite programming depends on the matrix size and the number of constraints. Here, the matrix size in lSDE is much smaller than SDE. The number of constraints are the same. However, the constraints in lSDE are not sparse and this may lead to an lSDE even slower than SDE. To overcome this problem, one can feed an initial subset of constraints like just centering and semidifiniteness instead of the whole constraints. In the case that the solution violates the unused constraints, these will be added to the problem and the SDP solver will be run again.

## Experimental Results

In the first experiment, Figure 1, only 1205 out of 43182 constraints had to be enforced based on Table 2.

In the second experiment, Table 1, despite the huge dimensionality reduction from D=60000 to d=5, many expected neighbors were preserved.

In the third experiment, Figure 2, the results from [math]lSDE[/math] are differnet from the results from SDE, but they get close to each other with increasing number of landmarks. Here, as shown in Figure 4, [math]lSDE[/math] is slower than SDE. Because the ddataset is too small and has a particular cyclic structure so that incremental scheme for adding constraints doesn't work well.