Coursera-Mathematics for Machine Learning: PCA Week4-1

Introduction

We have:

• a dataset $X$ in $R^D$ consisting of n vectors (n training examples)

• n vectors $X_1$, …, $X_n$ where $X_i$ are D-dimensional vectors

Objective:

• find a low dimensional representation of the data that is as similar to $X$ as possible.

Three important concepts

1. linear combination of the basis vectors

The first one is that every vector in $R^D$ can be represented as a linear combination of the basis vectors.

$X_n$ can be written as the sum of i = 1 to D of ${\beta }_{in}$ * $b_i$.

• D个basis vectors $b_i$的线性加和
• $b_i$ are an orthonormal bases of $R^D$
• orthonormal: 正交（各自垂直）
  

2. orthogonal projection onto 1-D subspace

We can interpret ${\beta }_{in}$ as the orthogonal projection of $X_n$ onto the one dimensional subspace spanned by the $i_{th}$ basis vector.

3. orthogonal projection of X onto the subspace spanned by the M basis vectors

If we have an orthonormal basis $b_1$ to $b_m$ of $R^D$ and we define $B$ to be the matrix that consists of these orthonormal basis vectors.

Then the projection of $X$ onto the subspace, we can write as $\tilde{X}$ is $B\ast B.T\ast X$.

That means $\tilde{X}$ is the orthogonal projection of X onto the subspace spanned by the M basis vectors.

And $B.T\ast X$ are the coordinates of $\tilde{X}$ with respect of the basis vectors collected in the matrix $B$. This is also called the code, so coordinates or code.

PCA

The key idea in PCA

To find a lower dimensional representation ${\tilde{X}}_n$ that can be expressed using fewer basis vectors, let’s say M.

Assumptions:

• The data is centered, that means the dataset has mean zero.
• $b_1$ to $b_D$ are an orthonormal bases of $R^D$.

Generally, we can write any ${\tilde{X}}_n$ in the following way:

This entire thing is still living in $R^D$. So, we took our general way of writing any vector in $R^D$ which comes from property one, and we split the sum in property one into two sums. One is living in an M-dimensional subspace and the other one is living in a D minus M-dimensional subspace which is an orthogonal complement to this particular subspace.

In PCA, we ignore the second term, so we get rid of this part.

the principal subspace

And then we call the subspace that is spanned by the basis vectors $b_1$ to $b_M$ the principal subspace. So $b_1$ to $b_M$ span the principal subspace.

Although ${\tilde{X}}_n$ is still a D-dimensional vector, it lives in an M-dimensional subspace of $R^D$ and only M coordinates; ${\beta }_{n1}$ to ${\beta }_{nM}$ are necessary to represent it.

So, these ones are the coordinate of this, ${\tilde{X}}_n$ vector. The betas of n also called the code of the coordinates of ${\tilde{X}}_n$ with respect to the basis vectors $b_1$ to $b_M$.

Objective

And the setting now is as follows. Assuming we have data $X_1$ to $X_n$, we want to find parameters ${\beta }_{in}$ and orthonormal basis vectors $b_i$, such that the average squared reconstruction era is minimised.

the average squared reconstruction error

J: the average squared reconstruction error

example

Let’s have a look at an example. We have data living in two dimensions and now we want to find a good one dimensional subspace such that the squared or average squared reconstruction error of the original data points and their corresponding projection is minimised.

Here I’m plotting the original dataset with their corresponding projections onto one dimensional subspaces and I’m cycling through a couple of options of subspaces and you can see that some of these projections are significantly more informative than others and in PCA we are going to find the best one. Our approach is to compute the partial derivatives of $J$ with respect to the parameters.

The parameters are the ${\beta }_{in}$ and the $b_i$.

We set the partial derivatives of J with respect to these parameters to zero and solve for the optimal parameters. But one observation we can already make. And that observation is that the parameters only enter this loss function through ${\tilde{X}}_n$.

This means that in order to get our partial derivatives, we need to apply the chain rule. So, we can write $d_J$ by d either ${\beta }_{in}$ or $b_i$ can be written as $d_J$ by $d_{{\tilde{X}}_n}$ tilde times$d_{{\tilde{X}}_n}$ by d either ${\beta }_{in}$ or $b_i$.

We can already compute the first part.