Paper · 2017 · Open access
Memory Bandits: a Bayesian approach for the Switching Bandit Problem
HAL · Published 4 December 2017
In brief
“Memory Bandits: a Bayesian approach for the Switching Bandit Problem” is a 2017 paper by Réda Alami and 2 co-authors, published in HAL. OpenAlex counts 23 citations as of 19 November 2026. It is open access: the full text is free to read at HAL.
- Citations
- 23
- Most cited in
- 2021 (4)
- Field-weighted impact
- 1.97
- References
- 16
- Authors
- 3
Abstract
The Thompson Sampling exhibits excellent results in practice and it has been shown to be asymptotically optimal. The extension of Thompson Sampling algorithm to the Switching Multi-Armed Bandit problem, proposed in [13], is a Thompson Sampling equiped with a Bayesian online change point detector [1]. In this paper, we propose another extension of this approach based on a Bayesian aggregation framework. Experiments provide some evidences that in practice, the proposed algorithm compares favorably with the previous version of Thompson Sampling for the Switching Multi-Armed Bandit Problem, while it outperforms clearly other algorithms of the state-of-the-art.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Alami, R., Maillard, O.-A., & Féraud, R. (2017). Memory Bandits: a Bayesian approach for the Switching Bandit Problem. HAL. https://hal.science/hal-01811697
MLA 9
Alami, Réda, et al. “Memory Bandits: a Bayesian approach for the Switching Bandit Problem.” HAL, 2017. https://hal.science/hal-01811697.
Chicago
Alami, Réda, Odalric-Ambrym Maillard, and Raphaël Féraud. 2017. “Memory Bandits: a Bayesian approach for the Switching Bandit Problem.” HAL. https://hal.science/hal-01811697.
Harvard
Alami, R., Maillard, O.-A. and Féraud, R. (2017) ‘Memory Bandits: a Bayesian approach for the Switching Bandit Problem’, HAL. Available at: https://hal.science/hal-01811697.
IEEE
R. Alami, O.-A. Maillard, and R. Féraud, “Memory Bandits: a Bayesian approach for the Switching Bandit Problem,” HAL, 2017.
BibTeX
@article{alami2017memory,
title = {{Memory Bandits: a Bayesian approach for the Switching Bandit Problem}},
author = {Alami, Réda and Maillard, Odalric-Ambrym and Féraud, Raphaël},
journal = {HAL},
year = {2017},
url = {https://hal.science/hal-01811697}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2018 | 2 | |
| 2019 | 3 | |
| 2021 | 4 | |
| 2022 | 4 | |
| 2023 | 2 | |
| 2024 | 4 | |
| 2025 | 3 | |
| 2026 | 1 |
Its field-weighted citation impact is 1.97: it has been cited 1.97 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- Thompson sampling
- Bayesian online change point detection
- Bayesian aggregation
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?
Alami, R., Maillard, O.-A., & Féraud, R. (2017). Memory Bandits: a Bayesian approach for the Switching Bandit Problem. HAL. https://hal.science/hal-01811697
How many times has this paper been cited?
23 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 HAL: sign in and open the PDF from this page.
Who wrote this paper?
Réda Alami, Odalric-Ambrym Maillard, Raphaël Féraud.
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.