AI Paper Atlas

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

Thompson Sampling for Combinatorial Semi-Bandits

ICML 2018 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Thompson sampling analysis · 46 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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 Thompson sampling (CTS) instead of UCB-style CUCB for combinatorial banditsGeneral CMAB and matroid bandit · Max spanning tree and shortest path simulationsregretHelped
Use Thompson sampling instead of C-KL-UCBMatroid bandit and general CMAB · Max spanning tree and shortest path simulationsregretHelped
Use an approximation oracle inside TS (CTS)Original MAB instance with approximation oracle · Constructed 3-arm MAB instance (Theorem 2)approximate regretHurt
Remove independence across arms assumption, using matroid structureMatroid bandit CTS · Theoretical analysisregret boundNo clear effect
Use CUCB with tuned confidence radius (CUCB-m) versus theoretical radius (ablation)CUCB · Matroid bandit and shortest path simulationsregretMixed
Pull each base arm about O(1/eps^2) times before running CTSGeneral CMAB CTS · Theoretical analysisconstant regret termHelped

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