mlsanityData to 14 Oct 2026

TSEC: a framework for online experimentation under experimental constraints

arXiv 2101.06592 ↗First posted 17 Jan 2021stat.ME cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Thompson sampling is a popular algorithm for solving multi-armed bandit problems, and has been applied in a wide range of applications, from website design to portfolio optimization. In such applications, however, the number of choices (or arms) N can be large, and the data needed to make adaptive decisions require expensive experimentation. One is then faced with the constraint of experimenting on only a small subset of K ll N arms within each time period, which poses a problem for traditional Thompson sampling. We propose a new Thompson Sampling under Experimental Constraints (TSEC) method, which addresses this so-called "arm budget constraint". TSEC makes use of a Bayesian interaction model with effect hierarchy priors, to model correlations between rewards on different arms. This fitted model is then integrated within Thompson sampling, to jointly identify a good subset of arms for experimentation and to allocate resources over these arms. We demonstrate the effectiveness of TSEC in two problems with arm budget constraints. The first is a simulated website optimization study, where TSEC shows noticeable improvements over industry benchmarks. The second is a portfolio optimization application on industry-based exchange-traded funds, where TSEC provides more consistent and greater wealth accumulation over standard investment strategies.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 10 of its 56 references that are in the map. First posted on arXiv 17 Jan 2021.

Builds on

10 of 56 references.

References · 10

  1. 2017A Tutorial on Thompson Samplingcited by 433
  2. 2017Minimal Exploration in Structured Stochastic Banditscited by 41
  3. 2019Multi-Armed Bandits with Correlated Armscited by 34
  4. 2015A Survey of Online Experiment Design with the Stochastic Multi-Armed Banditcited by 18
  5. 2014Bounded Regret for Finite-Armed Structured Banditscited by 15
  6. 2017Budget-Constrained Multi-Armed Bandits with Multiple Playscited by 13
  7. 2018Regional Multi-Armed Banditscited by 6
  8. 2017Practical Algorithms for Best-K Identification in Multi-Armed Banditscited by 4
  9. 2019Adaptive Portfolio by Solving Multi-armed Bandit via Thompson Samplingcited by 4
  10. 2017Analysis-of-marginal-Tail-Means (ATM): a robust method for discrete black-box optimizationcited by 3

Built on by

Not cited yet.