AI Paper Atlas

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

Anonymous Bandits for Multi-User Systems

Hossein Esfandiari, Vahab Mirrokni, Jon Schneider

NeurIPS 2022 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Causal and structured bandits · 1 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 explore-then-commit instead of a batched-bandit algorithm with decompositionAnonymous bandit algorithms · Synthetic instances with uniformly generated rewardscumulative regretHurt
Use greedy decomposition instead of random or LP-based decompositionAnonymous bandits with batched-bandit algorithm · Synthetic instances with uniformly generated rewardscumulative regretHurt
Use greedy decomposition instead of explore-then-commitAnonymous bandit algorithms · Synthetic instances generated by the linear modelcumulative regretHurt
Use random decomposition or LP-based decomposition instead of explore-then-commitAnonymous bandit algorithms · Synthetic instances with uniformly generated rewardscumulative regretImproved
Use random decomposition instead of LP-based decompositionAnonymous bandits with batched-bandit algorithm · Synthetic instances with uniformly generated rewardscumulative regretNo clear effect

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