Entropic value at risk

In financial mathematics and stochastic optimization, the concept of risk measure is used to quantify the risk involved in a random outcome or risk position. Many risk measures have hitherto been proposed, each having certain characteristics. The entropic value-at-risk (EVaR) is a coherent risk measure introduced by Ahmadi-Javid,[1][2] which is an upper bound for the value-at-risk (VaR) and the conditional value-at-risk (CVaR), obtained from the Chernoff inequality. The EVaR can also be represented by using the concept of relative entropy. Because of its connection with the VaR and the relative entropy, this risk measure is called "entropic value-at-risk". The EVaR was developed to tackle some computational inefficienciesTemplate:Clarify of the CVaR. Getting inspiration from the dual representation of the EVaR, Ahmadi-Javid[1][2] developed a wide class of coherent risk measures, called g-entropic risk measures. Both the CVaR and the EVaR are members of this class.

Definition

Let ${\displaystyle (\Omega ,{\mathcal {F}},P)}$ be a probability space with ${\displaystyle \Omega }$ a set of all simple events, ${\displaystyle {\mathcal {F}}}$ a ${\displaystyle \sigma }$-algebra of subsets of ${\displaystyle \Omega }$ and ${\displaystyle P}$ a probability measure on ${\displaystyle {\mathcal {F}}}$. Let ${\displaystyle X}$ be a random variable and ${\displaystyle {\mathbf {L} }_{M^{+}}}$ be the set of all Borel measurable functions ${\displaystyle X:\Omega \rightarrow \mathbb {R} }$ whose moment-generating function ${\displaystyle M_{X}(z)}$ exists for all ${\displaystyle z\geq 0}$. The entropic value-at-risk (EVaR) of ${\displaystyle X\in \mathbf {L} _{M^{+}}}$ with confidence level ${\displaystyle 1-\alpha }$ is defined as follows: Template:NumBlk In finance, the random variable ${\displaystyle X\in \mathbf {L} _{M^{+}}}$, in the above equation, is used to model the losses of a portfolio.

Consider the Chernoff inequality Template:NumBlk Solving the equation ${\displaystyle e^{-za}M_{X}(z)=\alpha }$ for ${\displaystyle a}$, results in ${\displaystyle a_{X}(\alpha ,z):=z^{-1}\ln(M_{X}(z)/\alpha )}$. By considering the equation (Template:EquationNote), we see that ${\displaystyle {\text{EVaR}}_{1-\alpha }(X):=\inf _{z>0}\{a_{X}(\alpha ,z)\}}$, which shows the relationship between the EVaR and the Chernoff inequality. It is worth noting that ${\displaystyle a_{X}(1,z)}$ is the entropic risk measure or exponential premium, which is a concept used in finance and insurance, respectively.

Let ${\displaystyle \mathbf {L} _{M}}$ be the set of all Borel measurable functions ${\displaystyle X:\Omega \rightarrow \mathbb {R} }$ whose moment-generating function ${\displaystyle M_{X}(z)}$ exists for all ${\displaystyle z}$. The dual representation (or robust representation) of the EVaR is as follows: Template:NumBlk where ${\displaystyle X\in \mathbf {L} _{M}}$, and ${\displaystyle \Im }$ is a set of probability measures on ${\displaystyle (\Omega ,{\mathcal {F}})}$ with ${\displaystyle \Im =\{Q\ll P:D_{KL}(Q||P)\leq -\ln \alpha \}}$. Note that ${\displaystyle D_{KL}(Q||P):=\int {\frac {dQ}{dP}}(\ln {\frac {dQ}{dP}})dP}$ is the relative entropy of ${\displaystyle Q}$ with respect to ${\displaystyle P}$, also called the Kullback-Leibler divergence. The dual representation of the EVaR discloses the reason behind its naming.

Properties

• The following inequality holds for the EVaR:

Examples

File:Comparing the VaR, CVaR and EVaR for the standard normal distribution.png
Comparing the VaR, CVaR and EVaR for the standard normal distribution
File:Comparing the VaR, CVaR and EVaR for the uniform distribution.png
Comparing the VaR, CVaR and EVaR for the uniform distribution over the interval (0,1)

For ${\displaystyle X\sim N(\mu ,\sigma )}$, Template:NumBlk For ${\displaystyle X\sim U(a,b)}$, Template:NumBlk Figures 1 and 2 show the comparing of the VaR, CVaR and EVaR for ${\displaystyle N(0,1)}$ and ${\displaystyle U(0,1)}$.

