We investigate two methods for reducing estimation error in portfolio
optimization with Conditional Value-at-Risk (CVaR). The first method is
nonparametric: penalize portfolios with large variances in mean and CVaR
estimations. The penalized problem is solvable by a quadratically-constrained
quadratic program, and can be interpreted as a chance-constrained program. We
show the original and penalized solutions follow the Central Limit Theorem with
computable covariance by extending M-estimation results from statistics.
Shrinkage estimators of covariance are an important tool in modern applied
and theoretical statistics. They play a key role in regularized estimation
problems, such as ridge regression (aka Tykhonov regularization), regularized
discriminant analysis and a variety of optimization problems.
In this paper, we bring to bear the tools of random matrix theory to
understand their behavior, and in particular, that of quadratic forms involving
inverses of those estimators, which are important in practice.
Kernel random matrices have attracted a lot of interest in recent years, from
both practical and theoretical standpoints. Most of the theoretical work so far
has focused on the case were the data is sampled from a low-dimensional
structure. Very recently, the first results concerning kernel random matrices
with high-dimensional input data were obtained, in a setting where the data was
sampled from a genuinely high-dimensional structure---similar to standard
assumptions in random matrix theory.
We place ourselves in the setting of high-dimensional statistical inference
where the number of variables $p$ in a dataset of interest is of the same order
of magnitude as the number of observations $n$. We consider the spectrum of
certain kernel random matrices, in particular $n\times n$ matrices whose
$(i,j)$th entry is $f(X_i'X_j/p)$ or $f(\Vert X_i-X_j\Vert^2/p)$ where $p$ is
the dimension of the data, and $X_i$ are independent data vectors. Here $f$ is
assumed to be a locally smooth function.
We place ourselves in the setting of high-dimensional statistical inference,
where the number of variables $p$ in a data set of interest is of the same
order of magnitude as the number of observations $n$. More formally, we study
the asymptotic properties of correlation and covariance matrices, in the
setting where $p/n\to\rho\in(0,\infty),$ for general population covariance. We
show that, for a large class of models studied in random matrix theory,
spectral properties of large-dimensional correlation matrices are similar to
those of large-dimensional covarance matrices.