Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA fully data-driven approach to minimizing CVaR for portfolio of assets via SGLD with discontinuous updating
85
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
A new approach in stochastic optimization via the use of stochastic gradient Langevin dynamics (SGLD) algorithms, which is a variant of stochastic gradient decent (SGD) methods, allows us to efficiently approximate global minimizers of possibly complicated, high-dimensional landscapes. With this in mind, we extend here the non-asymptotic analysis of SGLD to the case of discontinuous stochastic gradients. We are thus able to provide theoretical guarantees for the algorithms convergence in (standard) Wasserstein distances for both convex and non-convex objective functions. We also provide explicit upper estimates of the expected excess risk associated with the approximation of global minimizers of these objective functions. All these findings allow us to devise and present a fully data-driven approach for the optimal allocation of weights for the minimization of CVaR of portfolio of assets with complete theoretical guarantees for its performance. Numerical results illustrate our main findings.
rate research
Read More
We show how to reduce the problem of computing VaR and CVaR with Student T return distributions to evaluation of analytical functions of the moments. This allows an analysis of the risk properties of systems to be carefully attributed between choices of risk function (e.g. VaR vs CVaR); choice of return distribution (power law tail vs Gaussian) and choice of event frequency, for risk assessment. We exploit this to provide a simple method for portfolio optimization when the asset returns follow a standard multivariate T distribution. This may be used as a semi-analytical verification tool for more general optimizers, and for practical assessment of the impact of fat tails on asset allocation for shorter time horizons.
We propose a data-driven portfolio selection model that integrates side information, conditional estimation and robustness using the framework of distributionally robust optimization. Conditioning on the observed side information, the portfolio manager solves an allocation problem that minimizes the worst-case conditional risk-return trade-off, subject to all possible perturbations of the covariate-return probability distribution in an optimal transport ambiguity set. Despite the non-linearity of the objective function in the probability measure, we show that the distributionally robust portfolio allocation with side information problem can be reformulated as a finite-dimensional optimization problem. If portfolio decisions are made based on either the mean-variance or the mean-Conditional Value-at-Risk criterion, the resulting reformulation can be further simplified to second-order or semi-definite cone programs. Empirical studies in the US and Chinese equity markets demonstrate the advantage of our integrative framework against other benchmarks.
We study a static portfolio optimization problem with two risk measures: a principle risk measure in the objective function and a secondary risk measure whose value is controlled in the constraints. This problem is of interest when it is necessary to consider the risk preferences of two parties, such as a portfolio manager and a regulator, at the same time. A special case of this problem where the risk measures are assumed to be coherent (positively homogeneous) is studied recently in a joint work of the author. The present paper extends the analysis to a more general setting by assuming that the two risk measures are only quasiconvex. First, we study the case where the principal risk measure is convex. We introduce a dual problem, show that there is zero duality gap between the portfolio optimization problem and the dual problem, and finally identify a condition under which the Lagrange multiplier associated to the dual problem at optimality gives an optimal portfolio. Next, we study the general case without the convexity assumption and show that an approximately optimal solution with prescribed optimality gap can be achieved by using the well-known bisection algorithm combined with a duality result that we prove.
We study the design of portfolios under a minimum risk criterion. The performance of the optimized portfolio relies on the accuracy of the estimated covariance matrix of the portfolio asset returns. For large portfolios, the number of available market returns is often of similar order to the number of assets, so that the sample covariance matrix performs poorly as a covariance estimator. Additionally, financial market data often contain outliers which, if not correctly handled, may further corrupt the covariance estimation. We address these shortcomings by studying the performance of a hybrid covariance matrix estimator based on Tylers robust M-estimator and on Ledoit-Wolfs shrinkage estimator while assuming samples with heavy-tailed distribution. Employing recent results from random matrix theory, we develop a consistent estimator of (a scaled version of) the realized portfolio risk, which is minimized by optimizing online the shrinkage intensity. Our portfolio optimization method is shown via simulations to outperform existing methods both for synthetic and real market data.
This paper studies a continuous-time market {under stochastic environment} where an agent, having specified an investment horizon and a target terminal mean return, seeks to minimize the variance of the return with multiple stocks and a bond. In the considered model firstly proposed by [3], the mean returns of individual assets are explicitly affected by underlying Gaussian economic factors. Using past and present information of the asset prices, a partial-information stochastic optimal control problem with random coefficients is formulated. Here, the partial information is due to the fact that the economic factors can not be directly observed. Via dynamic programming theory, the optimal portfolio strategy can be constructed by solving a deterministic forward Riccati-type ordinary differential equation and two linear deterministic backward ordinary differential equations.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
