Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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 S, finite nonempty action sets A(s), finite reward set R, joint transition-reward law p, terminal set S†⊆S, and initial state s0∈S; a discount 0≤γ<1; a differentiable stationary policy family πθ with fixed positive support on an open set U⊆Rd; an initial parameter θ0∈U; and a step size α≥0.

Admissible conditions: the episode sampled from s0 under the frozen policy πθ0 reaches S† after finitely many transitions almost surely, and the proposed update remains in U.

Output: the updated policy parameter θ1 after one training round.

Hold θ=θ0 fixed while sampling one episode (S0,A0,R1,…,ST) from s0 until its first terminal state; if s0∈S†, take T=0. For each t<T, compute the return Gt=∑k=tT−1γk−tRk+1 and score ψt=∇θlog⁡πθ(At∣St) using θ=θ0. After the episode is complete, set

θ1=θ0+α∑t=0T−1γtGtψt

and return θ1. All returns, scores, and the full sum use the same parameter value θ0 that generated the episode; no policy update occurs while that episode is being sampled.

Remarks

Under the theorem's assumptions, the sample direction ∑t=0T−1γtGtψt has expectation ∇θJ(θ0), including the theorem's trajectory-differentiation and Axiom of Choice premises. The expected parameter increment is therefore α∇θJ(θ0). This identity does not imply convergence of repeated nonlinear or deep parameter updates.

Depends on

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