Search Results for author:
Found 2 papers, 0 papers with code
Fractal structures in Adversarial Prediction
In this work we study how "fractal-like" processes arise in a prediction game where an adversary is generating a sequence of bits and an algorithm is trying to predict them.
Optimal amortized regret in every interval
In this paper we show a randomized algorithm that in an amortized sense gets a regret of $O(\sqrt x)$ for any interval when the sequence is partitioned into intervals arbitrarily.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
