AI Paper Atlas

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

Better Best of Both Worlds Bounds for Bandits with Switching Costs

NeurIPS 2022 · Bandits and online learning › Online convex optimization and games · approach: Best-of-both-worlds bandit algorithms · 5 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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 a switch-count stopping rule to leave Tsallis-INF and then run a block no-regret algorithmTsallis-INF for bandits with switching costs · Stochastically constrained adversarial regimeexpected pseudo-regret with switching cost: \mathcal{O}\brk2{\sum_{i\ne i^\star} \frac{(\lambda K)^{2/3}T^{1/3}+\log T}{\Delta_i}} -> \mathcal{O}\brk[]2{\min\brk[c]Helped
Use a switch-count stopping rule and a block-algorithm fallbackTsallis-INF for bandits with switching costs · Oblivious adversarial regimeexpected pseudo-regret with switching cost: \mathcal{O}\left((\lambda K)^{1/3}T^{2/3}\right)No clear effect
Use a switch-count stopping rule and a block-algorithm fallbackSwitch Tsallis, Switch! · Stochastically constrained adversarial regime, K=2pseudo-regret with switching cost lower bound: \tilde\Omega\brk1{\min\brk[c]1{1/\Delta^2,K^{1/3}T^{2/3}}}Mixed

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