Talk:Multiple-try Metropolis
Add topicLatest comment: 12 years ago by Jorgecarleitao in topic Notability
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Introduction
[edit]I created this page 3 May 2008, in the hope that it proves useful to someone :) The MTM method certainly has for me. Velocidex (talk) 02:45, 3 May 2008 (UTC)
Lack of references
[edit]I think this article needs more references. One reference is clearly not enough for proving both wikipedia:notability and everything is said in the original article.
Notability
[edit]The lead paragraph needs to explain the notability of this algorithm, see Wikipedia:Lead section. For example, are there any situations where it outperforms (in time, not "steps") other sampling algorithms?Matt Cook (talk) 10:46, 1 February 2014 (UTC)
- thanks for the addition Matt Cook. I re-read the article and I'm sceptical that this algorithm deserves a wiki entry. However, it provides interesting points on continuous spaces, something that is lacking in Metropolis–Hastings algorithm.Jorgecarleitao (talk) 10:41, 3 February 2014 (UTC)