AI Paper Atlas

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

Online Learning with Feedback Graphs: The True Shape of Regret

Tomáš Kocák, Alexandra Carpentier

ICML 2023 · Bandits and online learning › Online convex optimization and games · approach: Online decision-making with feedback structure · 0 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
Add explicit exploration distribution over dominating sets of informative actions (Exp3-EX) to standard exponential weights (Exp3-style)Exp3-EX on feedback graphs · Theoretical minimax regret (adversarial, feedback graphs)regret bound orderImproved
Hub-graph example: sqrt(alpha T) rate replaced by delta^{1/3} T^{2/3} regret rate when T is smallGraph with one hub connected to N-1 independent vertices · Theoretical regret, T < alpha^3regret orderImproved
Use problem complexity R* (instead of sqrt(alpha T)) as the minimax rate characterization for any TMinimax regret of online learning with feedback graphs · Theoretical, all graphs and horizonsregret lower bound orderNo clear effect
No experiments were run; all results are theoretical boundsn/a · n/an/aNo clear effect

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