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.
Episodic REINFORCE with a frozen episode policy
Definition
Inputs: a finite episodic MDP with nonempty finite state set , finite nonempty action sets , finite reward set , joint transition-reward law , terminal set , and initial state ; a discount ; a differentiable stationary policy family with fixed positive support on an open set ; an initial parameter ; and a step size .
Admissible conditions: the episode sampled from under the frozen policy reaches after finitely many transitions almost surely, and the proposed update remains in .
Output: the updated policy parameter after one training round.
Hold fixed while sampling one episode from until its first terminal state; if , take . For each , compute the return and score using . After the episode is complete, set
and return . All returns, scores, and the full sum use the same parameter value that generated the episode; no policy update occurs while that episode is being sampled.
Definition references
The finite state-dependent action sets and joint reward-transition law.
A differentiable policy family with fixed positive support and score vectors.
The almost-surely terminating episode and discounted return from each time step.
The action-state-reward trajectory law for a finite MDP policy under AC.
Remarks
Under the theorem's assumptions, the sample direction has expectation , including the theorem's trajectory-differentiation and Axiom of Choice premises. The expected parameter increment is therefore . This identity does not imply convergence of repeated nonlinear or deep parameter updates.
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
- The Axiom of Choice
- Discounted episodic policy gradients from trajectory likelihoods
Used by
Dependency tree · two levels
36 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)