AI Paper Atlas

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

When Can We Track Significant Preference Shifts in Dueling Bandits?

Joe Suk, Arpit Agarwal

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
METASWIFT instead of ANACONDAMETASWIFT · Non-stationary BTL, S=4dynamic regret: 5331 -> 3346Improved
METASWIFT instead of ANACONDAMETASWIFT · Stationary BTL, S=0dynamic regret: 4863 -> 3048Improved
Stationary-only Interleaved Filtering instead of METASWIFT, no changesIF · Stationary BTL, S=0dynamic regret: 3048 -> 140Improved
Stationary-only IF used in an environment with 4 changesIF · Non-stationary BTL, S=4dynamic regret: 140 -> 14142Hurt
METASWIFT with 4 changes vs noneMETASWIFT · Geometric BTLdynamic regret: 3048 -> 3346No clear effect
ANACONDA with 4 changes vs noneANACONDA · Geometric BTLdynamic regret: 4863 -> 5331No clear effect
METASWIFT instead of uniform random duelingMETASWIFT · Non-stationary BTL, S=4dynamic regret: 18684 -> 3346Improved

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