AI Paper Atlas

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

Constant Regret, Generalized Mixability, and Mirror Descent

Zakaria Mhammedi, Robert C. Williamson

NeurIPS 2018 · Bandits and online learning › Online convex optimization and games · approach: Online decision-making with feedback structure · 2 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 average-loss correction vectors to the AGAA updateAGAA with Shannon entropy · Brier game, 2 experts, T ≥ 150regret bound: R^{Φ}_{ℓ_{Brier}} + ΔR_{θ*}(T) ≃ -5Improved
Use the AA instead of the AGAA with correction vectorsBrier game, 2 experts · Brier game, 2 experts, T ≥ 150regret: ≃ R^{S}_{ℓ_{Brier}} = log 2Hurt
Use the AGAA rather than the AAFootball game prediction datasets · Football game predictionsregretImproved
Use Shannon entropy rather than another admissible entropyGeneralized Aggregating Algorithm · Prediction with expert adviceworst-case regret boundImproved

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