Pith. sign in

REVIEW 1 cited by

Proximal Reinforcement Learning: Efficient Off-Policy Evaluation in Partially Observed Markov Decision Processes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2110.15332 v2 pith:AOQRWIFL submitted 2021-10-28 cs.LG math.OCmath.STstat.MLstat.TH

classification cs.LGmath.OCmath.STstat.MLstat.TH
keywords observedgivenlearningpolicypomdpproximalreinforcementdata
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In applications of offline reinforcement learning to observational data, such as in healthcare or education, a general concern is that observed actions might be affected by unobserved factors, inducing confounding and biasing estimates derived under the assumption of a perfect Markov decision process (MDP) model. Here we tackle this by considering off-policy evaluation in a partially observed MDP (POMDP). Specifically, we consider estimating the value of a given target policy in a POMDP given trajectories with only partial state observations generated by a different and unknown policy that may depend on the unobserved state. We tackle two questions: what conditions allow us to identify the target policy value from the observed data and, given identification, how to best estimate it. To answer these, we extend the framework of proximal causal inference to our POMDP setting, providing a variety of settings where identification is made possible by the existence of so-called bridge functions. We then show how to construct semiparametrically efficient estimators in these settings. We term the resulting framework proximal reinforcement learning (PRL). We demonstrate the benefits of PRL in an extensive simulation study and on the problem of sepsis management.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The Sample Complexity of Online Strategic Decision Making with Information Asymmetry and Knowledge Transportability

    cs.LG 2025-06 conditional novelty 6.0 of 10

    An optimism-based algorithm with nonparametric instrumental variables learns an epsilon-optimal policy under information asymmetry and knowledge transfer with O~(1/epsilon^2) sample complexity.

Pith tools