AI Paper Atlas

Research map / Bandits and online learning / Multi-armed bandits

Beyond the Lower Bound: Bridging Regret Minimization and Best Arm Identification in Lexicographic Bandits

Bo Xue, Yuanyu Wan, Zhichao Lu, Qingfu Zhang

AAAI 2026 · Bandits and online learning › Multi-armed bandits · approach: Optimal stochastic 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 LexElim-Out/LexElim-In instead of single-objective UCB-alpha on multi-objective regretUCB-alpha · synthetic lexicographic bandit (K=10, m=3, T=10000)cumulative regret on objectives 2 and 3Improved
use LexElim-Out/In instead of PF-LEXPF-LEX · synthetic lexicographic bandit (K=10)cumulative regretImproved
use cross-objective inner-layer elimination (LexElim-In) instead of layer-by-layer elimination (LexElim-Out) (ablation)LexElim-Out · synthetic best arm identification (K=10,20,30, delta=0.01)sample complexityImproved
increase number of arms K from 10 to 30 (ablation)all BAI algorithms · synthetic best arm identificationsample complexityHurt

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