{"url":"/task/thompson-sampling","name":"Thompson Sampling","slug":"thompson-sampling","description_markdown":"Thompson sampling, named after William R. Thompson, is a heuristic for choosing actions that addresses the exploration-exploitation dilemma in the multi-armed bandit problem. It consists of choosing the action that maximizes the expected reward with respect to a randomly drawn belief.","categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":655,"papers_with_code":135,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/multi-armed-bandits","name":"Multi-Armed Bandits"}],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":135,"tagged_in_all":655,"items":[{"url":"/paper/deep-bayesian-bandits-showdown-an-empirical","title":"Deep Bayesian Bandits Showdown: An Empirical Comparison of Bayesian Deep Networks for Thompson Sampling","date":"2018-02-26","arxiv_id":"1802.09127","repositories_listed":4,"syntology":null},{"url":"/paper/adaptive-foundation-models-for-online","title":"Scalable Exploration via Ensemble++","date":"2024-07-18","arxiv_id":"2407.13195","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_unverified":3,"n_pointer_only":8}},{"url":"/paper/dynamic-slate-recommendation-with-gated","title":"Dynamic Slate Recommendation with Gated Recurrent Units and Thompson Sampling","date":"2021-04-30","arxiv_id":"2104.15046","repositories_listed":2,"syntology":null},{"url":"/paper/neural-thompson-sampling","title":"Neural Thompson Sampling","date":"2020-10-02","arxiv_id":"2010.00827","repositories_listed":2,"syntology":{"n":7,"n_ran":6,"n_unverified":1,"n_pointer_only":7}},{"url":"/paper/meta-learning-stationary-stochastic-process","title":"Meta-Learning Stationary Stochastic Process Prediction with Convolutional Neural Processes","date":"2020-07-02","arxiv_id":"2007.01332","repositories_listed":2,"syntology":{"n":5,"n_ran":0,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/thompson-sampling-algorithms-for-mean","title":"Thompson Sampling Algorithms for Mean-Variance Bandits","date":"2020-02-01","arxiv_id":"2002.00232","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/near-optimal-oracle-efficient-algorithms-for","title":"Randomized Exploration for Non-Stationary Stochastic Linear Bandits","date":"2019-12-11","arxiv_id":"1912.05695","repositories_listed":2,"syntology":null},{"url":"/paper/adapting-multi-armed-bandits-policies-to","title":"Adapting multi-armed bandits policies to contextual bandits scenarios","date":"2018-11-11","arxiv_id":"1811.04383","repositories_listed":2,"syntology":{"n":5,"n_ran":0,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/randomized-value-functions-via-multiplicative","title":"Randomized Value Functions via Multiplicative Normalizing Flows","date":"2018-06-06","arxiv_id":"1806.02315","repositories_listed":2,"syntology":null},{"url":"/paper/a-tutorial-on-thompson-sampling","title":"A Tutorial on Thompson Sampling","date":"2017-07-07","arxiv_id":"1707.02038","repositories_listed":2,"syntology":null},{"url":"/paper/thompson-sampling-for-contextual-bandits-with","title":"Thompson Sampling for Contextual Bandits with Linear Payoffs","date":"2012-09-15","arxiv_id":"1209.3352","repositories_listed":2,"syntology":null},{"url":"/paper/representative-action-selection-for-large","title":"Representative Action Selection for Large Action-Space Meta-Bandits","date":"2025-05-23","arxiv_id":"2505.18269","repositories_listed":1,"syntology":null},{"url":"/paper/steering-generative-models-with-experimental","title":"Steering Generative Models with Experimental Data for Protein Fitness Optimization","date":"2025-05-21","arxiv_id":"2505.15093","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_unverified":3,"n_pointer_only":0}},{"url":"/paper/addressing-missing-data-issue-for-diffusion","title":"Addressing Missing Data Issue for Diffusion-based Recommendation","date":"2025-05-18","arxiv_id":"2505.12283","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_unverified":0,"n_pointer_only":3}},{"url":"/paper/dynamic-assortment-selection-and-pricing-with","title":"Dynamic Assortment Selection and Pricing with Censored Preference Feedback","date":"2025-04-03","arxiv_id":"2504.02324","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":1}},{"url":"/paper/2503-01163","title":"Bandit-Based Prompt Design Strategy Selection Improves Prompt Optimizers","date":"2025-03-03","arxiv_id":"2503.01163","repositories_listed":1,"syntology":null},{"url":"/paper/langevin-soft-actor-critic-efficient","title":"Langevin Soft Actor-Critic: Efficient Exploration through Uncertainty-Driven Critic Learning","date":"2025-01-29","arxiv_id":"2501.17827","repositories_listed":1,"syntology":{"n":11,"n_ran":6,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/fast-precise-thompson-sampling-for-bayesian","title":"Fast, Precise Thompson Sampling for Bayesian Optimization","date":"2024-11-26","arxiv_id":"2411.17071","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/sample-efficient-alignment-for-llms","title":"Sample-Efficient Alignment for LLMs","date":"2024-11-03","arxiv_id":"2411.01493","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/minimum-empirical-divergence-for-sub-gaussian","title":"Minimum Empirical Divergence for Sub-Gaussian Linear Bandits","date":"2024-10-31","arxiv_id":"2411.00229","repositories_listed":1,"syntology":null},{"url":"/paper/optimizing-posterior-samples-for-bayesian","title":"Optimizing Posterior Samples for Bayesian Optimization via Rootfinding","date":"2024-10-29","arxiv_id":"2410.22322","repositories_listed":1,"syntology":{"n":4,"n_ran":0,"n_unverified":4,"n_pointer_only":0}},{"url":"/paper/distributed-thompson-sampling-under","title":"Distributed Thompson sampling under constrained communication","date":"2024-10-21","arxiv_id":"2410.15543","repositories_listed":1,"syntology":null},{"url":"/paper/queueing-matching-bandits-with-preference","title":"Queueing Matching Bandits with Preference Feedback","date":"2024-10-14","arxiv_id":"2410.10098","repositories_listed":1,"syntology":null},{"url":"/paper/batched-bayesian-optimization-with-correlated","title":"Batched Bayesian optimization by maximizing the probability of including the optimum","date":"2024-10-08","arxiv_id":"2410.06333","repositories_listed":1,"syntology":null},{"url":"/paper/thompson-sampling-for-combinatorial-bandits","title":"Thompson Sampling For Combinatorial Bandits: Polynomial Regret and Mismatched Sampling Paradox","date":"2024-10-07","arxiv_id":"2410.05441","repositories_listed":1,"syntology":null},{"url":"/paper/improving-portfolio-optimization-results-with","title":"Improving Portfolio Optimization Results with Bandit Networks","date":"2024-10-05","arxiv_id":"2410.04217","repositories_listed":1,"syntology":null},{"url":"/paper/constructing-adversarial-examples-for","title":"Constructing Adversarial Examples for Vertical Federated Learning: Optimal Client Corruption through Multi-Armed Bandit","date":"2024-08-08","arxiv_id":"2408.04310","repositories_listed":1,"syntology":null},{"url":"/paper/2408-02960","title":"Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic","date":"2024-08-06","arxiv_id":"2408.02960","repositories_listed":1,"syntology":null},{"url":"/paper/2408-02551","title":"Process-constrained batch Bayesian approaches for yield optimization in multi-reactor systems","date":"2024-08-05","arxiv_id":"2408.02551","repositories_listed":1,"syntology":null},{"url":"/paper/more-efficient-randomized-exploration-for","title":"More Efficient Randomized Exploration for Reinforcement Learning via Approximate Sampling","date":"2024-06-18","arxiv_id":"2406.12241","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_unverified":0,"n_pointer_only":0}}],"syntology_records":13,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}