atlas

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

Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions

AAAI 2021 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Linear and generalized linear bandits · 2 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 estimates for arms with large confidence intervals by BC²UCB on grouped-type constraints · Grouped typemean regretHelped
Use ordinary C²UCB optimistic estimates rather than capping large-confidence arms at BCCS with general constraints · Grouped typemean regretHurt
Replace estimates for arms with large confidence intervals by BC²UCB on partition matroid constraints · Uniform matroid typemean regretNo clear effect
Use C²UCB with partition matroid constraints rather than general constraintsC²UCB · CCSregret upper bound: \tilde{O}\left(Rd\sqrt{kT} + \min\left(LS, Bk\right)dk\right) -> \tilde{O}\left( Rd\sqrt{kT} + Bdk \right)Helped

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