153 citations · 1.2k across the 73 of their papers we have counts for
3 papers · 1 filter
Near-optimal inference in adaptive linear regression
Koulik Khamaru, Yash Deshpande, Tor Lattimore +2
When data is collected in an adaptive manner, even simple methods like ordinary least squares can exhibit non-normal asymptotic behavior. As an undesirable consequence, hypothesis…
On Explore-Then-Commit Strategies
Aurélien Garivier, Emilie Kaufmann, Tor Lattimore
We study the problem of minimising regret in two-armed bandit problems with Gaussian rewards. Our objective is to use this simple setting to illustrate that strategies based on an…
Refined Lower Bounds for Adversarial Bandits
Sébastien Gerchinovitz, Tor Lattimore
We provide new lower bounds on the regret that must be suffered by adversarial bandit algorithms. The new results show that recent upper bounds that either (a) hold with high-proba…