Non-Stationary Structural Causal Bandits
Yeahoon Kwon, Yesong Choe, Soungmin Park, Neil Dhir, Sanghack Lee
Abstract
We study the problem of sequential decision-making in environments governed by evolving causal mechanisms. Prior work on structural causal bandits-formulations that integrate causal graphs into multi-armed bandit problems to guide intervention selection-has shown that leveraging the causal structure can reduce unnecessary interventions by identifying possibly-optimal minimal intervention sets (POMISs). However, such formulations fall short in dynamic settings where reward distributions may vary over time, due to their static-and thus myopic-nature focuses on immediate rewards and overlooks the long-term effects of interventions. In this work, we propose a non-stationary structural causal bandit framework that leverages temporal structural causal models to capture evolving dynamics over time. We characterize how interventions propagate over time by developing graphical tools and assumptions, which form the basis for identifying non-myopic intervention strategies. Within this framework, we devise POMIS + , which captures the existence of variables that contribute to maximizing both immediate and long-term rewards. Our framework provides a principled way to reason about temporally-aware interventions by explicitly modeling information propagation across time. Empirical results validate the effectiveness of our approach, demonstrating improved performance over myopic baselines.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 7e211b55-e2ec-4fcf-ade2-f4d42015fadfBuilds on2
- Non-Stationary Bandits under Recharging Payoffs: Improved Planning with Sublinear RegretOrestis Papadigenopoulos, Constantine Caramanis, Sanjay ShakkottaiNeurIPS 2022 · 7 citations
- Robustly Improving Bandit Algorithms with Confounded and Selection Biased Offline Data: A Causal ApproachWen Huang, Xintao WuAAAI 2024 · 2 citations
Related papers
- Approximate Allocation Matching for Structural Causal Bandits with Unobserved ConfoundersLai Wei, Muhammad Qasim Elahi, Mahsa Ghasemi, Murat KocaogluNeurIPS 2023 · 10 citations
- Structural Causal Bandits under Markov EquivalenceMin Woo Park, Andy Arditi, Elias Bareinboim, Sanghack LeeNeurIPS 2025 · 3 citations
- Causal Bandits with Unknown Graph StructureYangyi Lu, Amirhossein Meisami, Ambuj TewariNeurIPS 2021 · 53 citations
- Partial Structure Discovery is Sufficient for No-regret Learning in Causal BanditsMuhammad Qasim Elahi, Mahsa Ghasemi, Murat KocaogluNeurIPS 2024 · 11 citations
- Additive Causal Bandits with Unknown GraphAlan Malek, Virginia Aglietti, Silvia ChiappaICML 2023 · 11 citations
