Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T05:58:43.712Z Has data issue: false hasContentIssue false

EXPLORATION–EXPLOITATION POLICIES WITH ALMOST SURE, ARBITRARILY SLOW GROWING ASYMPTOTIC REGRET

Published online by Cambridge University Press:  26 January 2019

Wesley Cowan
Affiliation:
Department of Computer Science, Rutgers University, Piscataway, NJ08854, USA E-mail: cwcowan@math.rutgers.edu
Michael N. Katehakis
Affiliation:
Department of Management Science and Information Systems, Rutgers University, Piscataway, NJ08854, USA E-mail: mnk@rutgers.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The purpose of this paper is to provide further understanding into the structure of the sequential allocation (“stochastic multi-armed bandit”) problem by establishing probability one finite horizon bounds and convergence rates for the sample regret associated with two simple classes of allocation policies. For any slowly increasing function g, subject to mild regularity constraints, we construct two policies (the g-Forcing, and the g-Inflated Sample Mean) that achieve a measure of regret of order O(g(n)) almost surely as n → ∞, bound from above and below. Additionally, almost sure upper and lower bounds on the remainder term are established. In the constructions herein, the function g effectively controls the “exploration” of the classical “exploration/exploitation” tradeoff.

MSC classification