Semidefinite embedding

From Wikipedia, the free encyclopedia
  (Redirected from Maximum variance unfolding)
Jump to: navigation, search

Semidefinite embedding (SDE) or maximum variance unfolding (MVU) is an algorithm in computer science that uses semidefinite programming to perform non-linear dimensionality reduction of high-dimensional vectorial input data. MVU can be viewed as a non-linear generalization of Principal component analysis.

Non-linear dimensionality reduction algorithms attempt to map high-dimensional data onto a low-dimensional Euclidean vector space. Maximum variance Unfolding is a member of the manifold learning family, which also include algorithms such as isomap and locally linear embedding. In manifold learning, the input data is assumed to be sampled from a low dimensional manifold that is embedded inside of a higher-dimensional vector space. The main intuition behind MVU is to exploit the local linearity of manifolds and create a mapping that preserves local neighborhoods at every point of the underlying manifold.

MVU creates a mapping from the high dimensional input vectors to some low dimensional Euclidean vector space in the following steps:

A neighborhood graph is created. Each input is connected with its k-nearest input vectors (according to Euclidean distance metric) and all k-nearest neighbors are connected with each other. If the data is sampled well enough, the resulting graph is a discrete approximation of the underlying manifold.

The neighborhood graph is "unfolded" with the help of semidefinite programming. Instead of learning the output vectors directly, the semidefinite programming aims to find an inner product matrix that maximizes the pairwise distances between any two inputs that are not connected in the neighborhood graph while preserving the nearest neighbors distances.

The low-dimensional embedding is finally obtained by application of multidimensional scaling on the learned inner product matrix.

The steps of applying semidefinite programming followed by a linear dimensionality reduction step to recover a low-dimensional embedding into a Euclidean space were first proposed by Linial, London, and Rabinovich.

Optimization Formulation[edit]

Let X \,\! be the original input and Y\,\! be the embedding. If i,j\,\! are two neighbors, then the local isometry constraint that needs to be satisfied is:


Let G, K\,\! be the Gram matrices of  X \,\! and  Y \,\! (i.e.: G_{ij}=X_i \cdot X_j,K_{ij}=Y_i \cdot Y_j \,\!). We can express the above constraint for every neighbor points i,j\,\! in term of G, K\,\!:


In addition, we also want to constraint the embedding  Y \,\! to center at the origin:

\sum _{{i}}Y_{{i}}=0\Leftrightarrow (\sum _{{i}}Y_{{i}})^{{2}}=0\Rightarrow \sum _{{i,j}}Y_{{i}}Y_{{j}}=0\Rightarrow \sum _{{i,j}}K_{{ij}}=0

As described above, except the distances of neighbor points are preserved, the algorithm aims to maximize the pairwise distance of every pair of points. The objective function to be maximized is:


Intuitively, maximizing the function above is equivalent to pulling the points as far away from each other as possible and therefore "unfold" the manifold. The local isometry constraint prevents the objective function from going to infinity. Proof:

Let \tau = max \{\eta_{ij}|Y_{i}-Y_{j}|^2\} \,\! where  \eta_{ij} = 1 \,\! if i and j are neighbors and  \eta_{ij} = 0 \,\! otherwise.

Since the graph has N points, the distance between any two points |Y_{i}-Y_{j}|^2 \leq N \tau \,\!. We can then bound the objective function as follow:

T(Y)=\dfrac{1}{2N}\sum_{i,j}|Y_{i}-Y_{j}|^{2} \leq \dfrac{1}{2N}\sum_{i,j}(N\tau)^2 = \dfrac{N^3\tau^2}{2} \,\!

The objective function can be rewritten purely in the form of the Gram matrix:

  T(Y) &{}=  \dfrac{1}{2N}\sum_{i,j}|Y_{i}-Y_{j}|^{2} \\
          &{}= \dfrac{1}{2N}(\sum_{i,j}(Y_{i}^2+Y_{j}^2-Y_{i} \cdot Y_{j} - Y_{j} \cdot Y_{i})\\
          &{}= \dfrac{1}{2N}(\sum_{i,j}Y_{i}^2+\sum_{i,j}Y_{j}^2-\sum_{i,j}Y_{i} \cdot Y_{j} -\sum_{i,j}Y_{j} \cdot Y_{i})\\  
          &{}= \dfrac{1}{2N}(\sum_{i,j}Y_{i}^2+\sum_{i,j}Y_{j}^2-0 -0)\\
          &{}= \dfrac{1}{N}(\sum_{i}Y_{i}^2)=\dfrac{1}{N}(Tr(K))\\

Finally, the optimization can be formulated as:

Maximize  Tr(K) \,\!

Subject to  K \succeq 0\,\! and  \forall i,j \,\! where  \eta_{ij} =1, G_{ii}+G_{jj}-G_{ij}-G_{ji}=K_{ii}+K_{jj}-K_{ij}-K_{ji} \,\!

After the Gram matrix K \,\! is learned by semidefinite programming, the output Y \,\! can be obtained via Cholesky decomposition. In particular, the Gram matrix can be written as  K_{ij}=\sum_{\alpha = 1}^{N}(\lambda_{\alpha } V_{\alpha i} V_{\alpha j}) \,\! where  V_{\alpha i} \,\! is the i-th element of eigenvector  V_{\alpha} \,\! of the eigenvalue  \lambda_{\alpha } \,\!.

It follows that the  \alpha \,\!-th element of the output  Y_i \,\! is  \sqrt{\lambda_{\alpha }} V_{\alpha i} \,\!.

Comparison to other methods[edit]

Semidefinite embedding is much better in revealing the underlying dimension of the data compared to LLE and Laplacian eigenmaps.[citation needed] It also guarantees that the nearest neighbors in the embedding is the same as the original nearest neighbor for each point while the other two methods do not. On the other hand, semidefinite embedding is much slower and harder to scale to large data.

Semidefinite embedding outperforms Isomap when the manifold is not a convex subset of the Euclidean space.

See also[edit]


External links[edit]