Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

A dominated pathwise simulation gradient is unbiased

Statement

Gradients are Euclidean column vectors, and vector expectations are taken coordinatewise.

Let Θ⊆Rd be open, let H:Θ×Ω→R be the simulation payoff from Simulation objectives and unbiased payoff oracles, and fix θ0∈Θ. Suppose there is an open ball U about θ0 such that for almost every ω, H(⋅,ω) is continuously differentiable on U and ∇θH(⋅,ω) is continuous there, and ∇θH(θ,⋅) is measurable for every θ∈U. Assume ∥∇θH(θ,ω)∥2≤M(ω) for all θ∈U outside one measurable null set, where M is nonnegative and integrable, and assume E∥∇θH(θ0,⋅)∥22<∞. Then J(θ)=EH(θ,⋅) is Fréchet differentiable at θ0 and ∇J(θ0)=E[∇θH(θ0,⋅)]. Thus the pathwise estimator from Pathwise and reparameterized simulation-gradient estimators is unbiased at θ0 and has finite coordinate variances.

Facts & Assumptions

Given: The payoff and objective, θ0, the neighborhood and pathwise differentiability, the common integrable derivative envelope, and the square-integrable pathwise gradient in the Statement.

[F1]

Pathwise and reparameterized simulation-gradient estimators: when the same random input is held fixed, the pathwise estimator is DθH(θ,Z); the definition by itself does not assert unbiasedness.

[F2]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): for a differentiable composition, D(g∘f)(a)=Dg(f(a))∘Df(a). Gradients are column vectors represented using the Euclidean inner product of The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn, so DθH(θ,ω)[h]=⟨∇θH(θ,ω),h⟩.

[F4]

Dominated convergence: almost-everywhere convergence under one integrable majorant permits passage of the limit through the integral.

[F5]

Moments, variance, and covariance on a probability space and Variance and covariance identities for random variables: for square-integrable X, Var⁡(X)=E[X2]−(EX)2≤E[X2].

[F7]

Linearity, monotonicity, and the modulus bound for expectation: expectation is linear for integrable variables and satisfies ∣EX∣≤E∣X∣.

[F8]

Simulation objectives and unbiased payoff oracles: the objective is J(θ)=E[H(θ,⋅)].

Proof

1.1givenF2F3

Fix nonzero h∈Rd with θ0+h∈U. For almost every ω, set qω(t)=H(θ0+th,ω) on [0,1]. By [F2], qω′(t)=⟨∇θH(θ0+th,ω),h⟩, which is continuous and hence integrable by [F3]. The FTC [F3] gives H(θ0+h,ω)−H(θ0,ω)−⟨∇θH(θ0,ω),h⟩=∫01⟨∇θH(θ0+th,ω)−∇θH(θ0,ω),h⟩ dt.

1.2givenF1

For each such h, the random variable Mh(ω):=sup⁡r∈Q∩[0,1]∥∇θH(θ0+rh,ω)−∇θH(θ0,ω)∥2 is measurable: continuity in t makes this countable supremum equal the supremum over [0,1]. It satisfies 0≤Mh≤2M almost surely. As h→0, continuity of the sample gradient at θ0 gives Mh→0 almost surely.

2.1step 1.1step 1.2F4F6F7F8algebra

By [F8], J(θ)=E[H(θ,⋅)]. Taking expectations in step 1.1, linearity in [F7] moves the finite inner product through expectation, and [F6] bounds it by Mh∥h∥2. The modulus bound in [F7] therefore bounds the absolute first-order remainder divided by ∥h∥2 by EMh. Along every sequence of nonzero hn→0, [F4] with majorant 2M gives EMhn→0. Hence J(θ0+h)−J(θ0)−⟨E[∇θH(θ0,⋅)],h⟩=o(∥h∥2), which is the Fréchet derivative formula.

3.1givenF1F5step 2.1∎

Each coordinate of the unbiased estimator is square-integrable by the stated second-moment assumption. [F5] therefore gives finite variance for each coordinate.

Depends on

Used by

Dependency tree · two levels

72 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