Edited 16 Aug 2008 to mention the post of 16 Aug 2008. see “edit:”
Let’s take up the questions about the third set of definitions of the A’s and S’s. Recall: We computed 4 matrices, , , , . Just as importantly, we computed them 3 different ways, and got – strictly speaking – 3 different answers because the sizes were different. The 3 different ways were the SVD, the full eigendecompositions of and , and davis’ cut-down versions which used an invertible 2×2 matrix of .
for the first and third alternatives, I showed that Q-mode and R-mode were related by equations of the form
where the exact form of depends on which of the 2 alternatives we used.
- is this [duality] true for the 3rd alternative?
- should i work it out?
- does it affect my recommendation that we either use the SVD or the full eigendecompositions in preference to davis’ cut-down version?
- we should take a careful look at the relationship between the eigendecompositions and the SVD.
does duality hold for the 3rd alternative? (yes.)
my primary set of definitions comes from the SVD and gives me some very convenient equations:
the duality between Q-mode and R-mode is clear and easy if we use the SVD. What we lost, compared to the alternatives, is that is not the same size as v, is not the same size as u.
Davis’ definitions required that we throw away all the columns and rows of zeroes. i believe that this is equivalent to the cut-down SVD, where u and v are orthonormal but not orthogonal. (see the SVD category.) we saw the duality here, too.
for the remaining alternative, where i had more columns of zeroes than davis, but fewer than the SVD, i had to use the 3×3 and 4×4 matrices, i.e. square matrices. (sorry, i’ve changed notation, because i can’t remember the old one: D for diagonal, 3 or 4 for the size.)
Then, for example, is a -weighted eigenvector matrix (and the weights are D3 because the orthogonal eigenvector matrix v is 3×3):
We can write D3 and D4 in terms of w: they are
should i work it out? i don’t think so, but here’s the answer:
from there, we could show that duality holds, although the exact form of the equations is different. In fact,
it may seem weird, but it’s just a consequence of changing the sizes of and . all these different forms of w are the same two nonzero in different sizes of matrices. If you want to work this out, bear in mind that diagonal matrices commute.
does it affect my recommendation that we either use the SVD or the full eigendecompositions in preference to davis’ cut-down version? no.
just make sure you have the correct duality equations for whichever of these 3 alternatives you choose to use.
my personal preference is overwhelmingly to use the SVD, but i consider it one of three valid choices. i dislike one of those choices (the cut-down SVD) but that too may be considered just a burr under my saddle.
Let me check the duality, for myself (i.e. let me make sure i wrote the last two duality equations correctly.) first, :
And that’s good.
Does the duality between Q-mode and R-mode depend on having centered data? certainly not for the SVD. i believe that what’s affected is the interpretation of and as being proportional to the covariance matrices and .
we should take a careful look at the relationship between the eigendecompositions and the SVD. i suspect i had something specific in mind when i wrote that, but i don’t recall it. But let’s refresh our memories.
Let’s recall where the matrices D3 and D4 came from. From the SVD
that is, the matrix v of the SVD of X is an eigenvector matrix for , and u is an eigenvector matrix for . the diagonal eigenvalue matrices of and are and resp. the nonzero entries in D3 and D4 and w are the same. in other words, the nonzero eigenvalues of and are the squared nonzero values of w.
if the matrix X were of full rank (for davis’ example, that would have been rank 3), then there would have been 3 nonzero eigenvalues (equivalently, 3 nonzero principal values w). both and would have been of rank 3, but since is 4×4, it’s fourth eigenvalue must be zero.
to me, the most important thing is that we know the data is, in fact, two dimensional. how do we know it? any number of ways:
- there are only two nonzero eigenvalues.
- there are only two nonzero singular values.
- every one of , , , has only two nonzero columns.
- every row of the design matrix X adds up to zero.
i have to say that i find all but (3) completely convincing, although (3) should be convincing. If all someone gave me was (3), i’d feel more comfortable looking at the eigenvalues and counting how many were nonzero. I’d be making sure that someone hadn’t thrown away an eigenvector with a small but nonzero eigenvalue, or replaced a small but nonzero eigenvalue by zero.
ok, we know it’s true. Why is it true? why is the design matrix two dimensional? simply because every row of the design matrix adds up to zero. Our 3D vectors satisfy a linear restriction, they are linearly dependent.
in particular, the same thing would happen if every row added up to 1, or to 100 (per cent). (it would happen if every row summed to any common value; but 0, 1, and 100 are numbers we might well have required of our data.)
edit: not only do I have to be more precise, but here be dragons, too. See 16 Aug 2008 “PCA / FA tricky preprocessing”. Setting the row sums to zero will reduce the rank. Setting the row sums to 1 or 100 will not; but following that by centering the data, will reduce the rank.
- is this [duality] true for the 3rd alternative? yes.
- should i work it out? i chose not to, but gave you the answer.
- does it affect my recommendation that we either use the SVD or the full eigendecompositions in preference to davis’ cut-down version? no. if anything, i’m rather blase’ about which alternative anyone uses. just realize that the duality equations are different.
- we should take a careful look at the relationship between the eigendecompositions and the SVD. Done, but i wonder if i had something more specific in mind.