AI Paper Atlas

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

Regret Minimization via Saddle Point Optimization

Johannes Kirschner, Alireza Bakhtiari, Kushagra Chandak, Volodymyr Tkachuk, Csaba Szepesvari

NeurIPS 2023 · Bandits and online learning › Online convex optimization and games · approach: Best-of-both-worlds bandit algorithms · 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
use Anytime-E2D instead of E2D with lambda tuned for horizon n=200Anytime-E2D · Semi-bandit with revealing action, d=3, n=2000regretImproved
use Anytime-E2D instead of E2D with lambda tuned for horizon n=500Anytime-E2D · Semi-bandit with revealing action, d=3, n=2000regretImproved
use Anytime-E2D instead of E2D with lambda tuned for horizon n=1000Anytime-E2D · Semi-bandit with revealing action, d=3, n=2000regretImproved
tune E2D lambda for the correct horizon n=2000E2D · Semi-bandit with revealing action, d=3, n=2000regretNo clear effect
replace gaps Delta with Delta_f in both algorithmsE2D and Anytime-E2D · semi-bandit experimentsregretImproved
use Anytime-E2D with adaptive scale instead of lambda set for d*sqrt(n) boundAnytime-E2D · Semi-bandit, d=30, n=1000regretImproved

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