Example

The exponentially tilted measure in many cases has the same parametric form as that of ${\displaystyle X}$. One-dimensional examples include the normal distribution, the exponential distribution, the binomial distribution and the Poisson distribution.

For example, in the case of the normal distribution, ${\displaystyle N(\mu ,\sigma ^{2})}$ the tilted density ${\displaystyle f_{\theta }(x)}$ is the ${\displaystyle N(\mu +\theta \sigma ^{2},\sigma ^{2})}$ density. The table below provides more examples of tilted density.

Original distribution[5][6]	θ-Tilted distribution
${\displaystyle \mathrm {Gamma} (\alpha ,\beta )}$	${\displaystyle \mathrm {Gamma} (\alpha ,\beta -\theta )}$
${\displaystyle \mathrm {Binomial} (n,p)}$	${\displaystyle \mathrm {Binomial} \left(n,{\frac {pe^{\theta }}{1-p+pe^{\theta }}}\right)}$
${\displaystyle \mathrm {Poisson} (\lambda )}$	${\displaystyle \mathrm {Poisson} (\lambda e^{\theta })}$
${\displaystyle \mathrm {Exponential} (\lambda )}$	${\displaystyle \mathrm {Exponential} (\lambda -\theta )}$
${\displaystyle {\mathcal {N}}(\mu ,\sigma ^{2})}$	${\displaystyle {\mathcal {N}}(\mu +\theta \sigma ^{2},\sigma ^{2})}$
${\displaystyle {\mathcal {N}}(\mu ,\Sigma )}$	${\displaystyle {\mathcal {N}}(\mu +\Sigma \theta ,\Sigma )}$
${\displaystyle \chi ^{2}(\kappa )}$	${\displaystyle \mathrm {Gamma} \left({\frac {\kappa }{2}},{\frac {2}{1-2\theta }}\right)}$

For some distributions, however, the exponentially tilted distribution does not belong to the same parametric family as ${\displaystyle f}$. An example of this is the Pareto distribution with ${\displaystyle f(x)=\alpha /(1+x)^{\alpha },x>0}$, where ${\displaystyle f_{\theta }(x)}$ is well defined for ${\displaystyle \theta <0}$ but is not a standard distribution. In such examples, the random variable generation may not always be straightforward.^[7]

Advantages

In many cases, the tilted distribution belongs to the same parametric family as the original. This is particularly true when the original density belongs to the exponential family of distribution. This simplifies random variable generation during Monte-Carlo simulations. Exponential tilting may still be useful if this is not the case, though normalization must be possible and additional sampling algorithms may be needed.

In addition, there exists a simple relationship between the original and tilted CGF,

${\displaystyle \kappa _{\theta }(\eta )=\log(\mathbb {E} _{\theta }[e^{\eta X}])=\kappa (\theta +\eta )-\kappa (\theta ).}$

We can see this by observing that

${\displaystyle F_{\theta }(x)=\int \limits _{\infty }^{x}\exp\{\theta y-\kappa (\theta )\}f(y)dy.}$

Thus,

${\displaystyle {\begin{aligned}\kappa _{\theta }(\eta )&=\log \int e^{\eta x}dF_{\theta }(x)\\&=\log \int e^{\eta x}e^{\theta x-\kappa (\theta )}dF(x)\\&=\log \mathbb {E} [e^{(\eta +\theta )X-\kappa (\theta )}]\\&=\log(e^{\kappa (\eta +\theta )-\kappa (\theta )})\\&=\kappa (\eta +\theta )-\kappa (\theta )\end{aligned}}}$.

Clearly, this relationship allows for easy calculation of the CGF of the tilted distribution and thus the distributions moments. Moreover, it results in a simple form of the likelihood ratio. Specifically,

${\displaystyle \ell ={\frac {d\mathbb {P} }{d\mathbb {P} _{\theta }}}={\frac {f(x)}{f_{\theta }(x)}}=e^{-\theta x+\kappa (\theta )}}$.

Rare-event simulation

The exponential tilting of ${\displaystyle X}$, assuming it exists, supplies a family of distributions that can be used as proposal distributions for acceptance-rejection sampling or importance distributions for importance sampling. One common application is sampling from a distribution conditional on a sub-region of the domain, i.e. ${\displaystyle X|X\in A}$. With an appropriate choice of ${\displaystyle \theta }$, sampling from ${\displaystyle \mathbb {P} _{\theta }}$ can meaningfully reduce the required amount of sampling or the variance of an estimator.

