Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Thompson sampling

Machine Learning Algorithm

Thompson sampling is a heuristic for choosing actions that addresses the exploration-exploitation dilemma in the multi-armed bandit problem, where a decision maker must repeatedly pick among options whose rewards are uncertain. It is named after William Rae Thompson. At each step the method holds a belief about how rewarding each action is, draws one random sample from that belief, and then picks the action that maximizes the expected reward under the drawn sample. Actions that look promising are therefore chosen often, while uncertain actions still receive occasional trials because a random draw can favor them. As observations accumulate the belief narrows and the choices concentrate on the best action. The idea is applied in online decision problems such as choosing among competing options while learning from feedback.

Connections

Credited To

Source Thompson sampling (Wikipedia)

In Field

Source William Rae Thompson (Wikipedia)

Invented

Source William Rae Thompson (Wikipedia)

Uses Design Technique

Heuristics, Concepts
Source Thompson sampling (Wikipedia)
Source Thompson sampling (Wikipedia)
Sources
Thompson sampling (Wikipedia)
  • In Group: Reinforcement Learning and Bandit Algorithms, Lead paragraph
    in the multi-armed bandit problem
  • Uses Design Technique: Heuristics, Lead paragraph
    is a heuristic for choosing actions
  • Uses Design Technique: Randomized Algorithms, Lead paragraph [design-technique-used]
    with respect to a randomly drawn belief
  • Credited To: William Rae Thompson, Lead paragraph
    named after William Rae Thompson
View the Source
William Rae Thompson (Wikipedia)
  • Invented: William Rae Thompson, Lead paragraph
    best known for inventing Thompson sampling
  • In Field: Machine Learning, Lead paragraph [in-field]
    a foundational heuristic in machine learning and reinforcement learning
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.