Talk:Thompson sampling
This is the talk page for discussing improvements to the Thompson sampling article. This is not a forum for general discussion of the article's subject. |
Article policies
|
Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
![]() | This article has not yet been rated on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||||||||||||||
Please add the quality rating to the {{WikiProject banner shell}} template instead of this project banner. See WP:PIQA for details.
Please add the quality rating to the {{WikiProject banner shell}} template instead of this project banner. See WP:PIQA for details.
Please add the quality rating to the {{WikiProject banner shell}} template instead of this project banner. See WP:PIQA for details.
|
I would like to suggest an additional reference for the Thompson sampling page, to be added to the collection of already existing references at the end of the second history sentence, which reads: "It was subsequently rediscovered numerous times independently in the context of reinforcement learning."
The new reference pre-dates the references already given, which may make it of interest to Wikipedia readers (the new reference has date 1994, while the earliest one there now is for 1997). Our work, like the others cited, was unaware of the earlier (1933!) Thompson reference.
Because it is my own publication, I am not editing the page directly, but merely making a suggestion here that it might be of interest and worth doing. (I don't fully understand all of the Wikipedia COI guidelines, but this seems about right...)
There is a link to the publication here: (Link to Rivest-Yin paper on Simulation results for a new two-armed bandit heuristic) This is not the link I would propose to insert, but only so an editor can see the bib file and the context a bit more fully.
I do not have a link to an online copy of this article, other than the one I have posted on my own web site. A possible link to be added to the wikipedia page might look like this: Simulation Results for a new two-armed bandit heuristic. Ronald L. Rivest and Yiqun Yin. Proceedings of a workshop on Computational Learning Theory and Natural Learning Systems (Princeton, New Jersey, 1994) pp. 477--486.
Ronald L. Rivest (talk) 23:16, 5 August 2013 (UTC)
The section "Relationship to other approaches > Probability matching" just briefly describes probability matching, but doesn't in any way describe how Thompson sampling relates to it. It's quite confusing 66.29.243.106 (talk) 14:54, 8 September 2014 (UTC)
- It is my understanding that probability matching refers to the broad class of techniques where probability of optimality (or desired objective) is matched with the sample rate, while Thompson sampling refers to the Bayesian implementation (or perhaps the "randomized" implementation?) of it where one updates a prior in each round. This distinction doesn't persist in all the literature though. I don't have a good citation for discussing this relationship so I haven't made the edit to clarify. I have, however, removed the word "suboptimal" from the probability matching definition as it implies a claim that is not supported by any of the sources (and indeed some sources demonstrate that probability matching techniques can be optimal, conditional on available information). Giuseppe Burtini (talk) 14:57, 13 December 2014 (UTC)
- All unassessed articles
- Start-Class Robotics articles
- Unknown-importance Robotics articles
- WikiProject Robotics articles
- Start-Class Statistics articles
- Low-importance Statistics articles
- WikiProject Statistics articles
- Start-Class AfC articles
- AfC submissions by date/24 December 2011
- Accepted AfC submissions