Pith. sign in

REVIEW 1 cited by

Conformal Off-Policy Evaluation in 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 2304.02574 v2 pith:HZKQRGSH submitted 2023-04-05 cs.LG cs.AIcs.SYeess.SY

classification cs.LGcs.AIcs.SYeess.SY
keywords policycertaintydatatargetapplicationsbehaviorconformaldifferent
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Reinforcement Learning aims at identifying and evaluating efficient control policies from data. In many real-world applications, the learner is not allowed to experiment and cannot gather data in an online manner (this is the case when experimenting is expensive, risky or unethical). For such applications, the reward of a given policy (the target policy) must be estimated using historical data gathered under a different policy (the behavior policy). Most methods for this learning task, referred to as Off-Policy Evaluation (OPE), do not come with accuracy and certainty guarantees. We present a novel OPE method based on Conformal Prediction that outputs an interval containing the true reward of the target policy with a prescribed level of certainty. The main challenge in OPE stems from the distribution shift due to the discrepancies between the target and the behavior policies. We propose and empirically evaluate different ways to deal with this shift. Some of these methods yield conformalized intervals with reduced length compared to existing approaches, while maintaining the same certainty level.

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. Conformal Prediction for Verifiable Learned Query Optimization

    cs.DB 2025-05 conditional novelty 5.0 of 10

    Conformal prediction can turn a learned query optimizer's cost estimates into latency bounds with a user-chosen confidence level, enabling pre-execution verification and a search heuristic that improves planning time.

Pith tools