AI Paper Atlas

Research map / Bandits and online learning / Online convex optimization and games

Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits

Julian Zimmert, Yevgeny Seldin

JMLR 2021 · Bandits and online learning › Online convex optimization and games · approach: Best-of-both-worlds bandit algorithms

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use RV loss estimators instead of IW estimators in Tsallis-INFTsallis-INF (alpha=1/2) · Stochastic bandits (simulation)pseudo-regretImproved
Tsallis-INF with RV estimators compared to UCB1, Exp3, Exp3++, BroadTsallis-INF · Stochastic bandits (simulation)pseudo-regretImproved
Tsallis-INF vs Thompson Sampling in stochastically constrained adversarial environmentThompson Sampling · Stochastically constrained adversarial bandits (simulation)pseudo-regretHurt
increase number of copies of the best arm (non-unique optimal arm) (ablation)Tsallis-INF · Multiple optimal arms (simulation)pseudo-regretImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy