**Xi'an's Og » R**, and kindly contributed to R-bloggers)

**A** recent arXiv posting of the paper “On the Generalized Ratio of Uniforms as a Combination of Transformed Rejection and Extended Inverse of Density Sampling” by Martino, Luengo, and Míguez from Madrid rekindled my interest in this rather peculiar simulation method. The ratio of uniforms samples uniformly on the subgraph

to produce simulations from *p* as the ratio *v/u*. The proof is straightforward first year calculus but I do not find the method intuitive as, say, accept/reject…. The paper gives a very detailed background on those methods, as well as on the “inverse of density method”, which is like looking at the uniform simulation over the subgraph, but with both axes inverted (slice sampling is the same on both). *(A minor point of contention or at least misunderstanding: when using the inverse of density method, the authors claim that using the unormalised and the normalised versions of the target leads to the same outcome. While it is true for the direct method, I have trouble seeing the equivalent in the inverse case…)* The paper also stresses that the optimal case for accept-reject is when the target is bounded *because the uniform can then be used as a proposal*. I agree this is a simpler solution but fail to see any optimality in the matter. The authors then study ways of transforming unbounded subgraphs into bounded domains (i.e. *bounded* pdfs *and* supports). This imposes conditions on the transform *f*, which must have finite limits for *p(x)/f’(x)* or *p ^{-1}(x)/f’(x)* at the boundaries. (An optimal choice is when

*f*is the cdf of

*p*, since then the transform is uniform.)

**T**he remainder (and more innovative) part of the paper is less clear in that I do not get a generic feeling on what it is about! The generalisation of the above is to consider uniform sampling from

for a generic increasing function *g* such that *g*(0)=0. And *c* a positive constant. *(Any positive constant?!)* But this is from a 1991 paper by Jon Wakefield, Alan Gelfand, and Adrian Smith. The extension is thus in finding *g* such that the above region is bounded and can be explored by uniform sampling over a box.. And in noticing that “*the generalized Ratio-of-Uniform method is a combination of the transformed rejection method applied to the inverse density with the extended inverse-of-density method*” (p.27).

**I** wonder at the applicability of the approach for costly target functions *p*. And at the extension to larger dimensions. And wish I had more time (or more graduate students) to look at possible adaptive constructions of the transform *g*. An interesting and fruitful read, nonetheless!

Filed under: R, Statistics, University life Tagged: accept-reject algorithm, inverse density algorithm, Madrid, ratio of uniform algorithm

**leave a comment**for the author, please follow the link and comment on their blog:

**Xi'an's Og » R**.

R-bloggers.com offers

**daily e-mail updates**about R news and tutorials on topics such as: Data science, Big Data, R jobs, visualization (ggplot2, Boxplots, maps, animation), programming (RStudio, Sweave, LaTeX, SQL, Eclipse, git, hadoop, Web Scraping) statistics (regression, PCA, time series, trading) and more...