AI Paper Atlas

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

Bandit Task Assignment with Unknown Processing Time

Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-Ichi Kawarabayashi

NeurIPS 2023 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Practical contextual bandit extensions · 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 phased-update policy with Bernstein-based UCB instead of waiting for all chosen tasks to finish (UCB-BV1, CombUCB1)Bandit task assignment · Synthetic small-gap and large-gap instances, T=10000regretImproved
Underestimate Cu in the algorithmProposed algorithm · Synthetic, true Cu=6regretHurt
Overestimate Cu in the algorithmProposed algorithm · Synthetic, true Cu=6regretNo clear effect
Increase number of tasks NProposed algorithm · Synthetic, N from 3 to 10regretHurt
Run on randomly generated r and c instancesProposed algorithm · Random synthetic instancesregretImproved

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