# stat946f10

## June 2nd Maximum Variance Unfolding (Semidefinite Embedding)

Maximum Variance Unfolding (MVU) is a variation of Kernel PCA in which the kernel matrix is also obtained from the data. The main proposal of this technique is not to choose a kernel function a priori like classical kernel PCA or construct a kernel matrix by algorithm like LLE and ISOMAP, but instead learn a kernel $K$ optimizing an objective function with several constraints when the data set is given.

First, we give the constraints for the kernel.

### Constraints

1. Semipositive definiteness
Kernel PCA is a kind of spectral decomposition in Hilbert space. The kernel matrix stores the inner products of vectors in a Hilbert space, hence it must be positive semidefinite. The semipositive definiteness means all eigenvalues are non-negative, i.e. $K\gt =0$.

2. Centering
Considering the centering process in Kernel PCA, it is also required here. The condition is given by
$\sum_i \Phi\left(x_i\right) =0 .$
Equivalently,
$0 = \left|\sum_i \Phi(x_i)\right|^2 = \sum_{ij}\Phi(x_i)\Phi(x_j)=\sum_{ij}K_{ij}.$

3. Isometry
The local distance between a pairwise of data $x_i, x_j$, under neighbourhood relation $\eta$ (i.e. $\eta_{ij}=1$ indicates data $x_i, x_j$ are neighbours), should be preserved in new space after mapping $\Phi(\cdot)$. In other words, for all $\eta_{ij}\gt 0$,
$\left|\Phi(x_i) - \Phi(x_j)\right|^2 = \left|x_i - x_j\right|^2.$
Additonally, for the consider of conformal map, the pairwise distance between two points having a common neighbour point should also be preserved. Two data points having a common neighbour can be identified as $[\eta^T\eta]_{ij}\gt 0.$ This ensures that if two points have a common neighbour, we preserve their pairwise distances and angles.

$\left|\Phi(x_i) - \Phi(x_j)\right|^2 = \left(\Phi(x_i) - \Phi(x_j)\right)^{T}\left(\Phi(x_i) - \Phi(x_j)\right)$
$\left|\Phi(x_i) - \Phi(x_j)\right|^2 = \Phi(x_i)^{T}\Phi(x_i) - \Phi(x_j)^{T}\Phi(x_j) - 2 \Phi(x_i)^{T}\Phi(x_j)$

Thus, $K_{ii}+K_{jj}-2K_{ij}=\left|x_i - x_j\right|^2$ for all ij $\eta_{ij}\gt 0$ or $[\eta^T\eta]_{ij}\gt 0.$

### Objective Functions

Given the conditions, the objective functions should be considered. The aim of dimensional reduction is to map high dimension data into a low dimension space with the minimum information losing cost. Recall the fact that the dimension of new space depends on the rank of the kernel. Hence, the best ideal kernel is the one which has minimum rank. So the ideal objective function should be
$\min\quad rank(K).$
However, minimizing the rank of a matrix is a hard problem. So we look at the question in another way. When doing dimensional reduction, we try to maximize the distance between non-neighbour data. In other words, we want to maximize the variance between non-neighbour datas, and it is the same as maximizing the sum of the eigenvalues. In such sense, we can change the objective function to
$\max \quad Trace(K)$ .

Note that it is an interesting question that whether these two objective functions can be equivalent to each other. Although they are not totally equivallent, it can be shown that they usually converge to each other.

### Algorithm for Optimization Problem

The objective function with linear constraints form a typical semidefinite programming problem. The optimization is convex and globally. We already have methods to slove such kind of optimization problem.

### Colored Maximum Variance Unfolding .<ref>Song, L. and colleagues; Proceedings of the 2007 Conference, 1385-1392.</ref>

MVU is based on maximizing the overall variance while the local distances between neighbor points are preserved and it uses only one source of information. Colored MVU uses more than one source of information, i.e it reducing the dimension satisfying a combination of to goals
1- preserving the local distance (as first information)
2- optimum alignment with second information (side information)

##### Examples of how Colored MVU can leverage the side information
• Given text data from a newsgroup as first information, a hierarchy of topics can be used as side information to guide the embedding.
• Given term-frequency and inverse-document-frequency representation of academic papers as first information, co-author relationship can be used as side information to guide the embedding.
##### Rationale of separating the side information from the data
• We cannot merge all kind of information in one distance metric because the data(first information) and the side information may be heterogeneous
• The side information may be a feature of similarity(papers with the same co-authors tend to be more similar) rather than difference(papers with different co-authors are not necessarily far apart).
• When inserting new information, usually only new data but not new side information is added.

#### Algorithmic Modification

In Colored MVU, $Trace(KL)$ is maximized instead of $K$, where $L$ is the matrix of covariance of first and side information.

#### Application

One of the drawback of MVU is that its statistical interpretation is not always clear. However one of the application of Colored MVU, which has great statistical interpretation is to be used as a criterion to for measuring the Hilbert-Schmidt Independence.

### Steps for SDE algorithm

• Generate a K nearest neighbor graph. It should be a connected graph and so if K is too small it would be an unbounded problem, having no solution.
• Semidefinite programming: Maximize $Tr(K)$ subject to the above mentioned constraints.
• Do kernel PCA with this learned kernel.

• The kernel that is learned from the data can actually reflect the intrinsic dimensionality of the data. More specifically, the eigen-spectrum of the kernel matrix K provides an estimation.
The dimension needed to preserve local distance while maximizing variance is dependent on the number of dominant eigenvalues of K. That is, if top r eigenvalues of K account for 90% of the trace then an r dimensional representation can reveal about 90% of the unfolded data's variance.
• MVU is a convex problem which guarantees a unique solution.
• Distance-preserving constraints can be easily expressed and enforced in the semi-definite programming framework. This flexibility allows tailor-made constraints to be imposed on particular applications, for example analyzing robot motions(ARE).

• SDE can be solved efficiently in polynomial time but still has a high computational complexity. (O(matrix_size ^ 3 + number_of_constraints ^ 3))
• SDE is limited to a isometric map

### Application in SVM classification

The optimized kernel replaces the popular kernels using in SVM (i.e. linear kernel) for classification. It actually performs worse than other kernel functions chose in priori.

## June 4th

### Action Respecting Embedding (ARE)

It is a variation of Maximum Variance Unfolding.
The data here is temporal or ordered, i.e we move from one point to another by taking an action. In other words action $a_i$ is taken between data points $x_i$ and $x_{i+1}$.
Action labels,even with no interpretation or implied meaning,provide more information about the underlying generation of the data.It is natural to expect that the actions correspond to some simple operator on the generator's own degrees of freedom.For example,a camera that is being panned left and then right,has actions that correspond to a simple translation in the camera's actuator space.We therefore want to constrain the learned representation so that the labeled actions correspond to simple transformations in that space.In particular,we can require all actions to be a simple rotation plus translation in the resulting low-dimensional representation.<ref> M.Bowling, A.Ghodsi, and D.Wilkinson. Action respecting embedding. In International Conferenceon Machine Learning,2005. </ref>
Consider action $a$ taken between the points $x_i , x_{i+1}$, and the points $x_j , x_{j+1}$, in the original data space, it may not be a simple transformation (Rotation, Translation or combine of both).

A transformation $T$ is called simple or distance preserving if and only if

$\forall x, x'$ $\left \Vert T(x)-T(x') \right \|=\left \Vert x - x' \right \|$

The goal here is not only to reduce the dimensionality of the data but also reducing the complexity of actions.
If two points undergo the same action, then the distance between those points must be preserved before the action and also after taking the action.Distance preserving transformations are rotation and translation or any combination of them and hence to obtain a low dimensional embedding of the high dimensional temporal data, the action in low dimension must be represented by a constraint that preserves the distance. This constraint is called action respecting constraint.
For any two data points $x_i$,$x_j$ if the same action a $\left(a_{i}=a_{j}\right)$ is carried out, transforming them into $x_{i+1}$ and $x_{j+1}$ respectively, then the distance between $y_i$ and $y_j$ must be equal to the distance between $y_{i+1}$ and $y_{j+1}$ where $y_i$ , $y_j$ , $y_{i+1}$ , $y_{j+1}$ are the corresponding points in the low dimension. This constraint is given as:
$\left|\Phi(x_i) - \Phi(x_j)\right|^2=\left|\Phi(x_{i+1}) - \Phi(x_{j+1})\right|^2$
The kernel form of the above constarint is:
$\forall i, j a_{i}=a_{j} \Rightarrow K_{ii}+K_{jj}-2K_{ij}=K_{(i+1)(i+1)}+K_{(j+1)(j+1)}-2K_{(i+1)(j+1)}$

The above, action respecting constraint is added to the constraints of MVU and the algorithm of MVU is run to obtain a low dimension embedding for the temporal data.

### Example

This example is extracted from the "Action Respecting Embedding" paper listed in the references.

Consider a virtual robot that observe a 100 by 100 patch of a 2048 by 1536 image. The actions of the robot consists of four translations(rightward/leftward/upward/downward). In this example, we consider two action sequences and compare their representations by SDE and ARE.

File:image2.jpg
This is the 2048 by 1536 image.The rectangular box corresponds to the area covered by the first sequence of actions. The square box corresponds to the area covered by the second sequence of actions.
File:image1.jpg
This is the first sequence of actions which consists of 40 rightward translations followed by 20 leftward translations.
File:image3.jpg
This is the second sequence of actions which consists of translations in all the four directions.

It is obvious that the first sequence of actions lie in a one-dimensional subspace and the second sequence lies in a two-dimensional subspace. Although both SDE and ARE succeed in capturing this low dimensionality, the embedding achieved by ARE is much smoother and corresponds much better(almost exactly) to the actual actions.

File:image4.jpg
Representations of the first sequence of actions.
File:image5.jpg
Representations of the second sequence of actions.

## June 9th Metric Learning

Metric Learning is a supervised algorithm used for dimensionality reduction, in which some kind of extra sources of information (side information)are used besides the first source of variation. In more detail, two types of class-related information are brought in consideration.
Given a set of points $\{x_i, i=1, \cdots, m\}$, we define two different sets, similar and dissimilar.

Similar Set
It is a set of pairs of similar points, denoted by $S$
$S : (x_i, x_j) \in S$ if $x_i$ and $x_j$ are similar;

Dissimilar Set
It is a set of paris of disimilar points, denoted by $D$
$D : (x_i, x_j) \in D$ if $x_i$ and $x_j$ are dissimilar.

Note that a particular pair of points may not be known to be similar or dissimilar, in which case it will not be placed in either set.

We want to learn a distance metric
$d_A(x_i, x_j) = \|x_i - x_j\|_A = \sqrt{(x_i-x_j)^T A(x_i-x_j)}$,
which determined by semi-denfinite matrix $A$. Equivalently, we want to know $A$ from the given data.

Such idea comes from firstly in 2004. After that, several different approaches are given to find the metric.

### 1. Original Optimization Problem

It is given by Eric P. Xing, Andrew Y. Ng, Michael I. Jordan and Stuart Russell in 2004 .<ref>Eric P. Xing, Andrew Y. Ng, Michael I. Jordan and Stuart Russell, Distance metric learning, with application to clustering with side-information, </ref> . The authors give the optimization problem in following form:
$\min_A \sum_{(x_i - x_j) \in S} \|x_i - x_j\|^2_A$
$s.t. \sum_{(x_i - x_j) \in D} \|x_i - x_j\|_A \ge 1 ,$
$A \ge 0 .$

The constraint is given to keep the distance between dissimilar points. If the constraint is ignored, $A = 0$ will be an obvious solution, which means all points collapse to a single point. The choice of constant $1$ is not important, and can be changed to any other positive number. In the paper, it is also shown that it is a convex optimization problem.

### 2. PSD formulation

Another approach is given in <ref> Ali Ghodsi, Dana Wilkinson, Finnegan Southey, Improving Embeddings by Flexible Exploitation of Side Information</ref>, in which the loss function is given by

$L(A) = \sum_{(x_i, x_j) \in S } \|x_i - x_j\|^2_A - \sum_{(x_i, x_j)\in D} \|x_i - x_j\|_A^2.$

Motivation for using this loss function is that, it is minimized equivalently if its first component (sum of the differences between points in similarity class) is minimized while, its second component (sum of the differences between points in dissimilarity class) is maximized.
The optimization problem is
$\min_A L(A); s.t. A \ge 0, Tr(A) = 1 (1)$.
The Positive semidefiniteness ($A \ge 0$) constrain guarantees a valid Euclidean metric and the trace constraints is to prevent the solution $A =0$. In order to be able to use standard semidefinite programing software $L(A)$ must be linearized. To do so function $vec()$ (which rearranges a matrix by concatenating its columns) which gives quite useful results like,

$vec(ABC)=(C^{T}*A)vec(B)$.
in which $*$ is the Kroneker product.

since $(x_{i}-x_{j})^{T}A(x_{i}-x_{j})$ is a scalar we can write
$(x_{i}-x_{j})^{T}A(x_{i}-x_{j})=vec((x_{i}-x_{j})^{T}A(x_{i}-x_{j}))$
also from Kroneker product for any two (same size) vectors $a , b$ we have
$(a^{T}*b^{T})=vec(ba^{T})^{T}$

using the two results above it is easy to drive the following conclusion.

$L(A) = \sum_{(x_i, x_j) \in S } (x_i - x_j)^T A (x_i - x_j) - \sum_{(x_i, x_j)\in D} (x_i - x_j)^T A (x_i - x_j)$
$= \sum_{(x_i, x_j) \in S } vec(A)^T vec((x_i - x_j)(x_i - x_j)^T) - \sum_{(x_i, x_j)\in D} vec(A)^T vec((x_i - x_j)(x_i - x_j)^T)$
$= vec(A)^T \left[ \sum_{(x_i, x_j) \in S } vec((x_i - x_j)(x_i - x_j)^T) - \sum_{(x_i, x_j)\in D} vec((x_i - x_j)(x_i - x_j)^T) \right]$

This form along with the two linear constraints given in (1), makes a semidefinite positive problem that can be easily solved by a SDP solver, called SeDumi in Matlab. Therefore, it is a more convenient form than that used by Xing et all. Furthermore, in the original form, at least one dissimilar pair is required, while it is not necessary in the form given by Ali Ghodsi et al., because of the trace constraint. There can be only similar pairs, only dissimilar pairs, or any combination of the two, and the method will still avoid the trivial solution. Furthermore, in the absence of specific information regarding dissimilarities, Xing et al. assume that all points not explicitly identified as similar are dissimilar. This information may be misleading, forcing the algorithm to separate points that should be in fact be similar. The formulation presented by Ali Ghodsi et al. allows one to specify only the side information one actually has, partitioning the pairing into similar, dissimilar, and unknown.

<references/>