2 problems

Let $\mathcal{A}$ be a generic bandit algorithm, and let $\mathcal{A}'$ be its non-restarting doubling-trick version, which reinitializes the algorithm at successive horizons while…

Let an anytime algorithm be constructed from a non-anytime algorithm by applying a doubling trick. A geometric doubling sequence is known not to preserve the relevant problem-depen…