Pith. sign in

REVIEW 1 cited by

Future-Dependent Value-Based Off-Policy Evaluation in POMDPs

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 2207.13081 v2 pith:3BD55P75 submitted 2022-07-26 cs.LG stat.ML

classification cs.LGstat.ML
keywords functionsfuture-dependentvaluepomdpsbellmanevaluationlearningmethods
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We study off-policy evaluation (OPE) for partially observable MDPs (POMDPs) with general function approximation. Existing methods such as sequential importance sampling estimators and fitted-Q evaluation suffer from the curse of horizon in POMDPs. To circumvent this problem, we develop a novel model-free OPE method by introducing future-dependent value functions that take future proxies as inputs. Future-dependent value functions play similar roles as classical value functions in fully-observable MDPs. We derive a new Bellman equation for future-dependent value functions as conditional moment equations that use history proxies as instrumental variables. We further propose a minimax learning method to learn future-dependent value functions using the new Bellman equation. We obtain the PAC result, which implies our OPE estimator is consistent as long as futures and histories contain sufficient information about latent states, and the Bellman completeness. Finally, we extend our methods to learning of dynamics and establish the connection between our approach and the well-known spectral learning methods in POMDPs.

Discussion (0). Continue with ORCID 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