In portfolio management one often has to solve problems of the quadratic form wTΣw+wTc→minω
For estimating the covariance matrix Σ we can e.g. use the sample covariance of the returns of all assets - let's call this an asset-by-asset model. It is known that some care has to be taken here if N is big and so forth, but this is not the point of this question.
On the other hand we can define factors (Fk)Kk=1 with $K
I sometimes read that a problem with covariance matrix ˆΣ from the factor model is easier to solve than with Σ. Is this true? If yes, then how can we see this? My personal answer so far is: no. Because both are N×N matrices and the structure does not help in general.
Especially if the factors are not orthogonal - what do we gain? If the factors come from a PCA then we might gain something but I wonder how many PCs we would need e.g. in a global equities portfolio ...
Answer
A few points.
First, In a typical factor model, the idiosyncratic piece (what you call Var[ϵk]) is non-negligible, which results in a ˆΣ that is going to be well-conditioned. From a numerical point of view, this is very convenient. The more well-conditioned a covariance matrix, the less susceptible the optimization routine is to round-off errors.
Second, one can introduce variables l1,...,lK with constraints that ∑Ni=1ei,jwi=lj and then work with ΣF directly in the formulation of an optimization and not use a full N×N covariance matrix.
Third, from a portfolio optimization standpoint we don't care if the factors are orthogonal or not. We can rotate them to be orthogonal. As long as ΣF is positive definite, we can use the Cholesky decomposition to write it as LLT=ΣF and then replace the loadings matrix e with a rotated one ˜e=eL so that now the factors are orthogonal. That is eΣFeT=eLLTeT=˜e˜eT.
No comments:
Post a Comment