This week, at the Rmetrics conference, there has been an interesting discussion about heuristic optimization. The starting point was simple: in complex optimization problems (here we mean with a lot of local maxima, for instance), we do not ne...

Peng Yu sent me an email about the conditions for convergence of a Gibbs sampler: The following statement mentions convergence. But I’m not familiar what the regularity condition is. “But it is necessary to have a finite probability of moving away from the current state at all times in order to satisfy the regularity conditions on which

e-mails with the latest R posts.

(You will not see this message again.)