Paper · 2019 · Open access

A simple dynamic bandit algorithm for hyper-parameter tuning

Xuedong Shang, Emilie Kaufmann, Michal Valko

HAL · Published 14 June 2019

Open full textCite this paper

In brief

“A simple dynamic bandit algorithm for hyper-parameter tuning” is a 2019 paper by Xuedong Shang and 2 co-authors, published in HAL. OpenAlex counts 14 citations as of 19 November 2026. It is open access: the full text is free to read at HAL.

Citations
14
Most cited in
2020 (3)
Field-weighted impact
2.86
References
22
Authors
3

Abstract

Hyper-parameter tuning is a major part of modern machine learning systems.The tuning itself can be seen as a sequential resource allocation problem.As such, methods for multi-armed bandits have been already applied.In this paper, we view hyper-parameter optimization as an instance of best-arm identification in infinitely many-armed bandits.We propose D-TTTS, a new adaptive algorithm inspired by Thompson sampling, which dynamically balances between refining the estimate of the quality of hyper-parameter configurations previously explored and adding new hyper-parameter configurations to the pool of candidates.The algorithm is easy to implement and shows competitive performance compared to state-of-the-art algorithms for hyper-parameter tuning.1.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Shang, X., Kaufmann, E., & Valko, M. (2019). A simple dynamic bandit algorithm for hyper-parameter tuning. HAL. https://inria.hal.science/hal-02145200

MLA 9

Shang, Xuedong, et al. “A simple dynamic bandit algorithm for hyper-parameter tuning.” HAL, 2019. https://inria.hal.science/hal-02145200.

Chicago

Shang, Xuedong, Emilie Kaufmann, and Michal Valko. 2019. “A simple dynamic bandit algorithm for hyper-parameter tuning.” HAL. https://inria.hal.science/hal-02145200.

Harvard

Shang, X., Kaufmann, E. and Valko, M. (2019) ‘A simple dynamic bandit algorithm for hyper-parameter tuning’, HAL. Available at: https://inria.hal.science/hal-02145200.

IEEE

X. Shang, E. Kaufmann, and M. Valko, “A simple dynamic bandit algorithm for hyper-parameter tuning,” HAL, 2019.

BibTeX

@article{shang2019simple,
  title     = {{A simple dynamic bandit algorithm for hyper-parameter tuning}},
  author    = {Shang, Xuedong and Kaufmann, Emilie and Valko, Michal},
  journal   = {HAL},
  year      = {2019},
  url       = {https://inria.hal.science/hal-02145200}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
201911
202033
202133
202211
202422
202533
202611

Its field-weighted citation impact is 2.86: it has been cited 2.86 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

  • hyperparameter optimization
  • multi-armed bandits
  • best arm identification
  • Thompson sampling
  • adaptive algorithms
  • sequential resource allocation

Work with this paper

Most-cited papers in Decision Sciences

All highly cited Decision Sciences papers

Questions about this paper

How do I cite this paper in APA style?

Shang, X., Kaufmann, E., & Valko, M. (2019). A simple dynamic bandit algorithm for hyper-parameter tuning. HAL. https://inria.hal.science/hal-02145200

How many times has this paper been cited?

14 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 full text from this page.

Who wrote this paper?

Xuedong Shang, Emilie Kaufmann, Michal Valko.

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.