This paper introduces advancements in structural causal bandits, a method that uses causal knowledge to guide exploration when reward mechanisms are unknown. The research extends this approach to scenarios with partially known causal structures, information from other environments, and counterfactual actions. Key contributions include graphical criteria for minimal intervention sets under Markov equivalence, algorithms for finding possibly-optimal intervention sets, and methods for deriving target reward bounds from source distributions using partial transportability. The work also formulates counterfactual structural causal bandits over actions supported by experimental capabilities, providing graphical characterizations for minimality and possible optimality to refine action spaces. AI
RANK_REASON The item is an academic paper submitted to arXiv cs.LG. [lever_c_demoted from research: ic=1 ai=1.0]
- alphaXiv
- arXivLabs
- Bibliographic Explorer
- CatalyzeX Code Finder for Papers
- Connected Papers
- CORE Recommender
- Counterfactuals and the Second Law
- DagsHub
- Gotit.pub
- Hugging Face
- IArxiv Recommender
- Influence Flower
- Litmaps
- Markov equivalence
- Maximal ancestral graphs
- Partial ancestral graph
- portability
- ScienceCast
- scite Smart Citations
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →