atlas

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

Simultaneously Learning Stochastic and Adversarial Bandits with General Graph Feedback

ICML 2022 · Bandits and online learning › Online convex optimization and games · approach: Best-of-both-worlds bandit algorithms · 1 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 the proposed time-varying exploration-exploitation trade-off and environment testOnline learning with general graph feedback · Stochastic general graph feedbackregret upper bound: O\bracket{ |D|^2 \cdot \max_{i:i\neq i^*}\bracket{ \frac{\log T/\delta}{\Delta_i^2} }^{\frac{3}{2}} }Helped
Use the proposed time-varying exploration-exploitation trade-off and environment testOnline learning with general graph feedback · Adversarial general graph feedbackexpected regret upper bound: O\bracket{K^{\frac{2}{3}} |D|^{\frac{1}{3}} T^{\frac{2}{3}}\sqrt{\log\frac{T}{\delta}}}Helped
Use γ=1 before identifying the optimal arm and γ=0 afterward, before starting Exp3.G (ablation)BoBW with General Graph Feedback · Adversarial general graph feedbackregret upper bound: O(T)Hurt
Use γ=T^{-1/3} before starting Exp3.G (ablation)BoBW with General Graph Feedback · Stochastic general graph feedbackregret upper bound: O(T^{1/3}\log T)Hurt

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