How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Trajectory and per-decision importance sampling are unbiased under coverage
Statement
Assume AC and the finite-horizon dataset conditions with full trajectory coverage , true known behavior propensities, and the integrability hypotheses in the dataset definition. Whenever the preceding algorithm returns numerical estimates, all three estimates are finite. Under the behavior-generated law of the independent trajectories, its unsupported status occurs only on a null event; assign any fixed finite values to the three estimator expressions there. The ordinary trajectory estimator and per-decision estimator then each have expectation . This statement makes no finite-sample unbiasedness claim for the self-normalized weighted estimator.
Statement references
The fixed-start finite-horizon data law, target value, independent sample, and coverage assumptions.
The OIS and PDIS formulas and their finite-horizon prefix weights.
The full and prefix policy-ratio density identities.
The Axiom of Choice required by the path-law and RN suppliers.
Sutton and Barto, Reinforcement Learning: An Introduction, 2nd ed.
Jiang and Li, Doubly Robust Off-policy Value Evaluation for Reinforcement Learning
Facts & Assumptions
Given: AC, a finite-horizon dataset of independent behavior trajectories, target and behavior policies, full trajectory coverage, and the finite-horizon return.
The Axiom of Choice: AC is assumed by the trajectory-law and RN-density suppliers.
Finite-horizon offline reinforcement-learning dataset and coverage: each feasible trajectory atom has mass , logged trajectories are independent with law , the target value is , and the finite-horizon return is integrable.
Ordinary, per-decision, and weighted trajectory importance sampling: OIS averages ; PDIS averages .
Finite-horizon policy ratios are trajectory Radon-Nikodym derivatives: the full weight changes to , and each prefix weight changes the behavior prefix law to the target prefix law; the corresponding weighted absolute integrals are finite.
The Lebesgue integral is linear on : the integral of a finite sum of integrable trajectory functions is the sum of their integrals.
Proof
Given: The hypotheses and conventions in the Statement and [A1], [F1]–[F4].
On any input where the algorithm returns numerical estimates, each propensity ratio is finite: when , it is a quotient of finite probabilities by a positive probability; when both probabilities are zero, the algorithm sets the ratio to zero. If , the algorithm returns unsupported instead. Thus every cumulative weight is finite. Each return and every finite sum in OIS and PDIS is finite because the reward set, horizon, and dataset are finite. The WIS numerator and denominator are finite, and the procedure either divides by a positive finite denominator or returns zero.
An observed pair with lies on a behavior-null trajectory atom by [F1]. Since the trajectory space, horizon, and sample size are finite, the event that any observed pair has zero behavior propensity is a finite union of null events. The algorithm therefore returns numerical estimates almost surely under the behavior sample law. Extending the three estimator expressions by any fixed finite values on the unsupported null event does not change their expectations.
Fix a logged trajectory index . By [F1], its law is , and [F3] applied to gives . Linearity [F4] gives .
Fix and . The reward is a function of the prefix through , so [F3] gives . Multiplying each equality by the fixed and summing the finite range , [F4] yields .
Each of the PDIS trajectory scores in [F2] has expectation by step 3.2. Their finite sample average has the same expectation by [F4], proving . Step 3.1 proves the ordinary-estimator claim.
Depends on
Used by
Cited to discharge well-definedness by Ordinary, per-decision, and weighted trajectory importance sampling.
Dependency tree · two levels
19 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Richard S. Sutton and Andrew G. Barto, Reinforcement Learning: An Introduction, 2nd ed. (standard reference, not scraped)
- Nan Jiang and Lihong Li, Doubly Robust Off-policy Value Evaluation for Reinforcement Learning (standard reference, not scraped)