## Vanilla Rao-Blackwellisation [re]revised

**A**lthough the revision is quite minor, it took us two months to complete from the time I received the news in the Atlanta airport lounge… The vanilla Rao-Blackwellisation paper with Randal Douc has thus been resubmitted to the * Annals of Statistics*. And rearXived. The only significant change is the inclusion of two tables detailing computing time, like the one below

which provides different evaluations of the additional computing effort due to the use of the Rao–Blackwellisation: median and mean numbers of additional iterations, $80\%$ and $90\%$ quantiles for the additional iterations, and ratio of the average R computing times obtained over $10^5$ simulations. (Turning the above table into a formula acceptable by WordPress took me for ever, as any additional white space between the terms of the matrix is mis-interpreted!) Now, the mean time column does not look very supportive of the Rao-Blackwellisation technique, but this is due to the presence of a few outlying runs that required many iterations before hitting an acceptance probability of one. Excessive computing time can be curbed by using a pre-set number of iterations, as described in the paper…

June 13, 2010 at 10:09 am

[…] Rao-Blackwellisation accepted The revision of our Vanilla Rao-Blackwellisation paper has been accepted by the Annals of Statistics as I was […]

June 2, 2010 at 6:58 pm

Even with 4 points each, graphs would be better. See my 2002 American Statistician paper for examples.

June 1, 2010 at 9:55 am

X: You should never do tables, only graphs. In this case, that tau on the left column can be on your x-axis.

June 1, 2010 at 5:53 pm

Naah… The graphs would only have 4 points each..!