23
$\begingroup$

In two papers in 1986 and 1988, Connor and Korajczyk proposed an approach to modeling asset returns. Since these time series have usually more assets than time period observations, they proposed to perform a PCA on cross-sectional covariances of asset returns. They call this method Asymptotic Principal Component Analysis (APCA, which is rather confusing, since the audience thinks immediately of asymptotic properties of PCA).

I have worked out the equations, and the two approaches seem numerically equivalent. The asymptotics of course differ, since convergence is proved for $N \rightarrow \infty$ rather than $T \rightarrow \infty$. My question is: has anyone used APCA and compared to PCA? Are there concrete differences? If so, which ones?

$\endgroup$
4
  • 2
    $\begingroup$ 0 down vote Gappy:> this is not an answer to your question, but an alternative, more recent, and often more potent in out of sample forecasting, approach to this problem: Large Bayesian VARs, see this recent paper ideas.repec.org/p/cpr/ceprdp/6326.html $\endgroup$
    – user603
    Commented Sep 17, 2010 at 19:56
  • 5
    $\begingroup$ How could they be different if they are numerically equivalent? $\endgroup$ Commented Nov 20, 2010 at 23:45
  • $\begingroup$ Since PCA in a Markov process is asymptotically a Cosine transform, can't that be the meaning in APCA? $\endgroup$
    – JohnRos
    Commented Oct 27, 2011 at 20:25
  • $\begingroup$ Hello @gappy! I am wondering if my answer was helpful or convincing. If you think it is not correct (or does not do justice to "asymptotic PCA"), I would be curious to hear your thoughts about the issue. $\endgroup$
    – amoeba
    Commented Feb 5, 2015 at 16:08

3 Answers 3

6
$\begingroup$

There is absolutely no difference.

There is absolutely no difference between standard PCA and what C&K suggested and called "asymptotic PCA". It is quite ridiculous to give it a separate name.

Here is a short explanation of PCA. If centered data with samples in rows are stored in a data matrix $\mathbf X$, then PCA looks for eigenvectors of the covariance matrix $\frac{1}{N}\mathbf X^\top \mathbf X$, and projects the data on these eigenvectors to obtain principal components. Equivalently, one can consider a Gram matrix, $\frac{1}{N}\mathbf X \mathbf X^\top$. It is easy to see that is has exactly the same eigenvalues, and its eigenvectors are scaled PCs. (This is convenient when the number of samples is less than the number of features.)

It seems to me that what C&K suggested, is to compute eigenvectors of the Gram matrix in order to compute principal components. Well, wow. This is not "equivalent" to PCA; it is PCA.

To add to the confusion, the name "asymptotic PCA" seems to refer to its relation to factor analysis (FA), not to PCA! The original C&K papers are under paywall, so here is a quote from Tsay, Analysis of Financial Time Series, available on Google Books:

Connor and Korajczyk (1988) showed that as $k$ [number of features] $\to \infty$ eigenvalue-eigenvector analysis of [the Gram matrix] is equivalent to the traditional statistical factor analysis.

What this really means is that when $k \to \infty$, PCA gives the same solution as FA. This is an easy-to-understand fact about PCA and FA, and it has nothing to do with whatever C&K suggested. I discussed it in the following threads:

So the bottom-line is: C&K decided to coin the term "asymptotic PCA" for standard PCA (which could also be called "asymptotic FA"). I would go as far as to recommend never to use this term.

$\endgroup$
2
$\begingroup$

Typically APCA gets used when there are lots of series but very few samples. I wouldn't describe APCA as better or worse than PCA, because of the equivalence you noted. They do, however, differ in when the tools are applicable. That is the insight of the paper: you can flip the dimension if it's more convenient! So in the application you mentioned, there are a lot of assets so you would need a long time series to compute a covariance matrix, but now you can use APCA. That said, I don't think APCA gets applied very often because you could try to reduce the dimensionality using other techniques (like factor analysis).

$\endgroup$
1
  • 1
    $\begingroup$ (-1) I don't get it: are they equivalent or not, in your opinion? If yes, then how can they possibly differ in when they are applicable? $\endgroup$
    – amoeba
    Commented Dec 19, 2014 at 21:26
1
$\begingroup$

It's not about Math. only. To understand why it's different, you need to know the Finance theory background of factor models. For a factor model $R = BF + \epsilon$. It is like a multivariate regression, R has dimension the number of stocks.

  • F, the number of factors.
  • B is a matrix of loadings.
  • $\epsilon$ (epsilon) has a diagonal covariance matrix.

In PCA you first get the loadings as the Eigen vectors of the covariance matrix. Then you decide how many you keep, say K. In a second step you get the K factor scores (estimates of the K factor values at every time t) by cross-sectional regression of the stock returns on the loadings for every time (aka Bartlett method). Since the Bs are noisy estimates from a noisy covariance matrix, you have a measurement error in your right hand side data (the Bs) in the second step.

Now why it's important: The typical equity finance application has many many stocks and not so many time period => noisy noisy cov matrix => noisy loadings B (can you say Junk in?) => massive bias to zero of the estimates of the factor scores. In the extreme, you have more stocks than periods and your cov. matrix is not full rank.

In Asymptotic PC, see Connors and Korajczik, the cross-product matrix is TxT, where T is the number of observations. It is always PDS, as the number of stocks goes to infinity for a given sample size, it converges to the factor scores with arbitrary precision. Then in a second step you get the loadings by a time series regression of each return on the factors.

And here is the (nice) catch: In a stock situation, you have N >> T, you could not even estimate the cov.matrix properly. But you have infinitely precise estimates of the factor scores. In the second step where you get the loadings from the scores, you have NO problem of errors in the variables.

If you take the pain to read their papers, you will see the simulation that shows how effective this is for typical cross-section size vs sample size.

$\endgroup$
1
  • $\begingroup$ By the way, Factor Analysis (by MLE estimation) does not resolve the problem which Connors and Korajczyk tackle. It has some advantages over PCA but, like PCA, it extracts the loadings first and the factor scores second. The first step gets precise as T, the sample size, increases. So the second step also suffers from EIV (errors in the variables) in the explanatory variables when N is large relative to T. $\endgroup$ Commented Sep 30, 2022 at 20:35

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.