AI Paper Atlas

Research map / Bandits and online learning / Contextual bandits and Thompson sampling

Bandits with Knapsacks beyond the Worst Case

Karthik Abinav Sankararaman, Aleksandrs Slivkins

NeurIPS 2021 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Linear and generalized linear bandits · 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
Analyze PrunedUcbBwK under d=2 and best-arm-optimalityUcbBwK · BwKregret vs. best fixed distribution: \mO(KG_\term{LAG}^{-2}\,\log T)Improved
Use the tighter counting argument when the best arm's consumption is sufficiently far from B/TPrunedUcbBwK · BwK, d=2 and best-arm-optimalregret vs. best fixed distribution: \mO (\; \sum_{a\not\in\{a^*,\term{null}\}} G_\term{LAG}^{-1}(a)\; \log(Kd T)\;)Improved
Apply the confidence-sum reduction to MnlBwKBwK-to-bandits reduction · MnlBwKworst-case regret dependence on N: N^{7/2} -> N^{3/2}Improved

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