基于神经网络分位数回归的多期CVaR风险测度

与VaR金融风险测度相比,CVaR具有更好的数理性质,其计算方法成为关注的焦点。相对于单期CVaR而言,多期CVaR风险测度具有较强的非线性特征,其建模过程更加复杂。在神经网络分位数回归基础上,建立了一种新的多期CVaR风险测度方法;基于似然比检验,建立了多期CVaR风险测度返回测试评价准则。将该新方法应用于沪深300指数的多期CVaR风险测度,并将其与传统的测度方法进行了对比,返回测试结果表明:第一,该新方法具有较强的稳健性,各期平均绝对误差大小基本不变,特别适合于多期CVaR风险测度;第二,基于神经网络分位数回归的多期CVaR风险测度效果优于传统测度方法,表现为似然比检验拒绝次数最少和平均绝对误差最小。     

CVaR norm and applications in optimization

This paper introduces the family of CVaR norms in \({\mathbb {R}}^{n}\) , based on the CVaR concept. The CVaR norm is defined in two variations: scaled and non-scaled. The well-known \(L_{1}\) and \(L_{\infty }\) norms are limiting cases of the new family of norms. The D-norm, used in robust optimization, is equivalent to the non-scaled CVaR norm. We present two relatively simple definitions of the CVaR norm: (i) as the average or the sum of some percentage of largest absolute values of components of vector; (ii) as an optimal solution of a CVaR minimization problem suggested by Rockafellar and Uryasev. CVaR norms are piece-wise linear functions on \({\mathbb {R}}^{n}\) and can be used in various applications where the Euclidean norm is typically used. To illustrate, in the computational experiments we consider the problem of projecting a point onto a polyhedral set. The CVaR norm allows formulating this problem as a convex or linear program for any level of conservativeness.     

CVaR、VaR应用在RAROC的比较研究

本文将CVaR引入到RAROC(R isk-Ad justed Return on Cap ital)中,进行绩效评价。而且,将CVaR与VaR的结果进行了比较。在正态分布的情况下,CVaR与VaR的RAPM(R isk-Ad justedPerform ance M easure)对于绩效评价都是充分的、可靠的、有效的,且两者是等价的。但在非正态的情况下,CVaR的RAPM相对于VaR的RAPM更加充分、谨慎、可靠、有效。我们运用Bootstrap方法进行了实证研究。     

Conditional value-at-risk in portfolio optimization: Coherent but fragile

We evaluate conditional value-at-risk (CVaR) as a risk measure in data-driven portfolio optimization. We show that portfolios obtained by solving mean-CVaR and global minimum CVaR problems are unreliable due to estimation errors of CVaR and/or the mean, which are magnified by optimization. This problem is exacerbated when the tail of the return distribution is made heavier. We conclude that CVaR, a coherent risk measure, is fragile in portfolio optimization due to estimation errors.     

一种多目标条件风险值数学模型

研究了一种多目标条件风险值(CVaR)数学模型理论.先定义了一种多目标损失函数下的α-VaR和α-CVaR值,给出了多目标CVaR最优化模型.然后证明了多目标意义下的α-VaR和α-CVaR值的等价定理,并且给出了对于多目标损失函数的条件风险值的一致性度量性质.最后,给出了多目标CVaR模型的近似求解模型.     

TTRISK: Tensor train decomposition algorithm for risk averse optimization

This article develops a new algorithm named TTRISK to solve high-dimensional risk-averse optimization problems governed by differential equations (ODEs and/or partial differential equations [PDEs]) under uncertainty. As an example, we focus on the so-called Conditional Value at Risk (CVaR), but the approach is equally applicable to other coherent risk measures. Both the full and reduced space formulations are considered. The algorithm is based on low rank tensor approximations of random fields discretized using stochastic collocation. To avoid nonsmoothness of the objective function underpinning the CVaR, we propose an adaptive strategy to select the width parameter of the smoothed CVaR to balance the smoothing and tensor approximation errors. Moreover, unbiased Monte Carlo CVaR estimate can be computed by using the smoothed CVaR as a control variate. To accelerate the computations, we introduce an efficient preconditioner for the Karush–Kuhn–Tucker (KKT) system in the full space formulation.The numerical experiments demonstrate that the proposed method enables accurate CVaR optimization constrained by large-scale discretized systems. In particular, the first example consists of an elliptic PDE with random coefficients as constraints. The second example is motivated by a realistic application to devise a lockdown plan for United Kingdom under COVID-19. The results indicate that the risk-averse framework is feasible with the tensor approximations under tens of random variables.     

