An Improved Exact Sampling Algorithm for the Standard Normal Distribution

08/10/2020
by   Yusong Du, et al.
0

In 2016, Karney proposed an exact sampling algorithm for the standard normal distribution. In this paper, we study the computational complexity of this algorithm under the random deviate model. Specifically, Karney's algorithm requires the access to an infinite sequence of independently and uniformly random deviates over the range (0,1). We give an estimate of the expected number of uniform deviates used by this algorithm until outputting a sample value, and present an improved algorithm with lower uniform deviate consumption. The experimental results also shows that our improved algorithm has better performance than Karney's algorithm.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

09/23/2020

Sampling an Edge Uniformly in Sublinear Time

The area of sublinear algorithms have recently received a lot of attenti...
03/11/2018

Exact uniform sampling over catalan structures

We present a new framework for creating elegant algorithms for exact uni...
11/18/2020

More Informed Random Sample Consensus

Random sample consensus (RANSAC) is a robust model-fitting algorithm. It...
07/08/2021

Sampling and Counting Edges via Vertex Accesses

We consider the problems of sampling and counting edges from a graph on ...
01/04/2021

An 𝒪(n) algorithm for generating uniform random vectors in n-dimensional cones

Unbiased random vectors i.e. distributed uniformly in n-dimensional spac...
11/07/2020

Combinatorial Bernoulli Factories: Matchings, Flows and Other Polytopes

A Bernoulli factory is an algorithmic procedure for exact sampling of ce...
01/21/2015

Lazier ABC

ABC algorithms involve a large number of simulations from the model of i...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.