From Surf Wiki (app.surf) — the open knowledge base
Truncated normal distribution
Type of probability distribution
Type of probability distribution
Z = \Phi(\beta)-\Phi(\alpha) \sigma^2 \geq 0 (but see definition) a \in \mathbb{R} — minimum value of x b \in \mathbb{R} — maximum value of x (b a) -\left(\frac{\varphi(\alpha)-\varphi(\beta)}{Z}\right)^2\right]
In probability and statistics, the truncated normal distribution is the probability distribution derived from that of a normally distributed random variable by bounding the random variable from either below or above (or both). The truncated normal distribution has wide applications in statistics and econometrics.
Definitions
Suppose X has a normal distribution with mean \mu and variance \sigma^2 and lies within the interval (a,b), \text{with} ; -\infty \leq a . Then X conditional on a has a truncated normal distribution.
Its probability density function, f, for a \leq x \leq b , is given by
f(x;\mu,\sigma,a,b) = \frac{1}{\sigma},\frac{\varphi(\frac{x - \mu}{\sigma})}{\Phi(\frac{b - \mu}{\sigma}) - \Phi(\frac{a - \mu}{\sigma}) }
and by f=0 otherwise.
Here, \varphi(\xi)=\frac{1}{\sqrt{2 \pi}}\exp\left(-\frac{1}{2}\xi^2\right) is the probability density function of the standard normal distribution and \Phi(\cdot) is its cumulative distribution function \Phi(x) = \frac{1}{2} \left( 1+\operatorname{erf}(x/\sqrt{2}) \right). By definition, if b=\infty, then \Phi\left(\tfrac{b - \mu}{\sigma}\right) =1, and similarly, if a = -\infty, then \Phi\left(\tfrac{a - \mu}{\sigma}\right) = 0.
The above formulae show that when -\infty the scale parameter \sigma^2 of the truncated normal distribution is allowed to assume negative values. The parameter \sigma is in this case imaginary, but the function f is nevertheless real, positive, and normalizable. The scale parameter \sigma^2 of the untruncated normal distribution must be positive because the distribution would not be normalizable otherwise. The doubly truncated normal distribution, on the other hand, can in principle have a negative scale parameter (which is different from the variance, see summary formulae), because no such integrability problems arise on a bounded domain. In this case the distribution cannot be interpreted as an untruncated normal conditional on a , of course, but can still be interpreted as a maximum-entropy distribution with first and second moments as constraints, and has an additional peculiar feature: it presents two local maxima instead of one, located at x=a and x=b.
Properties
The truncated normal is one of two possible maximum entropy probability distributions for a fixed mean and variance constrained to the interval [a,b], the other being the truncated U. Truncated normals with fixed support form an exponential family. Nielsen reported closed-form formula for calculating the Kullback-Leibler divergence and the Bhattacharyya distance between two truncated normal distributions with the support of the first distribution nested into the support of the second distribution.
Moments
If the random variable has been truncated only from below, some probability mass has been shifted to higher values, giving a first-order stochastically dominating distribution and hence increasing the mean to a value higher than the mean \mu of the original normal distribution. Likewise, if the random variable has been truncated only from above, the truncated distribution has a mean less than \mu.
Regardless of whether the random variable is bounded above, below, or both, the truncation is a mean-preserving contraction combined with a mean-changing rigid shift, and hence the variance of the truncated distribution is less than the variance \sigma^2 of the original normal distribution.
Two sided truncation
Source:
Let \alpha = (a-\mu)/\sigma and \beta = (b-\mu)/\sigma . Then: \operatorname{E}(X \mid a and \operatorname{Var}(X \mid a -\left(\frac{\varphi(\beta) - \varphi(\alpha)}{\Phi(\beta)-\Phi(\alpha)}\right)^2\right]
Care must be taken in the numerical evaluation of these formulas, which can result in catastrophic cancellation when the interval [a,b] does not include \mu. There are better ways to rewrite them that avoid this issue.
One sided truncation (of lower tail)
Sources:
In this case ; b=\infty, ; \varphi(\beta)=0, ; \Phi(\beta)=1, then
\operatorname{E}(X \mid Xa) = \mu +\sigma \varphi(\alpha)/Z ,!
and
\operatorname{Var}(X \mid Xa) = \sigma^2[1+ \alpha \varphi(\alpha)/Z- (\varphi(\alpha)/Z)^2 ],
where Z=1-\Phi(\alpha).
One sided truncation (of upper tail)
In this case ; a=\alpha=-\infty, ; \varphi(\alpha)=0, ; \Phi(\alpha) = 0, then
\operatorname{E}(X \mid X \operatorname{Var}(X \mid X
give a simpler expression for the variance of one sided truncations. Their formula is in terms of the chi-square CDF, which is implemented in standard software libraries. provide formulas for (generalized) confidence intervals around the truncated moments.
A recursive formula
As for the non-truncated case, there is a recursive formula for the truncated moments.
In particular, for n\geq0, we have
\operatorname{E}\left[ \left(\frac{x-\mu}{\sigma}\right)^{n+2}\right]=\frac{\alpha^{n+1}\varphi(\alpha)-\beta^{n+1}\varphi(\beta)}{\Phi(\beta)-\Phi(\alpha)}+(n+1)\operatorname{E}\left[ \left(\frac{x-\mu}{\sigma}\right)^{n}\right].
Proof
By the change of variables \xi=(x-\mu)/\sigma, one obtains \operatorname{E}\left[ \left(\frac{x-\mu}{\sigma}\right)^{n+2}\right] =\int_{\alpha}^{\beta}\frac{\xi^{n+2}\varphi(\xi)}{\Phi(\beta)-\Phi(\alpha)}d\xi. Using \varphi'(\xi) = -\xi\varphi(\xi), integration by parts yields \operatorname{E}\left[ \left(\frac{x-\mu}{\sigma}\right)^{n+2}\right] =\left[\frac{-\xi^{n+1}\varphi(\xi)}{\Phi(\beta)-\Phi(\alpha)}\right]{\alpha}^{\beta}+(n+1)\int\alpha^\beta\frac{\xi^n\varphi(\xi)}{\Phi(\beta)-\Phi(\alpha)}d\xi, which gives the equation to be proven.
Multivariate
Computing the moments of a multivariate truncated normal is harder.
Generating values from the truncated normal distribution
A random variate x defined as x = \Phi^{-1}( \Phi(\alpha) + U\cdot(\Phi(\beta)-\Phi(\alpha)))\sigma + \mu with \Phi the cumulative distribution function of the normal distribution to be sampled from (i.e. with correct mean and variance) and \Phi^{-1} its inverse, U a uniform random number on (0, 1), follows the distribution truncated to the range (a, b). This is simply the inverse transform method for simulating random variables. Although one of the simplest, this method can either fail when sampling in the tail of the normal distribution, or be much too slow. Thus, in practice, one has to find alternative methods of simulation.
One such truncated normal generator (implemented in Matlab and in R (programming language) as trandn.R ) is based on an acceptance rejection idea due to Marsaglia. Despite the slightly suboptimal acceptance rate of in comparison with , Marsaglia's method is typically faster, because it does not require the costly numerical evaluation of the exponential function.
For more on simulating a draw from the truncated normal distribution, see , , . The MSM package in R has a function, rtnorm, that calculates draws from a truncated normal. The truncnorm package in R also has functions to draw from a truncated normal.
proposed (arXiv) an algorithm inspired from the Ziggurat algorithm of Marsaglia and Tsang (1984, 2000), which is usually considered as the fastest Gaussian sampler, and is also very close to Ahrens's algorithm (1995). Implementations can be found in C, C++, Matlab and Python.
Sampling from the multivariate truncated normal distribution is considerably more difficult. Exact or perfect simulation is only feasible in the case of truncation of the normal distribution to a polytope region. In more general cases, introduce a general methodology for sampling truncated densities within a Gibbs sampling framework. Their algorithm introduces one latent variable and, within a Gibbs sampling framework, it is more computationally efficient than the algorithm of .
Notes
References
- Norman L. Johnson and Samuel Kotz (1970). Continuous univariate distributions-1, chapter 13. John Wiley & Sons.
fr:Loi tronquée#Loi normale tronquée
References
- (November 11, 2002). "Lecture 4: Selection". [[Instituto Superior Técnico]].
- (September 1973). "Maximum-entropy distributions having prescribed first and second moments (Corresp.)". IEEE Transactions on Information Theory.
- (2022). "Statistical Divergences between Densities of Truncated Exponential Families with Nested Supports: Duo Bregman and Duo Jensen Divergences". MDPI.
- (1994). "Continuous Univariate Distributions". Wiley.
- Fernandez-de-Cossio-Diaz, Jorge. (2017-12-06). "TruncatedNormal.jl: Compute mean and variance of the univariate truncated normal distribution (works far from the peak)".
- Greene, William H.. (2003). "Econometric Analysis". Prentice Hall.
- (March 1994). "The singly truncated normal distribution: A non-steep exponential family". Annals of the Institute of Statistical Mathematics.
- Document by Eric Orjebin, "https://people.smp.uq.edu.au/YoniNazarathy/teaching_projects/studentWork/EricOrjebin_TruncatedNormalMoments.pdf"
- (2011). "Handbook of Monte Carlo methods". John Wiley & Sons.
- (1964). "Generating a variable from the tail of the normal distribution". Technometrics.
- (2016). "The normal law under linear restrictions: simulation and estimation via minimax tilting". Journal of the Royal Statistical Society, Series B.
- (2018). "Systems Modeling: Methodologies and Tools. EAI/Springer Innovations in Communication and Computing.". Springer, Cham.
- (22 June 2021). "The Modified-Half-Normal distribution: Properties and an efficient sampling scheme". Communications in Statistics - Theory and Methods.
This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.
Ask Mako anything about Truncated normal distribution — get instant answers, deeper analysis, and related topics.
Research with MakoFree with your Surf account
Create a free account to save articles, ask Mako questions, and organize your research.
Sign up freeThis content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.
Report