AI Paper Atlas

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

Combinatorial Multi-Armed Bandit with General Reward Functions

NeurIPS 2016 · Bandits and online learning › Multi-armed bandits · approach: Optimal stochastic bandit algorithms · 75 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
Replace UCB-style mean estimates with stochastically dominant CDF confidence bounds (SDCB) for general nonlinear rewardsCombinatorial MAB with general reward functions · theoretical analysis (distribution-dependent and distribution-independent regret)regret boundHelped
Discretize outcome distributions onto s=ceil(sqrt(T)) equally spaced support points (Lazy-SDCB)SDCB · theoretical analysis (time and space complexity)worst-case running time and memory: Time O(T^{3/2}) and space O(sqrt(T)) instead of Theta(T^2) time and Theta(T) spaceHelped
Use PTAS as offline oracle for K-MAX (versus greedy (1-1/e) oracle)K-MAX bandit with SDCB · theoretical analysis (approximation regret)(1-epsilon)-approximation regret boundHelped
Apply SDCB to summation reward (linear CMAB) instead of general rewardSDCB · theoretical analysisregret boundNo 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