AI Paper Atlas

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

Combinatorial Pure Exploration with Full-Bandit or Partial Linear Feedback

Yihan Du, Yuko Kuroki, Wei Chen

AAAI 2021 · Bandits and online learning › Multi-armed bandits · approach: Pure exploration algorithms · 10 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 PolyALBA instead of ALBA or RAGE for CPE-BL matching instancesCPE-BL on matchings · 3-by-3 to 5-by-5 matching instancesrunning timeImproved
Use PolyALBA instead of ALBA or RAGE for CPE-BL matching instancesCPE-BL on matchings · 3-by-3 to 5-by-5 matching instancessample complexityHurt
Use GCB-PE for nonlinear reward identificationCPE-PL · Matching instances with nonlinear rewardanswer correctnessImproved
Use GCB-PE instead of ALBA or RAGECPE-PL · Matching instances with nonlinear rewardrunning timeImproved
Restrict the G-optimal sampling distribution to a polynomial-size supportPolyALBA · CPE-BLcomputational efficiencyImproved
Use a non-uniform allocation over the global observer set instead of uniform samplingGCB-PE · CPE-PLsample complexityImproved

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