mlsanityData to 14 Oct 2026

A Scale Free Algorithm for Stochastic Bandits with Bounded Kurtosis

arXiv 1703.08937 ↗First posted 27 Mar 2017stat.MLcited by 10

Not on the map. Why?

Abstract (arXiv)

Existing strategies for finite-armed stochastic bandits mostly depend on a parameter of scale that must be known in advance. Sometimes this is in the form of a bound on the payoffs, or the knowledge of a variance or subgaussian parameter. The notable exceptions are the analysis of Gaussian bandits with unknown mean and variance by Cowan and Katehakis [2015] and of uniform distributions with unknown support [Cowan and Katehakis, 2015]. The results derived in these specialised cases are generalised here to the non-parametric setup, where the learner knows only a bound on the kurtosis of the noise, which is a scale free measure of the extremity of outliers.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). First posted on arXiv 27 Mar 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

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

10 papers.