Saddlepoint approximation

The saddlepoint approximation method is a density approximation methodology often used for the distribution of sums and averages of independent, identically distributed random variables that employs Edgeworth series, but which generally performs better at extreme values. From the definition of the natural exponential family, it follows that

${\displaystyle f_{\theta }({\bar {x}})=f({\bar {x}})\exp\{n(\theta {\bar {x}}-\kappa (\theta ))\}}$.

Applying the Edgeworth expansion for ${\displaystyle f_{\theta }({\bar {x}})}$, we have

${\displaystyle f_{\theta }({\bar {x}})=\psi (z)(\mathrm {Var} [{\bar {X}}])^{-1/2}\left\{1+{\frac {\rho _{3}(\theta )h_{3}(z)}{6}}+{\frac {\rho _{4}(\theta )h_{4}(z)}{24}}\dots \right\},}$

where ${\displaystyle \psi (z)}$ is the standard normal density of

${\displaystyle z={\frac {{\bar {x}}-\kappa _{\bar {x}}'(\theta )}{\kappa _{\bar {x}}''(\theta )}}}$,

${\displaystyle \rho _{n}(\theta )=\kappa ^{(n)}(\theta )\{\kappa ''(\theta )^{n/2}\}}$,

and ${\displaystyle h_{n}}$ are the hermite polynomials.

When considering values of ${\displaystyle {\bar {x}}}$ progressively farther from the center of the distribution, ${\displaystyle |z|\rightarrow \infty }$ and the ${\displaystyle h_{n}(z)}$ terms become unbounded. However, for each value of ${\displaystyle {\bar {x}}}$, we can choose ${\displaystyle \theta }$ such that

${\displaystyle \kappa '(\theta )={\bar {x}}.}$

This value of ${\displaystyle \theta }$ is referred to as the saddle-point, and the above expansion is always evaluated at the expectation of the tilted distribution. This choice of ${\displaystyle \theta }$ leads to the final representation of the approximation given by

${\displaystyle f({\bar {x}})\approx \left({\frac {n}{2\pi \kappa ''(\theta )}}\right)^{1/2}\exp\{n(\kappa (\theta )-\theta {\bar {x}})\}.}$^[8][9]

Rejection sampling

Using the tilted distribution ${\displaystyle \mathbb {P} _{\theta }}$ as the proposal, the rejection sampling algorithm prescribes sampling from ${\displaystyle f_{\theta }(x)}$ and accepting with probability

${\displaystyle {\frac {1}{c}}\exp(-\theta x+\kappa (\theta )),}$

where

${\displaystyle c=\sup \limits _{x\in X}{\frac {d\mathbb {P} }{d\mathbb {P} _{\theta }}}(x).}$

That is, a uniformly distributed random variable ${\displaystyle p\sim {\mbox{Unif}}(0,1)}$ is generated, and the sample from ${\displaystyle f_{\theta }(x)}$ is accepted if

${\displaystyle p\leq {\frac {1}{c}}\exp(-\theta x+\kappa (\theta )).}$

Importance sampling

Applying the exponentially tilted distribution as the importance distribution yields the equation

${\displaystyle \mathbb {E} (h(X))=\mathbb {E} _{\theta }[\ell (X)h(X)]}$,

where

${\displaystyle \ell (X)={\frac {d\mathbb {P} }{d\mathbb {P} _{\theta }}}}$

is the likelihood function. So, one samples from ${\displaystyle f_{\theta }}$ to estimate the probability under the importance distribution ${\displaystyle \mathbb {P} (dX)}$ and then multiplies it by the likelihood ratio. Moreover, we have the variance given by

${\displaystyle {\mbox{Var}}(X)=\mathbb {E} [(\ell (X)h(X)^{2}]}$.

Stochastic processes

Given the tilting of a normal R.V., it is intuitive that the exponential tilting of ${\displaystyle X_{t}}$, a Brownian motion with drift ${\displaystyle \mu }$ and variance ${\displaystyle \sigma ^{2}}$, is a Brownian motion with drift ${\displaystyle \mu +\theta \sigma ^{2}}$ and variance ${\displaystyle \sigma ^{2}}$. Thus, any Brownian motion with drift under ${\displaystyle \mathbb {P} }$ can be thought of as a Brownian motion without drift under ${\displaystyle \mathbb {P} _{\theta ^{*}}}$. To observe this, consider the process ${\displaystyle X_{t}=B_{t}+\mu _{t}}$. ${\displaystyle f(X_{t})=f_{\theta ^{*}}(X_{t}){\frac {d\mathbb {P} }{d\mathbb {P} _{\theta ^{*}}}}=f(B_{t})\exp\{\mu B_{T}-{\frac {1}{2}}\mu ^{2}T\}}$. The likelihood ratio term, ${\displaystyle \exp\{\mu B_{T}-{\frac {1}{2}}\mu ^{2}T\}}$, is a martingale and commonly denoted ${\displaystyle M_{T}}$. Thus, a Brownian motion with drift process (as well as many other continuous processes adapted to the Brownian filtration) is a ${\displaystyle \mathbb {P} _{\theta ^{*}}}$-martingale.^[10][11]

Siegmund's algorithm

Assume i.i.d. X's with light tailed distribution and ${\displaystyle \mathbb {E} [X]>0}$. In order to estimate ${\displaystyle \psi (c)=\mathbb {P} (\tau (c)<\infty )}$ where ${\displaystyle \tau (c)=\inf\{t:\sum \limits _{i=1}^{t}X_{i}>c\}}$, when ${\displaystyle c}$ is large and hence ${\displaystyle \psi (c)}$ small, the algorithm uses exponential tilting to derive the importance distribution. The algorithm is used in many aspects, such as sequential tests,^[12] G/G/1 queue waiting times, and ${\displaystyle \psi }$ is used as the probability of ultimate ruin in ruin theory. In this context, it is logical to ensure that ${\displaystyle \mathbb {P} _{\theta }(\tau (c)<\infty )=1}$. The criterion ${\displaystyle \theta >\theta _{0}}$, where ${\displaystyle \theta _{0}}$ is s.t. ${\displaystyle \kappa '(\theta _{0})=0}$ achieves this. Siegmund's algorithm uses ${\displaystyle \theta =\theta ^{*}}$, if it exists, where ${\displaystyle \theta ^{*}}$ is defined in the following way: ${\displaystyle \kappa (\theta ^{*})=0}$. It has been shown that ${\displaystyle \theta ^{*}}$ is the only tilting parameter producing bounded relative error (${\displaystyle {\underset {x\rightarrow \infty }{\lim \sup }}{\frac {Var\mathbb {I} _{A(x)}}{\mathbb {P} A(x)^{2}}}<\infty }$).^[13]

Black-Box algorithms

We can only see the input and output of a black box, without knowing its structure. The algorithm is to use only minimal information on its structure. When we generate random numbers, the output may not be within the same common parametric class, such as normal or exponential distributions. An automated way may be used to perform ECM. Let ${\displaystyle X_{1},X_{2},...}$be i.i.d. r.v.’s with distribution ${\displaystyle G}$; for simplicity we assume ${\displaystyle X\geq 0}$. Define ${\displaystyle {\mathfrak {F}}_{n}=\sigma (X_{1},...,X_{n},U_{1},...,U_{n})}$, where ${\displaystyle U_{1},U_{2}}$, . . . are independent (0, 1) uniforms. A randomized stopping time for ${\displaystyle X_{1},X_{2}}$, . . . is then a stopping time w.r.t. the filtration ${\displaystyle \{{\mathfrak {F}}_{n}\}}$, . . . Let further ${\displaystyle {\mathfrak {G}}}$ be a class of distributions ${\displaystyle G}$ on ${\displaystyle [0,\infty )}$ with ${\displaystyle k_{G}=\int _{0}^{\infty }e^{\theta x}G(dx)<\infty }$ and define ${\displaystyle G_{\theta }}$ by ${\displaystyle {\frac {dG_{\theta }}{dG(x)}}=e^{\theta x-k_{G}}}$. We define a black-box algorithm for ECM for the given ${\displaystyle \theta }$ and the given class ${\displaystyle {\mathfrak {G}}}$of distributions as a pair of a randomized stopping time ${\displaystyle \tau }$ and an ${\displaystyle {\mathfrak {F}}_{\tau }-}$ measurable r.v. ${\displaystyle Z}$ such that ${\displaystyle Z}$ is distributed according to ${\displaystyle G_{\theta }}$ for any ${\displaystyle G\in {\mathfrak {G}}}$. Formally, we write this as ${\displaystyle \mathbb {P} _{G}(Z<x)=G_{\theta }(x)}$ for all ${\displaystyle x}$. In other words, the rules of the game are that the algorithm may use simulated values from ${\displaystyle G}$ and additional uniforms to produce an r.v. from ${\displaystyle G_{\theta }}$.^[14]