mlsanityData to 14 Oct 2026

Thresholding Bandit for Dose-ranging: The Impact of Monotonicity

arXiv 1711.04454 ↗First posted 13 Nov 2017math.ST stat.ML stat.THcited by 16

Not on the map. Why?

Abstract (arXiv)

We analyze the sample complexity of the thresholding bandit problem, with and without the assumption that the mean values of the arms are increasing. In each case, we provide a lower bound valid for any risk δ and any δ-correct algorithm; in addition, we propose an algorithm whose sample complexity is of the same order of magnitude for small risks. This work is motivated by phase 1 clinical trials, a practically important setting where the arm means are increasing by nature, and where no satisfactory solution is available so far.

Key facts. Cited by 16 papers in the map (data through 14 Oct 2026). First posted on arXiv 13 Nov 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 5; 2022: 1; 2023: 3; 2024: 2; 2025: 4; 2026: 1.

16 papers.

Sort:

By area: