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.
A state-dependent action-independent baseline preserves the gradient mean
Statement
Assume the hypotheses of the discounted episodic policy-gradient theorem at a fixed parameter , including the Axiom of Choice, common support, almost-sure finite termination, dominated trajectory differentiation, and the stated integrability of discounted return-score products. Let be any fixed finite-valued function of the state, chosen independently of the actions in the episode. Then
The baseline is action-independent conditional on the state and past. This identity says that subtracting it preserves the expected update; it does not say that every baseline reduces variance.
Statement references
Facts & Assumptions
Given: The hypotheses and notation of Discounted episodic policy gradients from trajectory likelihoods, its Axiom of Choice premise, and a fixed finite-valued state function .
The Axiom of Choice: every family of nonempty sets has a choice function; the policy trajectory law and conditional-expectation supplier use this axiom.
Discounted episodic policy gradients from trajectory likelihoods: under its stated trajectory-differentiation and integrability assumptions, .
A policy score has zero conditional mean before the action: for the pre-action history , almost surely.
Finite Markov decision process with joint reward-transition law and Differentiable stationary stochastic policies and score vectors: the state and action sets are finite, and at fixed every score vector on the common support is finite; hence the finitely many score vectors are bounded.
Episodic returns, temporal-difference errors, and policy support: , episodes terminate almost surely, and is the discounted return from time .
Taking out what is known: an integrable variable measurable with respect to can be taken outside conditional expectation when its product is integrable.
For , , and for the series diverges: for , .
Dominated convergence: almost-sure convergence under a single integrable majorant permits convergence of expectations.
Proof
Given: The Statement hypotheses, with for .
Because is finite, is bounded; because the state-action support is finite, [F3] gives . For every episode, [F6] bounds the baseline-score sum by . For each fixed , is -measurable, so [F2] and [F5] give .
The partial baseline-score sums converge almost surely to the full sum because almost surely, and the bound in step 1.1 is an integrable constant majorant. By [F7], the expectation of the full baseline-score sum is the limit of its finite partial-sum expectations, each zero by step 1.1; hence .
Subtracting the zero vector in step 2.1 from the policy-gradient expectation in [F1] gives the displayed identity.
Depends on
- Finite Markov decision process with joint reward-transition law
- Differentiable stationary stochastic policies and score vectors
- Episodic returns, temporal-difference errors, and policy support
- A policy score has zero conditional mean before the action
- Discounted episodic policy gradients from trajectory likelihoods
- The Axiom of Choice
- Conditional expectation given a sigma algebra
- Expectation of a nonnegative or integrable random variable
- Taking out what is known
- For $|r| < 1$, $\sum_{k \ge 0} r^k = 1/(1-r)$, and for $|r| \ge 1$ the series diverges
- Dominated convergence
Used by
Dependency tree · two levels
60 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, second-edition draft (standard reference, not scraped)
- Ronald J. Williams, Simple Statistical Gradient-Following Algorithms for Connectionist Reinforcement Learning, Machine Learning 8 (1992) (standard reference, not scraped)