scholarly journals Portfolio optimization under Expected Shortfall: contour maps of estimation error

2017 ◽  
Vol 18 (8) ◽  
pp. 1295-1313 ◽  
Author(s):  
Fabio Caccioli ◽  
Imre Kondor ◽  
Gábor Papp
Author(s):  
Imre Kondor ◽  
Fabio Caccioli ◽  
Gabor Papp ◽  
Matteo Marsili

2010 ◽  
Vol 13 (03) ◽  
pp. 425-437 ◽  
Author(s):  
IMRE KONDOR ◽  
ISTVÁN VARGA-HASZONITS

It is shown that the axioms for coherent risk measures imply that whenever there is a pair of portfolios such that one of them dominates the other in a given sample (which happens with finite probability even for large samples), then there is no optimal portfolio under any coherent measure on that sample, and the risk measure diverges to minus infinity. This instability was first discovered in the special example of Expected Shortfall which is used here both as an illustration and as a springboard for generalization.


2010 ◽  
Vol 8 (2) ◽  
pp. 141 ◽  
Author(s):  
André Alves Portela Santos

Robust optimization has been receiving increased attention in the recent few years due to the possibility of considering the problem of estimation error in the portfolio optimization problem. A question addressed so far by very few works is whether this approach is able to outperform traditional portfolio optimization techniques in terms of out-of-sample performance. Moreover, it is important to know whether this approach is able to deliver stable portfolio compositions over time, thus reducing management costs and facilitating practical implementation. We provide empirical evidence by assessing the out-of-sample performance and the stability of optimal portfolio compositions obtained with robust optimization and with traditional optimization techniques. The results indicated that, for simulated data, robust optimization performed better (both in terms of Sharpe ratios and portfolio turnover) than Markowitz's mean-variance portfolios and similarly to minimum-variance portfolios. The results for real market data indicated that the differences in risk-adjusted performance were not statistically different, but the portfolio compositions associated to robust optimization were more stable over time than traditional portfolio selection techniques.


2019 ◽  
Vol 31 (3) ◽  
pp. 257-280
Author(s):  
Zhongyu Li ◽  
Ka Ho Tsang ◽  
Hoi Ying Wong

Abstract This paper proposes a regression-based simulation algorithm for multi-period mean-variance portfolio optimization problems with constraints under a high-dimensional setting. For a high-dimensional portfolio, the least squares Monte Carlo algorithm for portfolio optimization can perform less satisfactorily with finite sample paths due to the estimation error from the ordinary least squares (OLS) in the regression steps. Our algorithm, which resolves this problem e, that demonstrates significant improvements in numerical performance for the case of finite sample path and high dimensionality. Specifically, we replace the OLS by the least absolute shrinkage and selection operator (lasso). Our major contribution is the proof of the asymptotic convergence of the novel lasso-based simulation in a recursive regression setting. Numerical experiments suggest that our algorithm achieves good stability in both low- and higher-dimensional cases.


2016 ◽  
Vol 19 (05) ◽  
pp. 1650035 ◽  
Author(s):  
FABIO CACCIOLI ◽  
IMRE KONDOR ◽  
MATTEO MARSILI ◽  
SUSANNE STILL

We show that including a term which accounts for finite liquidity in portfolio optimization naturally mitigates the instabilities that arise in the estimation of coherent risk measures on finite samples. This is because taking into account the impact of trading in the market is mathematically equivalent to introducing a regularization on the risk measure. We show here that the impact function determines which regularizer is to be used. We also show that any regularizer based on the norm [Formula: see text] with [Formula: see text] makes the sensitivity of coherent risk measures to estimation error disappear, while regularizers with [Formula: see text] do not. The [Formula: see text] norm represents a border case: its “soft” implementation does not remove the instability, but rather shifts its locus, whereas its “hard” implementation (including hard limits or a ban on short selling) eliminates it. We demonstrate these effects on the important special case of expected shortfall (ES) which has recently become the global regulatory market risk measure.


2007 ◽  
Vol 7 (4) ◽  
pp. 389-396 ◽  
Author(s):  
Stefano Ciliberti ◽  
Imre Kondor ◽  
Marc Mézard

Author(s):  
Anulekha Dhara ◽  
Bikramjit Das ◽  
Karthik Natarajan

Computing and minimizing the worst-case bound on the expected shortfall risk of a portfolio given partial information on the distribution of the asset returns is an important problem in risk management. One such bound that been proposed is for the worst-case distribution that is “close” to a reference distribution where closeness in distance among distributions is measured using [Formula: see text]-divergence. In this paper, we advocate the use of such ambiguity sets with a tree structure on the univariate and bivariate marginal distributions. Such an approach has attractive modeling and computational properties. From a modeling perspective, this provides flexibility for risk management applications where there are many more choices for bivariate copulas in comparison with multivariate copulas. Bivariate copulas form the basis of the nested tree structure that is found in vine copulas. Because estimating a vine copula is fairly challenging, our approach provides robust bounds that are valid for the tree structure that is obtained by truncating the vine copula at the top level. The model also provides flexibility in tackling instances when the lower dimensional marginal information is inconsistent that might arise when multiple experts provide information. From a computational perspective, under the assumption of a tree structure on the bivariate marginals, we show that the worst-case expected shortfall is computable in polynomial time in the input size when the distributions are discrete. The corresponding distributionally robust portfolio optimization problem is also solvable in polynomial time. In contrast, under the assumption of independence, the expected shortfall is shown to be #P-hard to compute for discrete distributions. We provide numerical examples with simulated and real data to illustrate the quality of the worst-case bounds in risk management and portfolio optimization and compare it with alternate probabilistic models such as vine copulas and Markov tree distributions.


Sign in / Sign up

Export Citation Format

Share Document