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.
One-step Bernoulli REINFORCE has the exact expected gradient
Example
Let , terminal set , reward set , , and . From transition deterministically to ; from transition deterministically to ; from transition deterministically to . All unlisted joint masses are zero. Start at and use discount . For , let , , and choose the only action at . An episode has one decision, , and . The unscaled sample direction used by frozen-policy REINFORCE for this episode is . For every , .
Example references
Facts & Assumptions
Given: The finite one-decision MDP, , the policy family, and the estimator in the Example.
Finite Markov decision process with joint reward-transition law: each joint next-state/reward mass is nonnegative and the masses for a fixed state-action pair sum to one.
Differentiable stationary stochastic policies and score vectors: has fixed positive support on and its score is the gradient of the log action probability.
Episodic returns, temporal-difference errors, and policy support: the episode return is the discounted sum from the current time to the terminal time.
Episodic REINFORCE with a frozen episode policy: the policy is held fixed while an episode is sampled, and the unscaled sample direction is ; the parameter increment multiplies this direction by the chosen step size.
The total (Fréchet) derivative as the linear first-order approximation with remainder: the derivative of the identity map is the identity linear map.
Verification
Given: The Example data and facts above.
Action occurs with probability and gives reward , while action occurs with probability and gives reward . By [F3], this one-decision episode has , so its expected return is and by [F1] and [F6].
By [F2] and [F5], the score is when and when .
When , ; when , . Hence , which equals the gradient from step 1.1.
Remarks
[A1] Axiom of Choice: every family of nonempty sets has a choice function; the referenced general path-law algorithm assumes AC.
Remarks references
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 finite MDP policy generates action-state-reward trajectories
- Episodic REINFORCE with a frozen episode policy
- The total (Fréchet) derivative $Df(a)$ as the linear first-order approximation with $o(\|h\|_2)$ remainder
- The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t
- The Axiom of Choice
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
41 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.