Greedy Poisson Rejection Sampling: An Efficient Algorithm for One-Shot Channel Simulation
Greedy Poisson rejection sampling (GPRS) is a new rejection sampling algorithm that can efficiently simulate samples from a target distribution Q using a proposal distribution P. GPRS achieves optimal average runtime and codelength for one-dimensional channel simulation problems where the target-proposal density ratio is unimodal.