atlas

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

Minimizing Regret on Reflexive Banach Spaces and Nash Equilibria in Continuous Zero-Sum Games

NeurIPS 2016 · Bandits and online learning › Online convex optimization and games · approach: Fast no-regret dynamics in games · 6 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 Dual Averaging without assuming convexity of the action set or rewardsOnline optimization on compact metric spaces · Convex quadratics on hypercube, n=2 and n=3simulation regret decay rate: -0.519 (n=2), -0.481 (n=3) for DA, Exp; OGD: -0.920 (n=2), -0.892 (n=3)Mixed
Use 1.5-Norm instead of exponential potential (ablation)Dual Averaging · Convex quadratics on hypercubesimulation regret decay rate: -0.557 -> -0.307Mixed
Use 1.75-Norm rather than 1.5-Norm potential (ablation)Dual Averaging · Convex quadratics on hypercubesimulation regret decay rate: -0.307 -> -0.279Hurt
Use 1.05-Norm rather than 1.01-Norm potential (ablation)Dual Averaging · Convex quadratics on hypercubesimulation regret decay rate: -0.546 -> -0.477Hurt

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