PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Simulating Events of Unknown Probabilities via Reverse Time Martingales.
Krzystof \L atuszy\'nski, K., Ioannis Kosmidis, Omiros Papaspiliopoulos and Gareth Roberts
Random Structures and Algorithms 2009.


Let $s\in (0,1)$ be uniquely determined but only its approximations can be obtained with a finite computational effort. Assume one aims to simulate an event of probability $s.$ Such settings are often encountered in statistical simulations. We consider two specific examples. First, the exact simulation of non-linear diffusions (\cite{BeskosRobertsEA1}). Second, the celebrated Bernoulli factory problem (\cite{KeaneOBrien}, \cite{NacuPeres}) of generating an $f(p)-$coin given a sequence $X_1, X_2,...$ of independent tosses of a $p-$coin (with known $f$ and unknown $p$). We describe a general framework and provide algorithms where this kind of problems can be fitted and solved. The algorithms are straightforward to implement and thus allow for effective simulation of desired events of probability $s.$ Our methodology links the simulation problem to existence and construction of unbiased estimators.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Computational, Information-Theoretic Learning with Statistics
Learning/Statistics & Optimisation
Theory & Algorithms
ID Code:6819
Deposited By:Omiros Papaspiliopoulos
Deposited On:08 March 2010