mlsanityData to 14 Oct 2026

Regression Oracles and Exploration Strategies for Short-Horizon Multi-Armed Bandits

arXiv 2102.05263 ↗First posted 10 Feb 2021cs.LG cs.AI stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

This paper explores multi-armed bandit (MAB) strategies in very short horizon scenarios, i.e., when the bandit strategy is only allowed very few interactions with the environment. This is an understudied setting in the MAB literature with many applications in the context of games, such as player modeling. Specifically, we pursue three different ideas. First, we explore the use of regression oracles, which replace the simple average used in strategies such as epsilon-greedy with linear regression models. Second, we examine different exploration patterns such as forced exploration phases. Finally, we introduce a new variant of the UCB1 strategy called UCBT that has interesting properties and no tunable parameters. We present experimental results in a domain motivated by exergames, where the goal is to maximize a player's daily steps. Our results show that the combination of epsilon-greedy or epsilon-decreasing with regression oracles outperforms all other tested strategies in the short horizon setting.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 2 of its 23 references that are in the map. First posted on arXiv 10 Feb 2021.

Builds on

2 of 23 references.

References · 2

  1. 2014Optimal Exploration-Exploitation in a Multi-Armed-Bandit Problem with Non-stationary Rewardscited by 42
  2. 2020Rapidly Personalizing Mobile Health Treatment Policies with Limited Datacited by 4

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.