A robust approach based on conditional value-at-risk measure to statistical learning problems

In statistical learning problems, measurement errors in the observed data degrade the reliability of estimation. There exist several approaches to handle those uncertainties in observations. In this paper, we propose to use the conditional value-at-risk (CVaR) measure in order to depress influence of measurement errors, and investigate the relation between the resulting CVaR minimization problems and some existing approaches in the same framework. For the CVaR minimization problems which include the computation of integration, we apply Monte Carlo sampling method and obtain their approximate solutions. The approximation error bound and convergence property of the solution are proved by Vapnik and Chervonenkis theory. Numerical experiments show that the CVaR minimization problem can achieve fairly good estimation results, compared with several support vector machines, in the presence of measurement errors.     

Asymptotic behavior of the empirical conditional value-at-risk

We study asymptotic behavior of the empirical conditional value-at-risk (CVaR). In particular, the Berry–Essen bound, the law of iterated logarithm, the moderate deviation principle and the large deviation principle for the empirical CVaR are obtained. We also give some numerical examples.     

Asymptotic Analysis of Sample Average Approximation for Stochastic Optimization Problems with Joint Chance Constraints via Conditional Value at Risk and Difference of Convex Functions

Conditional Value at Risk (CVaR) has been recently used to approximate a chance constraint. In this paper, we study the convergence of stationary points, when sample average approximation (SAA) method is applied to a CVaR approximated joint chance constrained stochastic minimization problem. Specifically, we prove under some moderate conditions that optimal solutions and stationary points, obtained from solving sample average approximated problems, converge with probability one to their true counterparts. Moreover, by exploiting the recent results on large deviation of random functions and sensitivity results for generalized equations, we derive exponential rate of convergence of stationary points. The discussion is also extended to the case, when CVaR approximation is replaced by a difference of two convex functions (DC-approximation). Some preliminary numerical test results are reported.     

A smoothing sample average approximation method for stochastic optimization problems with CVaR risk measure

This paper is concerned with solving single CVaR and mixed CVaR minimization problems. A CHKS-type smoothing sample average approximation (SAA) method is proposed for solving these two problems, which retains the convexity and smoothness of the original problem and is easy to implement. For any fixed smoothing constant ε, this method produces a sequence whose cluster points are weak stationary points of the CVaR optimization problems with probability one. This framework of combining smoothing technique and SAA scheme can be extended to other smoothing functions as well. Practical numerical examples arising from logistics management are presented to show the usefulness of this method.     

Robust portfolio optimization with copulas

Conditional Value at Risk (CVaR) is widely used in portfolio optimization as a measure of risk. CVaR is clearly dependent on the underlying probability distribution of the portfolio. We show how copulas can be introduced to any problem that involves distributions and how they can provide solutions for the modeling of the portfolio. We use this to provide the copula formulation of the CVaR of a portfolio. Given the critical dependence of CVaR on the underlying distribution, we use a robust framework to extend our approach to Worst Case CVaR (WCVaR). WCVaR is achieved through the use of rival copulas. These rival copulas have the advantage of exploiting a variety of dependence structures, symmetric and not. We compare our model against two other models, Gaussian CVaR and Worst Case Markowitz. Our empirical analysis shows that WCVaR can asses the risk more adequately than the two competitive models during periods of crisis.     

Dynamic conditional value-at-risk model for routing and scheduling of hazardous material transportation networks

This paper illustrates a dynamic model of conditional value-at-risk (CVaR) measure for risk assessment and mitigation of hazardous material transportation in supply chain networks. The well-established market risk measure, CVaR, which is commonly used by financial institutions for portfolio optimizations, is investigated. In contrast to previous works, we consider CVaR as the main objective in the optimization of hazardous material (hazmat) transportation network. In addition to CVaR minimization and route planning of a supply chain network, the time scheduling of hazmat shipments is imposed and considered in the present study. Pertaining to the general dynamic risk model, we analyzed several scenarios involving a variety of hazmats and time schedules with respect to optimal route selection and CVaR minimization. A solution algorithm is then proposed for solving the model, with verifications made using numerical examples and sensitivity analysis.     

An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions

We consider a class of risk-averse submodular maximization problems (RASM) where the objective is the conditional value-at-risk (CVaR) of a random nondecreasing submodular function at a given risk level. We propose valid inequalities and an exact general method for solving RASM under the assumption that we have an efficient oracle that computes the CVaR of the random function. We demonstrate the proposed method on a stochastic set covering problem that admits an efficient CVaR oracle for the random coverage function.     

A risk management system for sustainable fleet replacement

This article analyzes the fleet management problem faced by a firm when deciding which vehicles to add to its fleet. Such a decision depends not only on the expected mileage and tasks to be assigned to the vehicle but also on the evolution of fuel and CO₂ emission prices and on fuel efficiency. This article contributes to the literature on fleet replacement and sustainable operations by proposing a general decision support system for the fleet replacement problem using stochastic programming and conditional value at risk (CVaR) to account for uncertainty in the decision process. The article analyzes how the CVaR associated with different types of vehicle is affected by the parameters in the model by reporting on the results of a real-world case study.     

极值理论在高频数据中的VaR和CVaR风险价值研究

高频数据具有与低频数据明显不同的特征。本文引入广义帕雷托分布代替传统的正态分布等,精确描述金融高频数据收益的厚尾特征;并且计算高频数据下的VaR和CVaR,然后利用深成A指数据进行返回检验。两种返回检验方法的结果表明,极值理论方法可以比较精确地度量VaR和CVaR。     

Entropic Value-at-Risk: A New Coherent Risk Measure

This paper introduces the concept of entropic value-at-risk (EVaR), a new coherent risk measure that corresponds to the tightest possible upper bound obtained from the Chernoff inequality for the value-at-risk (VaR) as well as the conditional value-at-risk (CVaR). We show that a broad class of stochastic optimization problems that are computationally intractable with the CVaR is efficiently solvable when the EVaR is incorporated. We also prove that if two distributions have the same EVaR at all confidence levels, then they are identical at all points. The dual representation of the EVaR is closely related to the Kullback-Leibler divergence, also known as the relative entropy. Inspired by this dual representation, we define a large class of coherent risk measures, called g-entropic risk measures. The new class includes both the CVaR and the EVaR.     

Concentration bounds for empirical conditional value-at-risk: The unbounded case

Conditional Value-at-Risk (CVaR) is a popular risk measure for modelling losses in the case of a rare but extreme event. We consider the problem of estimating CVaR from i.i.d. samples of an unbounded random variable, which is either sub-Gaussian or sub-exponential. We derive a novel one-sided concentration bound for a natural sample-based CVaR estimator in this setting. Our bound relies on a concentration result for a quantile-based estimator for Value-at-Risk (VaR), which may be of independent interest.     

Distributionally robust chance constrained problem under interval distribution information

This paper is concerned with distributionally robust chance constrained problem under interval distribution information. Using worst-case CVaR approximation, we present a tractable convex programming approximation for distributionally robust individual chance constrained problem under interval sets of mean and covariance information. We prove the worst-case CVaR approximation problem is an exact form of the distributionally robust individual chance constrained problem. Then, our result is applied to worst-case Value-at-Risk optimization problem. Moreover, we discuss the problem under several ambiguous distribution information and investigate tractable approximations for distributionally robust joint chance constrained problem. Finally, we provide an illustrative example to show our results.     

Newsvendor solutions via conditional value-at-risk minimization

In this paper, we consider the minimization of the conditional value-at-risk (CVaR), a most preferable risk measure in financial risk management, in the context of the well-known single-period newsvendor problem, which is originally formulated as the maximization of the expected profit or the minimization of the expected cost. We show that downside risk measures including the CVaR are tractable in the problem due to their convexity, and consequently, under mild assumptions on the probability distribution of products’ demand, we provide analytical solutions or linear programming (LP) formulation of the minimization of the CVaR measures defined with two different loss functions. Numerical examples are also exhibited, clarifying the difference among the models analyzed in this paper, and demonstrating the efficiency of the LP solutions.     

基于均值和CVaR的效用最大化模型研究

本文利用CVaR方法代替方差或VaR来度量风险,建立了关于期望和CVaR的效用最大化模型,研究了n种风险资产的投资决策问题。在效用函数是凹的假设下,首先得到了无差异曲线的特征及均值-CVaR模型有效边界的性质,然后利用这些结论得到了效用最大值存在的条件及其最优解的性质特征,给出了求解的具体步骤和算法,并分析了最大效用点的经济含义.最后,一个基于中国股票市场真实数据的数值算例说明了本文的结论及应用。