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, 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 inefficiencies of the CVaR. Getting inspiration from the dual representation of the EVaR, Ahmadi-Javid developed a wide class of coherent risk measures, called g-entropic risk measures. Both the CVaR and the EVaR are members of this class.
Let
(
Ω
,
F
,
P
)
be a probability space with
Ω
a set of all simple events,
F
a
σ
-algebra of subsets of
Ω
and
P
a probability measure on
F
. Let
X
be a random variable and
L
M
+
be the set of all Borel measurable functions
X
:
Ω
→
R
whose moment-generating function
M
X
(
z
)
exists for all
z
≥
0
. The entropic value-at-risk (EVaR) of
X
∈
L
M
+
with confidence level
1
−
α
is defined as follows:
In finance, the random variable
X
∈
L
M
+
, in the above equation, is used to model the losses of a portfolio.
Consider the Chernoff inequality
Solving the equation
e
−
z
a
M
X
(
z
)
=
α
for
a
, results in
a
X
(
α
,
z
)
:=
z
−
1
ln
(
M
X
(
z
)
/
α
)
. By considering the equation (1), we see that
EVaR
1
−
α
(
X
)
:=
inf
z
>
0
{
a
X
(
α
,
z
)
}
, which shows the relationship between the EVaR and the Chernoff inequality. It is worth noting that
a
X
(
1
,
z
)
is the entropic risk measure or exponential premium, which is a concept used in finance and insurance, respectively.
Let
L
M
be the set of all Borel measurable functions
X
:
Ω
→
R
whose moment-generating function
M
X
(
z
)
exists for all
z
. The dual representation (or robust representation) of the EVaR is as follows:
where
X
∈
L
M
, and
ℑ
is a set of probability measures on
(
Ω
,
F
)
with
ℑ
=
{
Q
≪
P
:
D
K
L
(
Q
|
|
P
)
≤
−
ln
α
}
. Note that
D
K
L
(
Q
|
|
P
)
:=
∫
d
Q
d
P
(
ln
d
Q
d
P
)
d
P
is the relative entropy of
Q
with respect to
P
, also called the Kullback–Leibler divergence. The dual representation of the EVaR discloses the reason behind its naming.
The EVaR is a coherent risk measure.
The moment-generating function
M
X
(
z
)
can be represented by the EVaR: for all
X
∈
L
M
+
and
z
>
0
For
X
,
Y
∈
L
M
,
EVaR
1
−
α
(
X
)
=
EVaR
1
−
α
(
Y
)
for all
α
∈
]
0
,
1
]
if and only if
F
X
(
b
)
=
F
Y
(
b
)
for all
b
∈
R
.
The entropic risk measure with parameter
θ
, can be represented by means of the EVaR: for all
X
∈
L
M
+
and
θ
>
0
The EVaR with confidence level
1
−
α
is the tightest possible upper bound that can be obtained from the Chernoff inequality for the VaR and the CVaR with confidence level
1
−
α
;
The following inequality holds for the EVaR:
where
E
(
X
)
is the expected value of
X
and
esssup
(
X
)
is the essential supremum of
X
, i.e.,
inf
t
∈
R
{
t
:
Pr
(
X
≤
t
)
=
1
}
. So do hold
EVaR
0
(
X
)
=
E
(
X
)
and
lim
α
→
0
EVaR
1
−
α
(
X
)
=
esssup
(
X
)
.
For
X
∼
N
(
μ
,
σ
)
,
For
X
∼
U
(
a
,
b
)
,
Figures 1 and 2 show the comparing of the VaR, CVaR and EVaR for
N
(
0
,
1
)
and
U
(
0
,
1
)
.
Let
ρ
be a risk measure. Consider the optimization problem
where
w
∈
W
⊆
R
n
is an
n
-dimensional real decision vector,
ψ
is an
m
-dimensional real random vector with a known probability distribution and the function
G
(
w
,
.
)
:
R
m
→
R
is a Borel measurable function for all values
w
∈
W
. If
ρ
is the
EVaR
, then the problem (10) becomes as follows:
Let
S
ψ
be the support of the random vector
ψ
. If
G
(
.
,
s
)
is convex for all
s
∈
S
ψ
, then the objective function of the problem (11) is also convex. If
G
(
w
,
ψ
)
has the form
and
ψ
1
,
…
,
ψ
m
are independent random variables in
L
M
, then (11) becomes
which is computationally tractable. But for this case, if one uses the CVaR in problem (10), then the resulting problem becomes as follows:
It can be shown that by increasing the dimension of
ψ
, problem (14) is computationally intractable even for simple cases. For example, assume that
ψ
1
,
…
,
ψ
m
are independent discrete random variables that take
k
distinct values. For fixed values of
w
and
t
, the complexity of computing the objective function given in problem (13) is of order
m
k
while the computing time for the objective function of problem (14) is of order
k
m
. For illustration, assume that
k
=
2
,
m
=
100
and the summation of two numbers takes
10
−
12
seconds. For computing the objective function of problem (14) one needs about
4
×
10
10
years, whereas the evaluation of objective function of problem (13) takes about
10
−
10
seconds. This shows that formulation with the EVaR outperforms the formulation with the CVaR (see for more details).
Drawing inspiration from the dual representation of the EVaR given in (3), one can define a wide class of information-theoretic coherent risk measures, which are introduced in. Let
g
be a convex proper function with
g
(
1
)
=
0
and
β
be a non-negative number. The
g
-entropic risk measure with divergence level
β
is defined as
where
ℑ
=
{
Q
≪
P
:
H
g
(
P
,
Q
)
≤
β
}
in which
H
g
(
P
,
Q
)
is the generalized relative entropy of
Q
with respect to
P
. A primal representation of the class of
g
-entropic risk measures can be obtained as follows:
where
g
∗
is the conjugate of
g
. By considering
with
g
∗
(
x
)
=
e
x
−
1
and
β
=
−
ln
α
, the EVaR formula can be deduced. The CVaR is also a
g
-entropic risk measure, which can be obtained from (16) by setting
with
g
∗
(
x
)
=
1
α
max
{
0
,
x
}
and
β
=
0
(see for more details).
For more results on
g
-entropic risk measures see.
