Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds

Arda Güçlü, Subhonmesh Bose

We propose and analyze TRAiL (Tangential Randomization in Linear Bandits), a computationally efficient regret-optimal forced exploration algorithm for linear bandits on action sets…