atlas

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

Causal Bandits with Propagating Inference

ICML 2018 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Causal and structured bandits · 5 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 the proposed causal-graph algorithm for arbitrary interventions instead of general best-arm identificationCausal bandit · Causal bandit with arbitrary interventionssimple regret: O\left( \sqrt{\frac{ \max\{\gamma^*, N\} \log(|\mathcal{A}|T)}{T}} \right); general best-arm lower bound: \Omega(\sqrt{|Helped
Bounded in-degree causal graphCausal Bandit · Causal bandit with bounded in-degreesimple regret upper bound: \gamma^* = O(N^2)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