Simulation from the Normal Distribution Truncated to an Interval in the Tail

@inproceedings{Botev2016SimulationFT,
  title={Simulation from the Normal Distribution Truncated to an Interval in the Tail},
  author={Zdravko I. Botev and Pierre L'Ecuyer},
  booktitle={ValueTools},
  year={2016}
}
We study and compare various methods to generate a random variate from the normal distribution truncated to some finite or semi-infinite interval, with special attention to the situation where the interval is far in the tail. This is required in particular for certain applications in Bayesian statistics, such as to perform exact posterior simulations for parameter inference, but could have many other applications as well. We distinguish the case in which inversion is warranted, and that in… 

Figures and Tables from this paper

Simulation from the Tail of the Univariate and Multivariate Normal Distribution

We study and compare various methods to generate a random variate or vector from the univariate or multivariate normal distribution truncated to some finite or semi-infinite region, with special

Sampling Conditionally on a Rare Event via Generalized Splitting

The main finding is that the approximation error depends crucially on the relative variability of the number of points produced by the splitting algorithm in one run, and that this relative variability can be readily estimated via simulation.

EXACT POSTERIOR SIMULATION FROM THE LINEAR LASSO REGRESSION

This paper constructs a method that yields an independent and identically distributed (iid) draws from the LASSO posterior that works well when the dimension of the parameter space is not too large, and when it is too large to permit exact sampling, the proposed method can still be used to construct an approximate MCMC sampler.

EXACT POSTERIOR SIMULATION FROM THE LINEAR LASSO REGRESSION

This paper constructs a method that yields an independent and identically distributed (iid) draws from the LASSO posterior that works well when the dimension of the parameter space is not too large, and when it is too large to permit exact sampling, the proposed method can still be used to construct an approximate MCMC sampler.

A Generalized Transformed Density Rejection Algorithm

A new method that works for arbitrary one time continuously differentiable densities, there is no necessity to compute and implement the second derivative of the (log-) density, and can also generate random variates from truncated distributions without problems.

Contributions to Likelihood-Based Modelling of Extreme Values

Extreme value analysis is concerned with the modelling of extreme events such as floods and heatwaves, which can have large impacts. Statistical modelling can be useful to better assess risks even

Robust discrete choice models with t-distributed kernel errors

Outliers in discrete choice response data may result from misclassification and misreporting of the response variable and from choice behaviour that is inconsistent with modelling assumptions (e.g.

Counterfactual-based minority oversampling for imbalanced classification

This framework introduces a counterfactual objective by leveraging the rich inherent information of majority classes and explicitly perturbing majority samples to generate new samples in the territory of minority space.

Counterfactual-based minority oversampling for imbalanced classification

This framework introduces a counterfactual objective by leveraging the rich inherent information of majority classes and explicitly perturbing majority samples to generate new samples in the territory of minority space.

References

SHOWING 1-10 OF 26 REFERENCES

Fast simulation of truncated Gaussian distributions

  • N. Chopin
  • Computer Science, Mathematics
    Stat. Comput.
  • 2011
This work designs a table-based algorithm that is computationally faster than alternative algorithms and an accept-reject algorithm for simulating a Gaussian vector X, conditional on the fact that each component of X belongs to a finite interval, or a semi-finite interval.

The normal law under linear restrictions: simulation and estimation via minimax tilting

Simulation from the truncated multivariate normal distribution in high dimensions is a recurrent problem in statistical computing and is typically only feasible by using approximate Markov chain

Efficient probability estimation and simulation of the truncated multivariate student-t distribution

An exponential tilting method for the accurate estimation of the probability that a random vector with multivariate student-t distribution falls in a convex polytope is proposed, providing an alternative to approximate Markov Chain Monte Carlo simulation.

Efficient estimation and simulation of the truncated multivariate student-\(t\) distribution

We propose an exponential tilting method for exact simulation from the truncated multivariate student-t distribution in high dimensions as an alternative to approximate Markov Chain Monte Carlo

Automatic Nonuniform Random Variate Generation

It is shown how random variate genration algorithms work and an interface for R is suggested as an example of a statistical library, which could be used for simulation or statistical computing.

Efficient Simulation from the Multivariate Normal and Student-t Distributions Subject to Linear Constraints and the Evaluation of Constraint Probabilities

It is shown how the accuracy and convergence of integrals based on the Gibbs sample may be constructed, and how an estimate of the probability of the constraint set under the unrestricted distribution may be produced.

Non-Uniform Random Variate Generation

This chapter reviews the main methods for generating random variables, vectors and processes in non-uniform random variate generation, and provides information on the expected time complexity of various algorithms before addressing modern topics such as indirectly specified distributions, random processes, and Markov chain methods.

Variance Reduction's Greatest Hits

A guided tour of five different methods that can make a huge difference in the accuracy of simulation estimators, which can reduce the variance (or improve the efficiency) by an arbitrary large factor.

Quasi-Monte Carlo methods with applications in finance

We review the basic principles of quasi-Monte Carlo (QMC) methods, the randomizations that turn them into variance-reduction techniques, the integration error and variance bounds obtained in terms of