Paper · 2022 · Open access
[Re] Thompson Sampling for Bandits with Clustered Arms
Zenodo (CERN European Organization for Nuclear Research) · Published 23 May 2022 · DOI 10.5281/zenodo.6574670
In brief
“[Re] Thompson Sampling for Bandits with Clustered Arms” is a 2022 paper by Andra\V{Z} De~Luisa, published in Zenodo (CERN European Organization for Nuclear Research). OpenAlex counts 0 citations as of 19 November 2026. It is open access under a CC BY licence: the full text is free to read at Zenodo (CERN European Organization for Nuclear Research).
- Citations
- 0
- References
- 9
- Authors
- 1
Abstract
Scope of ReproducibilityThis report covers our reproduction of the paper 'Thompson Sampling for Bandits with Clustered Arms' by Carlsson et al. (IJCAI 2021) [1].The authors propose a new set of algorithms for the stochastic multi-armed bandit problem (and its contextual variant with linear expected rewards) in settings when the arms are clustered.They show both theoretically and empirically that exploiting the cluster structure significantly improves the obtained regret over the traditional assumption with non-clustered arms.Furthermore, they compare the proposed algorithms to previously proposed and well-known benchmarks for the bandit problem.We aim to reproduce just the empirical evaluations. MethodologyGiven that no code was provided alongside the original paper (and neither for any of the benchmarks used for comparison), we implement everything from scratch.We write our code in R [2], the well-known programming language for statistical computing, and use some of its basic libraries.We run the experiments on a laptop with a dual-core Intel i7 processor and 8 GB of RAM.We don't use a GPU. ResultsThere are no exact numbers in the original paper to reproduce, rather the main claims are supported with some visualisations.With this in mind, our reproduction confirms the advantage provided by clustering over the assumption of independent arms, as well as the newly proposed algorithms outperforming the referenced benchmarks.We repeat all the experiments with multiple seeds to obtain robust estimates of the algorithms' performance and reduce the risk of drawing any conclusions out of results obtained by chance. What was easyThe authors have included in the paper all the necessary details to reimplement their proposed algorithms, recreate the synthetic datasets, and reproduce the experiments for the first part, i.e. the traditional multi-armed bandits setting.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
De~Luisa, A. (2022). [Re] Thompson Sampling for Bandits with Clustered Arms. Zenodo (CERN European Organization for Nuclear Research). https://doi.org/10.5281/zenodo.6574670
MLA 9
De~Luisa, Andra\V{Z}. “[Re] Thompson Sampling for Bandits with Clustered Arms.” Zenodo (CERN European Organization for Nuclear Research), 2022. https://doi.org/10.5281/zenodo.6574670.
Chicago
De~Luisa, Andra\V{Z}. 2022. “[Re] Thompson Sampling for Bandits with Clustered Arms.” Zenodo (CERN European Organization for Nuclear Research). https://doi.org/10.5281/zenodo.6574670.
Harvard
De~Luisa, A. (2022) ‘[Re] Thompson Sampling for Bandits with Clustered Arms’, Zenodo (CERN European Organization for Nuclear Research). doi:10.5281/zenodo.6574670.
IEEE
A. De~Luisa, “[Re] Thompson Sampling for Bandits with Clustered Arms,” Zenodo (CERN European Organization for Nuclear Research), 2022, doi: 10.5281/zenodo.6574670.
BibTeX
@article{deluisa2022thompson,
title = {{[Re] Thompson Sampling for Bandits with Clustered Arms}},
author = {De~Luisa, Andra\V{Z}},
journal = {Zenodo (CERN European Organization for Nuclear Research)},
year = {2022},
doi = {10.5281/zenodo.6574670},
url = {https://doi.org/10.5281/zenodo.6574670}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- Thompson sampling
- multi-armed bandits
- contextual bandits
- regret minimization
- bandit algorithms
Work with this paper
Most-cited papers in Decision Sciences
- The PRISMA 2020 statement: an updated guideline for reporting systematic reviewsMatthew James Page, Joanne E. McKenzie, Patrick M. Bossuyt and 23 more · BMJ · 2021 · 144,919 citations
- Evaluating Structural Equation Models with Unobservable Variables and Measurement ErrorClaes Fornell, David F. Larcker · Journal of Marketing Research · 1981 · 118,336 citations
- Cutoff criteria for fit indexes in covariance structure analysis: Conventional criteria versus new alternativesLi‐tze Hu, Peter M. Bentler · Structural Equation Modeling A Multidisciplinary Journal · 1999 · 117,461 citations
- Common method biases in behavioral research: A critical review of the literature and recommended remedies.Philip M. Podsakoff, SCOTT B. MACKENZIE, Jeong Yeon Lee and 1 more · Journal of Applied Psychology · 2003 · 89,248 citations
- Preferred reporting items for systematic reviews and meta-analyses: the PRISMA statementDavid Moher, Alessandro Liberati, Jennifer Tetzlaff and 2 more · BMJ · 2009 · 85,524 citations
Questions about this paper
How do I cite this paper in APA style?
De~Luisa, A. (2022). [Re] Thompson Sampling for Bandits with Clustered Arms. Zenodo (CERN European Organization for Nuclear Research). https://doi.org/10.5281/zenodo.6574670
How many times has this paper been cited?
0 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at Zenodo (CERN European Organization for Nuclear Research): sign in and open the PDF from this page.
Who wrote this paper?
Andra\V{Z} De~Luisa.
What is the DOI of this paper?
10.5281/zenodo.6574670, permanently at https://doi.org/10.5281/zenodo.6574670. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.