Optimization

Let ${\displaystyle \rho }$ be a risk measure. Consider the optimization problem Template:NumBlk where ${\displaystyle {\boldsymbol {w}}\in {\boldsymbol {W}}\subseteq \mathbb {R} ^{n}}$ is an ${\displaystyle n}$-dimensional real decision vector, ${\displaystyle {\boldsymbol {\psi }}}$ is an ${\displaystyle m}$-dimensional real random vector with a known probability distribution and the function ${\displaystyle G({\boldsymbol {w}},.):\mathbb {R} ^{m}\rightarrow \mathbb {R} }$ is a Borel measurable function for all values ${\displaystyle {\boldsymbol {w}}\in {\boldsymbol {W}}}$. If ${\displaystyle \rho }$ is the ${\displaystyle {\text{EVaR}}}$, then the problem (Template:EquationNote) becomes as follows: Template:NumBlk

Let ${\displaystyle {\boldsymbol {S}}_{\boldsymbol {\psi }}}$ be the support of the random vector ${\displaystyle {\boldsymbol {\psi }}}$. If ${\displaystyle G(.,{\boldsymbol {s}})}$ is convex for all ${\displaystyle {\boldsymbol {s}}\in {\boldsymbol {S}}_{\boldsymbol {\psi }}}$, then the objective function of the problem (Template:EquationNote) is also convex. If ${\displaystyle G({\boldsymbol {w}},{\boldsymbol {\psi }})}$ has the form Template:NumBlk and ${\displaystyle \psi _{1},\dots ,\psi _{m}}$ are independent random variables in ${\displaystyle \mathbf {L} _{M}}$, then (Template:EquationNote) becomes Template:NumBlk which is computationally tractable. But for this case, if one uses the CVaR in problem (Template:EquationNote), then the resulting problem becomes as follows: Template:NumBlk It can be shown that by increasing the dimension of ${\displaystyle \psi }$, problem (Template:EquationNote) is computationally intractable even for simple cases. For example, assume that ${\displaystyle \psi _{1},\dots ,\psi _{m}}$ are independent discrete random variables that take ${\displaystyle k}$ distinct values. For fixed values of ${\displaystyle {\boldsymbol {w}}}$ and ${\displaystyle t}$, the complexity of computing the objective function given in problem (Template:EquationNote) is of order ${\displaystyle mk}$ while the computing time for the objective function of problem (Template:EquationNote) is of order ${\displaystyle k^{m}}$. For illustration, assume that ${\displaystyle k=2}$, ${\displaystyle m=100}$ and the summation of two numbers takes ${\displaystyle 10^{-12}}$ seconds. For computing the objective function of problem (Template:EquationNote) one needs about ${\displaystyle 4\times 10^{10}}$ years, whereas the evaluation of objective function of problem (Template:EquationNote) takes about ${\displaystyle 10^{-10}}$ seconds. This shows that formulation with the EVaR outperforms the formulation with the CVaR (see [2] for more details).

Generalization (g-entropic risk measures)

Drawing inspiration from the dual representation of the EVaR given in (Template:EquationNote), one can define a wide class of information-theoretic coherent risk measures, which are introduced in.[1][2] Let ${\displaystyle g}$ be a convex proper function with ${\displaystyle g(1)=0}$ and ${\displaystyle \beta }$ be a non-negative number. The ${\displaystyle g}$-entropic risk measure with divergence level ${\displaystyle \beta }$ is defined as Template:NumBlk where ${\displaystyle \Im =\{Q\ll P:H_{g}(P,Q)\leq \beta \}}$ in which ${\displaystyle H_{g}(P,Q)}$ is the generalized relative entropy of ${\displaystyle Q}$ with respect to ${\displaystyle P}$. A primal representation of the class of ${\displaystyle g}$-entropic risk measures can be obtained as follows: Template:NumBlk where ${\displaystyle g^{*}}$ is the conjugate of ${\displaystyle g}$. By considering Template:NumBlk with ${\displaystyle g^{*}(x)=e^{x-1}}$ and ${\displaystyle \beta =-\ln \alpha }$, the EVaR formula can be deduced. The CVaR is also a ${\displaystyle g}$-entropic risk measure, which can be obtained from (Template:EquationNote) by setting Template:NumBlk with ${\displaystyle g^{*}(x)={\frac {1}{\alpha }}\max\{0,x\}}$ and ${\displaystyle \beta =0}$ (see [1][3] for more details).

For more results on ${\displaystyle g}$-entropic risk measures see.[4]