Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Approximate Allocation Matching for Structural Causal Bandits with Unobserved Confounders
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 changed | Where | Measured | Effect |
|---|---|---|---|
| use SCM-AAM instead of Thompson sampling over POMISs | structural causal bandit · Tasks 1-3 (binary SCMs, horizon 800) | empirical regret | Helped |
| use KL-UCB/TS over POMISs instead of plain UCB on reduced action set | baseline bandit algorithms · Tasks 2 and 3 | empirical regret | Helped |
| use SCM-AAM on more complex causal graphs (tasks 2, 3) versus simple task 1 | SCM-AAM · Tasks 1-3 | regret advantage over baselines | Helped |
Closest papers by meaning
- Partial Structure Discovery is Sufficient for No-regret Learning in Causal Bandits (NeurIPS 2024 · similarity 0.93)
- Causal Bandits: The Pareto Optimal Frontier of Adaptivity, a Reduction to Linear Bandits, and Limitations around Unknown Marginals (ICML 2024 · similarity 0.90)
- Robustly Improving Bandit Algorithms with Confounded and Selection Biased Offline Data: A Causal Approach (AAAI 2024 · similarity 0.90)
- Linear Causal Bandits: Unknown Graph and Soft Interventions (NeurIPS 2024 · similarity 0.89)
- Adversarial Causal Bayesian Optimization (ICLR 2024 · similarity 0.88)
- Scores for Learning Discrete Causal Graphs with Unobserved Confounders (AAAI 2024 · similarity 0.88)
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.