AI Paper Atlas

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

Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneously

Julian Zimmert, Haipeng Luo, Chen-Yu Wei

ICML 2019 · Bandits and online learning › Online convex optimization and games · approach: Best-of-both-worlds bandit algorithms · 33 citations (OpenAlex)

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 Hybrid instead of Exp2 or LogBarrierm-set with d=10, m=5, T=10^7 · Stochastic environmentaverage pseudo-regretImproved
Use Hybrid instead of CombUCBm-set with d=10, m=5, T=10^7 · Stochastic environmentaverage pseudo-regretNo clear effect
Use Thompson Sampling in place of Hybridm-set with d=10, m=5, T=10^7 · Stochastic environmentaverage pseudo-regretImproved
Use CombUCB or Thompson Sampling instead of Hybridm-set with d=10, m=5, T=10^7 · Stochastically constrained adversarial settingaverage pseudo-regretHurt

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