paper-with-me

홈 › Papers

Woulda, Coulda, Shoulda: Counterfactually-Guided Policy Search

2018-11-15 · ICLR 2019 5 · Lars Buesing, Theophane Weber, Yori Zwols, Sebastien Racaniere, Arthur Guez, Jean-Baptiste Lespiau, Nicolas Heess

Learning policies on data synthesized by models can in principle quench the thirst of reinforcement learning algorithms for large amounts of real experience, which is often costly to acquire. However, simulating plausible experience de novo is a hard problem for many complex environments, often resulting in biases for model-based policy evaluation and search. Instead of de novo synthesis of data, here we assume logged, real experience and model alternative outcomes of this experience under counterfactual actions, actions that were not actually taken. Based on this, we propose the Counterfactually-Guided Policy Search (CF-GPS) algorithm for learning policies in POMDPs from off-policy experience. It leverages structural causal models for counterfactual evaluation of arbitrary policies on individual off-policy episodes. CF-GPS can improve on vanilla model-based RL algorithms by making use of available logged data to de-bias model predictions. In contrast to off-policy algorithms based on Importance Sampling which re-weight data, CF-GPS leverages a model to explicitly consider alternative outcomes, allowing the algorithm to make better use of experience data. We find empirically that these advantages translate into improved policy evaluation and search results on a non-trivial grid-world task. Finally, we show that CF-GPS generalizes the previously proposed Guided Policy Search and that reparameterization-based algorithms such Stochastic Value Gradient can be interpreted as counterfactual methods.

📄 PDF Abstract BibTeX arXiv:1811.06272

Code (0)

등록된 구현이 없습니다.

Tasks

counterfactualReinforcement Learning

Similar Papers 제목 키워드 기반

I Could've Asked That: Reformulating Unanswerable Questions

2024-07-24 · Wenting Zhao, Ge Gao, Claire Cardie, Alexander M. Rush

When seeking information from unfamiliar documents, users frequently pose questions that cannot be answered by the documents. While existing large language models (LLMs) identify these unanswerable questions, they do not…

Question Answering

Counterfactually Guided Off-policy Transfer in Clinical Settings

2020-06-20 · Taylor W. Killian, Marzyeh Ghassemi, Shalmali Joshi

Domain shift, encountered when using a trained model for a new patient population, creates significant challenges for sequential decision making in healthcare since the target domain may be both data-scarce and confounde…

counterfactualDecision MakingSequential Decision Making

CoLD: Counterfactually-Guided Length Debiasing for Process Reward Models in Mathematical Reasoning

2025-07-21 · Congmin Zheng, Jiachen Zhu, Jianghao Lin, Xinyi Dai 외 arxiv

Process Reward Models (PRMs) play a central role in evaluating and guiding multi-step reasoning in large language models (LLMs), especially for mathematical problem solving. However, we identify a pervasive length bias i…

Mathematical Reasoning

Counterfactually Fair Conformal Prediction

2025-10-09 · Ozgur Guldogan, Neeraj Sarna, Yuanyuan Li, Michael Berger arxiv

While counterfactual fairness of point predictors is well studied, its extension to prediction sets--central to fair decision-making under uncertainty--remains underexplored. On the other hand, conformal prediction (CP) …

PyCFRL: A Python library for counterfactually fair offline reinforcement learning via sequential data preprocessing

2025-10-08 · Jianhan Zhang, Jitao Wang, Chengchun Shi, John D. Piette 외 arxiv

Reinforcement learning (RL) aims to learn and evaluate a sequential decision rule, often referred to as a "policy", that maximizes the population-level benefit in an environment across possibly infinitely many time steps…

Reinforcement LearningOffline RL