Browse State-of-the-Art › Thompson Sampling
Thompson Sampling
135 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28
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.
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
No dataset record in the archive lists this task.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Parent tasks archive 2025-07-28
Papers archive 2025-07-28
archive papers tagged: 655 · with a code link: 135 · where Syntology ran a sample: 30 (23 with a run with no instrument failure, 7 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (30 of 655 tagged: 23 with a run with no instrument failure, 7 where every run was a failure of Syntology's instrument)
Page 1 of 7: papers 1 to 100 of 655, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from. The first sentence of the abstract is shown for the first 30 papers; every abstract is on its paper's page.
-
26 Feb 2018 4 repositories listedAt the same time, advances in approximate Bayesian methods have made posterior approximation for flexible neural network models practical.
-
18 Jul 2024 2 repositories listed Syntology official (archive's flag): 5 ran · 5 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified (of 8 harvested samples) · 8 pointer-only (licence)Thompson Sampling is a principled method for balancing exploration and exploitation, but its real-world adoption faces computational challenges in large-scale or non-conjugate settings.
-
30 Apr 2021 2 repositories listedWe introduce a variational Bayesian Recurrent Neural Net recommender system that acts on time series of interactions between the internet platform and the user, and which scales to real world industrial situations.
-
2 Oct 2020 2 repositories listed Syntology official (archive's flag): 2 ran · 6 ran (of which 2 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified (of 7 harvested samples) · 7 pointer-only (licence)Thompson Sampling (TS) is one of the most effective algorithms for solving contextual multi-armed bandit problems.
-
2 Jul 2020 2 repositories listed Syntology official (archive's flag): 5 ran · 5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 5 harvested samples)Stationary stochastic processes (SPs) are a key component of many probabilistic models, such as those for off-the-grid spatio-temporal data.
-
1 Feb 2020 2 repositories listed Syntology 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result (of 1 harvested sample) · 1 pointer-only (licence)The multi-armed bandit (MAB) problem is a classical learning task that exemplifies the exploration-exploitation tradeoff.
-
11 Dec 2019 2 repositories listedWe investigate two perturbation approaches to overcome conservatism that optimism based algorithms chronically suffer from in practice.
-
11 Nov 2018 2 repositories listed Syntology official: harvested, nothing ran · 0 ran · 5 unverified (of 5 harvested samples)This work explores adaptations of successful multi-armed bandits policies to the online contextual bandits scenario with binary rewards using binary classification algorithms such as logistic regression as black-box…
-
6 Jun 2018 2 repositories listedIn particular, we augment DQN and DDPG with multiplicative normalizing flows in order to track a rich approximate posterior distribution over the parameters of the value function.
-
7 Jul 2017 2 repositories listedThompson sampling is an algorithm for online decision problems where actions are taken sequentially in a manner that must balance between exploiting what is known to maximize immediate performance and investing to…
-
15 Sep 2012 2 repositories listedThompson Sampling is one of the oldest heuristics for multi-armed bandit problems.
-
23 May 2025 1 repository listedWe study the problem of selecting a subset from a large action space shared by a family of bandits, with the goal of achieving performance nearly matching that of using the full action space.
-
21 May 2025 1 repository listed Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples)Protein fitness optimization involves finding a protein sequence that maximizes desired quantitative properties in a combinatorially large design space of possible sequences.
-
18 May 2025 1 repository listed Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples) · 3 pointer-only (licence)To preserve user preference evolution in sequences despite extra missing data, we introduce Dual-side Thompson Sampling to implement simulation with two probability models, sampling by exploiting user preference from…
-
3 Apr 2025 1 repository listed Syntology official: harvested, nothing ran · 0 ran · 1 unverified (of 1 harvested sample) · 1 pointer-only (licence)In this study, we investigate the problem of dynamic multi-product selection and pricing by introducing a novel framework based on a censored multinomial logit (C-MNL) choice model.
-
3 Mar 2025 1 repository listedOur results show that the selection of prompt design strategies improves the performance of EvoPrompt, and the Thompson sampling-based mechanism achieves the best overall results.
-
29 Jan 2025 1 repository listed Syntology official (archive's flag): 6 ran · 6 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified (of 11 harvested samples)Existing actor-critic algorithms, which are popular for continuous control reinforcement learning (RL) tasks, suffer from poor sample efficiency due to lack of principled exploration mechanism within them.
-
26 Nov 2024 1 repository listed Syntology 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result (of 2 harvested samples)Thompson sampling (TS) has optimal regret and excellent empirical performance in multi-armed bandit problems.
-
3 Nov 2024 1 repository listed Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples)The results demonstrate that SEA achieves highly sample-efficient alignment with oracle's preferences, outperforming recent active exploration methods for LLMs.
-
31 Oct 2024 1 repository listedWe propose a novel linear bandit algorithm called LinMED (Linear Minimum Empirical Divergence), which is a linear extension of the MED algorithm that was originally designed for multi-armed bandits.
-
29 Oct 2024 1 repository listed Syntology official (archive's flag): 4 ran · 4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 4 harvested samples)Bayesian optimization devolves the global optimization of a costly objective function to the global optimization of a sequence of acquisition functions.
-
21 Oct 2024 1 repository listedWe apply distributed Thompson sampling, using a Gaussian process as a surrogate model, to approach the multi-agent Bayesian optimization problem.
-
14 Oct 2024 1 repository listedIn this study, we consider multi-class multi-server asymmetric queueing systems consisting of N queues on one side and K servers on the other side, where jobs randomly arrive in queues at each time.
-
8 Oct 2024 1 repository listedExisting acquisition strategies for batch design in BO aim to balance exploration and exploitation.
-
7 Oct 2024 1 repository listedWe consider Thompson Sampling (TS) for linear combinatorial semi-bandits and subgaussian rewards.
-
5 Oct 2024 1 repository listedWe then extend this approach to the Portfolio Optimization problem by introducing the Combinatorial Adaptive Discounted Thompson Sampling (CADTS) algorithm, which addresses computational challenges within Combinatorial…
-
8 Aug 2024 1 repository listedVertical federated learning (VFL), where each participating client holds a subset of data features, has found numerous applications in finance, healthcare, and IoT systems.
-
6 Aug 2024 1 repository listedAnytime multi-agent path finding (MAPF) is a promising approach to scalable path optimization in multi-agent systems.
-
5 Aug 2024 1 repository listedThis work proposes a novel approach to optimize the yield of a reaction in a multi-reactor system, marking a significant step forward in digital catalysis and generally in optimization methods for chemical engineering.
-
18 Jun 2024 1 repository listed Syntology official (archive's flag): 4 ran · 4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 4 harvested samples)Empirically, we show that in tasks where deep exploration is necessary, our proposed algorithms that combine FGTS and approximate sampling perform significantly better compared to other strong baselines.
-
4 Jun 2024 1 repository listed
-
26 May 2024 1 repository listed
-
7 May 2024 1 repository listed
-
9 Apr 2024 1 repository listed Syntology official: harvested, nothing ran · 0 ran · 3 unverified (of 3 harvested samples)
-
22 Jan 2024 1 repository listed Syntology official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 2 harvested samples)
-
28 Dec 2023 1 repository listed
-
24 Dec 2023 1 repository listed
-
11 Dec 2023 1 repository listed
-
16 Nov 2023 1 repository listed
-
24 Oct 2023 1 repository listed
-
13 Oct 2023 1 repository listed
-
12 Oct 2023 1 repository listed Syntology official (archive's flag): 5 ran · 5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 5 harvested samples) · 5 pointer-only (licence)
-
28 Aug 2023 1 repository listed
-
21 Aug 2023 1 repository listed
-
19 Jul 2023 1 repository listed
-
2 Jun 2023 1 repository listed
-
29 May 2023 1 repository listed Syntology official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified (of 2 harvested samples)
-
6 May 2023 1 repository listed
-
5 May 2023 1 repository listed
-
28 Apr 2023 1 repository listed Syntology official (archive's flag): 4 ran · 4 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 4 harvested samples)
-
18 Feb 2023 1 repository listed
-
24 Jan 2023 1 repository listed Syntology official: harvested, nothing ran · 0 ran · 3 unverified (of 3 harvested samples) · 3 pointer-only (licence)
-
19 Jan 2023 1 repository listed
-
10 Dec 2022 1 repository listed
-
11 Nov 2022 1 repository listed
-
30 Oct 2022 1 repository listed
-
26 Oct 2022 1 repository listed
-
13 Oct 2022 1 repository listed Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample)
-
26 Aug 2022 1 repository listed
-
30 Jun 2022 1 repository listed
-
22 Jun 2022 1 repository listed Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample) · 1 pointer-only (licence)
-
17 Jun 2022 1 repository listed Syntology official (archive's flag): 2 ran · 2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result (of 2 harvested samples)
-
14 Jun 2022 1 repository listed
-
30 May 2022 1 repository listed Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples)
-
24 May 2022 1 repository listed
-
26 Apr 2022 1 repository listed
-
26 Apr 2022 1 repository listed
-
24 Mar 2022 1 repository listed
-
2 Mar 2022 1 repository listed
-
7 Feb 2022 1 repository listed
-
4 Feb 2022 1 repository listed
-
31 Jan 2022 1 repository listed
-
31 Jan 2022 1 repository listed
-
27 Jan 2022 1 repository listed Syntology official (archive's flag): 5 ran · 5 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified (of 5 harvested samples) · 5 pointer-only (licence)
-
2 Dec 2021 1 repository listed Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified (of 2 harvested samples) · 2 pointer-only (licence)
-
1 Dec 2021 1 repository listed
-
26 Nov 2021 1 repository listed
-
19 Oct 2021 1 repository listed
-
7 Oct 2021 1 repository listed
-
21 Sep 2021 1 repository listed
-
13 Sep 2021 1 repository listed
-
25 Aug 2021 1 repository listed
-
10 May 2021 1 repository listed
-
2 Mar 2021 1 repository listed
-
28 Feb 2021 1 repository listed
-
10 Feb 2021 1 repository listed
-
7 Feb 2021 1 repository listed
-
21 Jan 2021 1 repository listed
-
19 Jan 2021 1 repository listed
-
22 Dec 2020 1 repository listed
-
14 Dec 2020 1 repository listed Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample) · 1 pointer-only (licence)
-
10 Dec 2020 1 repository listed
-
9 Nov 2020 1 repository listed
-
3 Nov 2020 1 repository listed
-
27 Oct 2020 1 repository listed Syntology official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 2 harvested samples) · 2 pointer-only (licence)
-
20 Oct 2020 1 repository listed
-
20 Oct 2020 1 repository listed
-
15 Oct 2020 1 repository listed
-
23 May 2020 1 repository listed
-
20 Apr 2020 1 repository listed
Syntology lines on 27 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections