Publications by xi'an
nlm [unused argument(s) (iter = 1)]
Ashley put the following comment on Chapter 5 of Introducing Monte Carlo Methods with R”: I am reading chapter 5. I try to reproduced the result on page 128. The R codes don’t work on my laptop. When I try to run the following codes on page 128 > for (i in 1:(nlm(like,sta)$it)){ + mmu=rbind(mmu,nlm(like,sta,iter=i)$est)} I always get the er...
1540 sym R (455 sym/4 pcs) 16 img
More typos in Chapter 5
Following Ashley’s latest comments on Chapter 5 of Introducing Monte Carlo Methods with R, I realised Example 5.5 was totally off-the-mark! Not only the representation of the likelihood should have used prod instead of mean, not only the constant should call the val argument of integrate, not only integrate uses lower and upper rather than fr...
1454 sym R (370 sym/1 pcs) 20 img
Le Monde puzzle [52]
The last puzzle of the year in Le Monde reads as follows (as far as I understand its wording!): Iter(n,x,y) is the function Iter=function(n,x,y){ if (n==1){ output=trunc(y/10)+x*(y%%10) }else{ output=Iter(n-1,x,Iter(1,x,y))} return output } Find the seven-digit number z such that Iter(6,1,z)=12, Iter(6,2,z)=19, Iter(6,3,z)=29, and Iter(6...
2221 sym R (1330 sym/3 pcs) 16 img
History makes Stat. Science!
While the above heading sounds like a title in reverse, its words are in the “correct” order in that our paper with George Casella, A Short History of Markov Chain Monte Carlo, has been accepted for publication by Statistical Science. This publication may sound weird when considering that the paper is also scheduled to appear in the Handbook ...
1623 sym 18 img
Le Monde puzzle [52|solution]
I have now received the first issue of Le Monde magazine, including the solution to puzzle #52 I solved just in time by simulated annealing! The trick is in using the following theorem: Iter(1,x,y) is divisible by 10x-1 if and only if y is divisible by 10x-1. Then the value to be found is divisible by 3, but not by 9, by 19, by 29, by 11, by 3 an...
1190 sym 18 img
Adap’skiii [day 2]
Another exciting day at Adap’skiii!!! Yves Atchadé presented a very recent work on the fundamental issue of estimating the asymptotic variance estimation for adaptive MCMC algorithms, with an intriguing experimental observation that a non-converging bandwidth with rate 1/n was providing better coverage than the converging rate. (I always found...
2891 sym 18 img
Short review of the R book
David Scott wrote a review of Introducing Monte Carlo Methods with R in the International Statistical Review that is rather negative, since the main bulk reads as follows: I found some aspects of the book very disappointing. The first chapter (“Basic R Programming”) has some unfortunate mistakes and some statements, which are contentious at ...
1976 sym 18 img
a survey on ABC
With Jean-Michel Marin, Pierre Pudlo and Robin Ryder, we just completed a survey on the ABC methodology. It is now both arXived and submitted to Statistics and Computing. Rather interestingly, our first draft was written in Jean-Michel’s office in Montpelier by collating the ‘Og posts surveying new ABC papers! (Interestingly because this mean...
1304 sym 20 img
Arrogance sampling
A new posting on arXiv by Benedict Escoto on a simulation method for approximating normalising constants (i.e. evidence) with an eye-catching name! Here is the abstract This paper describes a method for estimating the marginal likelihood or Bayes factors of Bayesian models using non-parametric importance sampling (“arrogance sampling”). This...
2497 sym 24 img
Le Monde puzzle [1]
Following the presentation of the first Le Monde puzzle of the year, I tried a simulated annealing solution on an early morning in my hotel room. Here is the R code, which is unfortunately too rudimentary and too slow to be able to tackle n=1000. #minimise sum_{i=1}^I x_i #for 1le x_ile 2n+1, 1e ile I # Ige n, x_i ne x_j # a=x_i,b=x_j...
877 sym R (1122 sym/1 pcs) 16 img