mlsanityData to 7 Oct 2026

Exploiting Causal Graph Priors with Posterior Sampling for Reinforcement Learning

arXiv 2310.07518 ↗First posted 11 Oct 2023cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

Posterior sampling allows exploitation of prior knowledge on the environment's transition dynamics to improve the sample efficiency of reinforcement learning. The prior is typically specified as a class of parametric distributions, the design of which can be cumbersome in practice, often resulting in the choice of uninformative priors. In this work, we propose a novel posterior sampling approach in which the prior is given as a (partial) causal graph over the environment's variables. The latter is often more natural to design, such as listing known causal dependencies between biometric features in a medical treatment study. Specifically, we propose a hierarchical Bayesian procedure, called C-PSRL, simultaneously learning the full causal graph at the higher level and the parameters of the resulting factored dynamics at the lower level. We provide an analysis of the Bayesian regret of C-PSRL that explicitly connects the regret rate with the degree of prior knowledge. Our numerical evaluation conducted in illustrative domains confirms that C-PSRL strongly improves the efficiency of posterior sampling with an uninformative prior while performing close to posterior sampling with the full causal graph.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 36 of its 81 references that are in the map. First posted on arXiv 11 Oct 2023.

Builds on

36 of 81 references.

References · 36

  1. 2019Provably Efficient Reinforcement Learning with Linear Function Approximationcited by 514
  2. 2018Is Q-learning Provably Efficient?cited by 485
  3. 2013Learning to Optimize Via Posterior Samplingcited by 253
  4. 2013(More) Efficient Reinforcement Learning via Posterior Samplingcited by 233
  5. 2020Reward-Free Exploration for Reinforcement Learningcited by 177
  6. 2016Why is Posterior Sampling Better than Optimism for Reinforcement Learning?cited by 116
  7. 2022Causal Machine Learning: A Survey and Open Problemscited by 107
  8. 2020Invariant Causal Prediction for Block MDPscited by 104
  9. 2016Causal Bandits: Learning Good Interventions via Causal Inferencecited by 100
  10. 2021Meta-Thompson Samplingcited by 62
  11. 2021AdaRL: What, Where, and How to Adapt in Transfer Reinforcement Learningcited by 46
  12. 2020Latent Bandits Revisitedcited by 43
24 more
  1. 2021Bayesian decision-making under misspecified priors with applications to meta-learningcited by 43
  2. 2014Near-optimal Reinforcement Learning in Factored MDPscited by 41
  3. 2017Identifying Best Interventions through Online Importance Samplingcited by 39
  4. 2020Budgeted and Non-budgeted Causal Banditscited by 38
  5. 2021Causal Reinforcement Learning using Observational and Interventional Datacited by 38
  6. 2021Causal Bandits with Unknown Graph Structurecited by 37
  7. 2021Hierarchical Bayesian Banditscited by 33
  8. 2022Factored Adaptation for Non-Stationary Reinforcement Learningcited by 30
  9. 2022A Provably Efficient Model-Free Posterior Sampling Method for Episodic Reinforcement Learningcited by 30
  10. 2021Model-Invariant State Abstractions for Model-Based Reinforcement Learningcited by 18
  11. 2020Efficient Reinforcement Learning in Factored MDPs with Application to Constrained RLcited by 16
  12. 2022Combinatorial Causal Banditscited by 16
  13. 2021Thompson Sampling with a Mixture Priorcited by 15
  14. 2020Towards Minimax Optimal Reinforcement Learning in Factored Markov Decision Processescited by 13
  15. 2022Provably Efficient Causal Model-Based Reinforcement Learning for Systematic Generalizationcited by 12
  16. 2020A Weaker Faithfulness Assumption based on Triple Interactionscited by 10
  17. 2021On the Sample Complexity of Causal Discovery and the Value of Domain Expertisecited by 9
  18. 2022Combinatorial Pure Exploration of Causal Banditscited by 9
  19. 2013Enumerating Markov Equivalence Classes of Acyclic Digraph Modelscited by 6
  20. 2015Off-policy evaluation for MDPs with unknown structurecited by 6
  21. 2020Oracle-Efficient Regret Minimization in Factored MDPs with Unknown Structurecited by 6
  22. 2017Sample Efficient Feature Selection for Factored MDPscited by 5
  23. 2021Polynomial Time Reinforcement Learning in Factored State MDPs with Linear Value Functionscited by 4
  24. 2020Improved Exploration in Factored Average-Reward MDPscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 2; 2026: 2.

5 papers.