Alphabeta Math
Pipeline-generated
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.

✓ 8 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 6 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Simulation gradient estimation and simultaneous perturbation

1 · Prerequisites

2 · Summary

Overview

Simulation objectives are expectations of random payoffs. A pathwise estimator differentiates a fixed-noise representation; it is unbiased when a common integrable derivative envelope permits interchange of derivative and expectation. A score estimator differentiates the sampling density; the score theorem uses parameter-independent support and an integrable density-derivative envelope. Coupled finite differences reuse simulation inputs; for square-integrable outputs, their variance depends on covariance. SPSA estimates every coordinate from two shared function evaluations; symmetric perturbations and bounded third derivatives give O(c2) bias, while weighted second moments give an O(c−2) conditional variance bound.

The stochastic-approximation result uses an explicit filtration, adapted iterates, bounded gradients along the path, deterministic summable bias and noise errors, and the Axiom of Choice for the supplied Doob interface. It proves a finite weighted gradient sum and a zero gradient liminf; it does not assert convergence to a minimizer or convergence of every gradient. For a finite SDE discretization, the discrete adjoint derivative is a separate pathwise derivative-interchange question. Weak convergence of payoff values alone does not imply convergence of their derivatives.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Simulation objectives and unbiased payoff oracles

Definition

Fix a finite dimension d≥1, an open set Θ⊆Rd, and a probability space (Ω,F,P). A simulation payoff is a jointly measurable map H:Θ×Ω→R such that H(θ,⋅) is integrable for each θ∈Θ. Its objective is J(θ):=E[H(θ,⋅)]. A payoff-oracle call at θ returns an integrable real random variable Y(θ) with E[Y(θ)]=J(θ). Two calls may use the same random input or different random inputs; their joint law is part of the chosen coupling. A single oracle call is one function evaluation, regardless of the cost of its internal simulation.

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Uniform payoff convergence does not imply gradient convergence

Statement refuted

For a parameter-dependent random payoff, pointwise weak convergence of its output law, even together with uniform convergence of its expected payoff, implies convergence of derivatives of the expected payoffs.

Facts & Assumptions

Given: Weak convergence of probability laws means convergence of integrals against every bounded continuous real function.

[F1]

The derivatives of sine and cosine are cosine and minus sine: (sin⁡x)′=cos⁡x and cos⁡0=1.

[F2]

Probability measures and probability spaces: the one-point space with unit mass is a probability space; Random elements and real random variables, Law or distribution of a random element and The Dirac set function at a point make each deterministic payoff's law the Dirac measure at its value.

[F3]

Expectation of a nonnegative or integrable random variable and Change of variables for expectation: on the one-point space an integrable deterministic variable has expectation equal to its value, and a bounded continuous test function integrates against an output law as the expectation of that test function of the output.

Counterexample

Given: Use a one-point probability space, so each payoff below is deterministic and its law is a Dirac probability measure.

1.1givenF2F3algebra

On the one-point probability space, for n≥1 put Yn(θ)=n−1sin⁡(n2θ) and let Y(θ)=0. By [F2], their laws are δYn(θ) and δ0. For every θ, ∣Yn(θ)−Y(θ)∣≤1/n, so their expectations converge uniformly to zero. For every bounded continuous ψ, [F3] gives ∫ψ dδYn(θ)=ψ(Yn(θ))→ψ(0)=∫ψ dδ0; hence the output laws converge weakly at every fixed θ.

2.1F1step 1.1algebra∎

The expected payoff functions are Jn(θ)=Yn(θ) and J(θ)=0. By [F1], Jn′(0)=n−1n2cos⁡0=n, whereas J′(0)=0. Thus the derivatives do not converge, despite the stronger uniform convergence of the expected payoffs.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Pathwise and reparameterized simulation-gradient estimators

Definition

Use Simulation objectives and unbiased payoff oracles and write J(θ)=E[H(θ,Z)] using one fixed random input Z whose law does not depend on θ. If, for almost every input, the map θ↦H(θ,Z) is differentiable, its pathwise (or reparameterized) gradient estimator is Gpw(θ,Z):=DθH(θ,Z). When H(θ,Z)=h(T(θ,Z),θ), with differentiable T and h, the chain rule gives Gpw=Dxh(T(θ,Z),θ)DθT(θ,Z)+∂θh(T(θ,Z),θ). The estimator differentiates the simulated outcome while holding the same random input fixed. This definition alone does not assert that its expectation equals ∇J(θ).

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

The likelihood-ratio score gradient is unbiased on fixed support

Statement

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

Assume the Axiom of Choice. Let Θ⊆Rd be open, fix θ0∈Θ, let ν be a fixed sigma-finite positive measure on a measurable space (X,A), and let pη be normalized densities of probability laws Pη relative to ν. Suppose there are an open ball U⊆Θ about θ0, a measurable set S∈A, and one ν-null set N such that, for every η∈U and every x∉N, pη(x)>0 exactly when x∈S, and η↦pη(x) is continuously differentiable. Assume the coordinate derivatives are measurable, let H:X→R be measurable, and suppose ∫∣H∣pη dν<∞ for each η∈U. Finally assume there is G∈L1(ν) such that ∣H(x)∣sup⁡η∈U∥∇ηpη(x)∥2≤G(x)for ν-almost every x. If also Eθ0 ⁣[H(X)2∥Sθ0(X)∥22]<∞, where Sθ0=∇θlog⁡pθ0 is the score of Score and Fisher information, then J(θ)=EθH(X) is Fréchet differentiable at θ0 and ∇J(θ0)=Eθ0[H(X)Sθ0(X)]. The score estimator is unbiased and has finite coordinate variances. The fixed-support hypothesis is a sufficient condition here.

Facts & Assumptions

Given: AC, the fixed dominating measure and common support, the normalized density family, payoff H, differentiability and measurable derivatives, the common integrable envelope, and the weighted second-moment hypothesis.

[A1]

The Axiom of Choice: every family of nonempty sets has a choice function. AC is assumed by the canonical family of score representatives in [F1].

[F1]

Score and Fisher information: for a dominated differentiable density family, on {pθ>0} the score is Sθ=∇θlog⁡pθ; it is set to zero where pθ=0. The definition does not itself give a common exceptional null set, which is imposed separately in the Statement.

[F2]

Likelihood densities: each selected density pθ represents the law Pθ relative to the fixed dominating measure.

[F3]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): differentiating t↦pθ0+th(x) gives Dθpθ0+th(x)[h]. Gradients are column vectors represented using the Euclidean inner product of The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn, so this is ⟨∇θpθ0+th(x),h⟩.

[F4]

The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a) and A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuously differentiable scalar function on a compact interval has an integrable derivative and equals its initial value plus the integral of that derivative.

[F5]

Dominated convergence: almost-everywhere convergence dominated by one L1(ν) function permits passage of the limit through the ν-integral.

[F6]

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

[F8]

Expectation of a nonnegative or integrable random variable and Integrating against a density agrees with integrating the product: expectation of an integrable signed random variable is the difference of the expectations of its positive and negative parts, and each nonnegative part integrates against its density.

[F9]

The Lebesgue integral is linear on L1(μ): the Lebesgue integral is linear on integrable functions, including each coordinate of an integrable vector-valued integrand.

Proof

1.1givenF3F4F7

Fix nonzero h∈Rd with θ0+h∈U. For x∉N, [F3] and [F4] applied to t↦pθ0+th(x) give pθ0+h(x)−pθ0(x)=∫01⟨∇pθ0+th(x),h⟩ dt. With Rh(x):=H(x)(pθ0+h(x)−pθ0(x)−⟨∇θpθ0(x),h⟩), subtracting the derivative at t=0 and applying [F7] gives ∣Rh(x)∣∥h∥2≤∣H(x)∣sup⁡0≤t≤1∥∇pθ0+th(x)−∇pθ0(x)∥2.

2.1givenF5F8F9step 1.1algebra

The right side of step 1.1 has a measurable version: outside N, continuity in t makes its supremum equal to the supremum over rational t∈[0,1]; set it to zero on N. This weighted supremum is bounded almost everywhere by 2G(x) by the envelope in the Statement and tends to zero for ν-almost every x as h→0. Thus [F5] shows ∫∣Rh∣ dν/∥h∥2→0 along every sequence of nonzero h→0. The envelope makes each coordinate of H∇pθ0 integrable, and the hypotheses make Hpη integrable. By [F9], for h≠0, J(θ0+h)−J(θ0)−⟨∫XH∇pθ0 dν,h⟩=∫XRh dν. Therefore the Fréchet derivative is ∇J(θ0)=∫XH(x)∇pθ0(x) dν(x).

3.1A1F1F2F8step 2.1algebra

On the common support S, pθ0>0 and [F1] gives ∇pθ0=pθ0Sθ0. Off S, the density is identically zero on U, so its derivative is zero almost everywhere. For each coordinate put φj(x):=H(x)Sθ0,j(x). The weighted second-moment hypothesis makes φj square-integrable under Pθ0, hence integrable since 2∣φj∣≤1+φj2 on a probability space. Its positive and negative parts are measurable and nonnegative; by [F2] and [F8], Eθ0[φj]=Eθ0[φj+]−Eθ0[φj−]=∫φj+pθ0 dν−∫φj−pθ0 dν=∫φjpθ0 dν. This explicitly extends the nonnegative density rule to the signed integrand. Substitution in step 2.1 therefore gives ∇J(θ0)=Eθ0[H(X)Sθ0(X)].

4.1givenF6step 3.1∎

The weighted second-moment assumption makes each coordinate H(X)Sθ0,j(X) square-integrable. [F6] gives finite variance, while step 3.1 gives its expectation as the corresponding objective derivative.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Coupled finite-difference simulation-gradient estimator

Definition

Use Simulation objectives and unbiased payoff oracles: let H:Θ×Ω→R be the simulation payoff on its probability space and write its objective as J(η):=E[H(η,⋅)]. For θ∈Θ, a direction v∈Rd, and h>0 with θ±hv∈Θ, the coupled central-difference estimator is the random variable Dh,vcoup(ω):=H(θ+hv,ω)−H(θ−hv,ω)2h. The same random input ω is used in both terms; this fixes their joint law and, when both payoffs are square-integrable, their covariance. The estimator's variance is not asserted to be smaller for every coupling.

AlgorithmAlgorithm: AI-adaptedProof: Not applicableOpen item page →

Two-evaluation simultaneous-perturbation gradient estimator

Definition

Input a dimension d≥1, θ∈Θ⊆Rd, a scalar c>0, a payoff oracle from Simulation objectives and unbiased payoff oracles, and a random vector Δ=(Δ1,…,Δd) whose coordinates are independent, symmetric about zero, and nonzero almost surely. Require θ+cΔ,θ−cΔ∈Θ almost surely. The perturbation and simulator inputs are realized on a common probability space. Require the paired random-parameter oracle outputs Y+,Y−, extended by zero on the exceptional zero-output branch, to be measurable real random variables; fixed-parameter integrability alone does not impose this condition.

  1. Draw one Δ. If any Δi=0 or either θ+cΔ or θ−cΔ is outside Θ, return the zero vector in Rd without calling the oracle.

  2. Call the oracle once at θ+cΔ and once at θ−cΔ, obtaining Y+ and Y−.

  3. Return G^i(θ):=Y+−Y−2cΔi,i=1,…,d.

The same numerator supplies all d coordinates. The zero-output branch has probability zero under the input assumptions, so one estimator uses exactly two oracle calls almost surely, independently of d. The definition does not assert unbiasedness, finite variance, or convergence of an update rule.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

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.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Coupled finite differences have a covariance-controlled variance

Statement

Let Y+ and Y− be square-integrable real simulation outputs with any specified joint law, and let h>0. The central-difference estimator D=(Y+−Y−)/(2h) satisfies Var⁡(D)=Var⁡(Y+)+Var⁡(Y−)−2Cov⁡(Y+,Y−)4h2. The formula applies in particular when the two outputs use common random numbers as in Coupled finite-difference simulation-gradient estimator. Positive covariance reduces this variance relative to independent outputs with the same marginals; coupling alone does not guarantee positive covariance.

Facts & Assumptions

Given: Square-integrable real outputs Y+,Y− on one probability space and a scalar h>0.

[F1]

Moments, variance, and covariance on a probability space: variance and covariance are the expectations of centered squares and products.

[F2]

Variance and covariance identities for random variables: Var⁡(X)=E[X2]−E[X]2 and Cov⁡(X,Y)=E[XY]−E[X]E[Y].

[F3]

Coupled finite-difference simulation-gradient estimator: the central difference is (Y+−Y−)/(2h), with the joint law fixed by the simulation coupling.

[F4]

Expectations factor over finite products of independent random variables: independent integrable factors have product expectation equal to the product of their expectations.

Proof

1.1givenF1F3algebra

By [F3], D=(Y+−Y−)/(2h). Centering gives D−ED=(Y+−EY+)−(Y−−EY−)2h. All terms are square-integrable by the hypotheses.

2.1step 1.1F1F2algebra

Squaring step 1.1, taking expectations, and expanding the cross term by [F1]–[F2] yields Var⁡(D)=Var⁡(Y+)+Var⁡(Y−)−2Cov⁡(Y+,Y−)4h2.

3.1F2F4step 2.1algebra∎

For independent outputs, [F4] gives E[Y+Y−]=E[Y+]E[Y−], so [F2] makes their covariance zero. Thus the right side in step 2.1 is no larger than the independent-output variance exactly when the chosen coupling has nonnegative covariance; no such sign is forced by sharing a random input.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Symmetric simultaneous perturbations have second-order gradient bias

Statement

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

Assume AC for the conditional-expectation interface. Let Θ⊆Rd be open, θ∈Θ, and f:Θ→R be C3. Let Δ1,…,Δd be independent, symmetric about zero, and nonzero almost surely, with E∣Δj∣<∞,E∣Δi∣−1<∞,qi:=E ⁣[∥Δ∥23∣Δi∣]<∞. For each 0<c≤c0, assume {θ+tΔ:∣t∣≤c}⊆Θ almost surely and, for almost every realized Δ, this segment lies in an open set Vc,Δ⊆Θ on which ∥D3f(y)∥op≤M3, where the operator norm is the supremum of ∣D3f[u,v,w]∣ over unit vectors u,v,w. Assume the two oracle outputs in Two-evaluation simultaneous-perturbation gradient estimator satisfy E[Y±∣Δ]=f(θ±cΔ) and E ⁣[∣Y+−f(θ+cΔ)∣+∣Y−−f(θ−cΔ)∣∣Δi∣]<∞ for every i. Then ∣E[G^i(θ)]−∂if(θ)∣≤M3c26qi,∥E[G^(θ)]−∇f(θ)∥2≤M3c26(∑i=1dqi2)1/2.

Facts & Assumptions

Given: AC; the objective, parameter and smoothness hypotheses; the independent symmetric nonzero perturbation coordinates and moment bounds; and the conditional unbiasedness and weighted integrability of the two oracle outputs.

[A1]

The Axiom of Choice: every family of nonempty sets has a choice function. AC is used for the conditional-expectation classes below.

[F1]

Two-evaluation simultaneous-perturbation gradient estimator: G^i=(Y+−Y−)/(2cΔi), using the same two outputs for all coordinates.

[F2]

Forward and central differences have first- and second-order error bounds: if g∈C3 on a neighborhood of [−c,c] and ∣g′′′∣≤M, then ∣(g(c)−g(−c))/(2c)−g′(0)∣≤Mc2/6.

[F3]

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

[F4]

Expectations factor over finite products of independent random variables: expectations of products of independent integrable random variables factor; the nonnegative case also holds with extended expectations.

[F5]

Conditional expectation as an ae class: under AC, conditional expectations exist as almost-sure classes.

[F6]

Taking out what is known: an integrable measurable factor can be taken outside a conditional expectation when the products are integrable.

[F7]

Linearity, monotonicity, and the modulus bound for expectation: expectation is linear on integrable real random variables.

[F8]

Basic algebra and order properties of conditional expectation: conditional expectation is linear and satisfies the tower property.

[F9]

Random elements and real random variables and Change of variables for expectation: expectation of an integrable function of a real random variable depends only on its law.

[F10]

Conditional expectation given a sigma algebra and Conditional expectation as an ae class: an integrable σ(Δ)-measurable variable is a version of its own conditional expectation, and the version class is unique almost surely.

Proof

1.1givenF2F3

Fix a perturbation vector Δ for which the hypotheses hold and set g(t)=f(θ+tΔ). By [F3], g′(0)=⟨∇f(θ),Δ⟩ and ∣g′′′(t)∣=∣D3f(θ+tΔ)[Δ,Δ,Δ]∣≤M3∥Δ∥23. Applying [F2] with step c gives ∣f(θ+cΔ)−f(θ−cΔ)2c−⟨∇f(θ),Δ⟩∣≤M3c26∥Δ∥23.

2.1F1step 1.1algebra

Write ϵ±=Y±−f(θ±cΔ). By [F1], G^i=∑j=1d∂jf(θ)ΔjΔi+Ri+ϵ+−ϵ−2cΔi,∣Ri∣≤M3c26∥Δ∥23∣Δi∣, using step 1.1 and Δi≠0.

3.1A1F4F5F6F7F8F9F10step 2.1given

Since f(θ±cΔ) is integrable and σ(Δ)-measurable, [F10] makes it its own conditional expectation. Conditional linearity [F8] and the hypothesis therefore give E[ϵ±∣σ(Δ)]=0. The weighted integrability assumption makes ϵ±/Δi integrable; [F6] takes the finite measurable factor 1/Δi out of the conditional expectation, and the tower property [F8] gives E[ϵ±/Δi]=0. For j=i, Δj/Δi=1. For j≠i, symmetry means Δj and −Δj have the same law, so [F9] gives E[Δj]=E[−Δj]; linearity [F7] then gives E[Δj]=0. Independence and the finite reciprocal moment give E[Δj/Δi]=E[Δj]E[1/Δi]=0 by [F4]. Therefore the expectation of the linear sum in step 2.1 is ∂if(θ).

4.1step 2.1step 3.1givenalgebra∎

Taking expectations of the remainder bound in step 2.1 yields ∣E[G^i]−∂if(θ)∣≤E∣Ri∣≤M3c26qi. Squaring these coordinate bounds, summing over i, and taking square roots gives the stated vector bound.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Weighted simulator moments give an inverse-step SPSA variance bound

Statement

Assume AC. At a current history F, let c>0, let Δi≠0 almost surely, and use the two-evaluation estimator from Two-evaluation simultaneous-perturbation gradient estimator. Suppose the weighted conditional second moment is bounded: E ⁣[(∣Y+∣2+∣Y−∣2)∑i=1d∣Δi∣−2 | F]≤B almost surely, with deterministic B<∞. Then E[∥G^∥22∣F]≤B2c2,Var⁡(G^∣F)≤B2c2, where the vector conditional variance is the sum of coordinate conditional variances as in Filtration-adapted stochastic-gradient oracles and Robbins–Monro updates.

Facts & Assumptions

Given: AC, the current history, step c, nonzero perturbation coordinates, and the weighted conditional second-moment bound.

[A1]

The Axiom of Choice: every family of nonempty sets has a choice function; AC is inherited by the conditional-expectation interface in [F2].

[F1]

Two-evaluation simultaneous-perturbation gradient estimator: G^i=(Y+−Y−)/(2cΔi).

[F2]

Filtration-adapted stochastic-gradient oracles and Robbins–Monro updates and Conditional variance: for a vector oracle, conditional variance is the sum of the coordinate conditional variances.

[F3]

Conditional variance is well-defined and has the second-moment formula: for a square-integrable vector oracle, E[∥G^∥22∣F]=∥E[G^∣F]∥22+Var⁡(G^∣F).

[F4]

Basic algebra and order properties of conditional expectation: conditional expectation preserves inequalities and satisfies the tower property for integrable variables.

Proof

1.1givenF1F4algebra

For each coordinate, [F1] and (a−b)2≤2a2+2b2 give ∥G^∥22=∑i=1d(Y+−Y−)24c2Δi2≤∣Y+∣2+∣Y−∣22c2∑i=1d∣Δi∣−2. The weighted conditional bound and the tower property in [F4] make the right side integrable, so each coordinate of G^ is square-integrable.

2.1A1F4step 1.1given

By conditional monotonicity [F4], taking conditional expectations in step 1.1 and applying the weighted bound yields E[∥G^∥22∣F]≤B/(2c2).

3.1A1F2F3step 2.1algebra∎

By [F3], Var⁡(G^∣F)=E[∥G^∥22∣F]−∥E[G^∣F]∥22≤E[∥G^∥22∣F]. Step 2.1 gives the second bound.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

A finite stochastic adjoint gives the discrete gradient under domination

Statement

Gradients of scalar functions are Euclidean column vectors, with Dg(θ)[v]=⟨∇g(θ),v⟩ under The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn; vector expectations are taken coordinatewise.

Let (Ω,F,P) be a probability space, let (Ek,Ek) be measurable spaces for 0≤k≤N, and let each ξk:Ω→Ek be a measurable random element; write ξ=(ξ0,…,ξN). Let Θ⊆Rd be open, fix θ0∈Θ, and choose an open ball U with θ0∈U⊆Θ. Let d,m≥1, let N≥0 be a finite integer, and let the states lie in Rm. The maps are u0:Θ×E0→Rm, Ψk:Rm×Θ×Ek+1→Rm, ℓk:Rm×Θ→R, and ϕ:Rm×Θ→R. Gradients of scalar functions are columns; DuΨk is an m×m Jacobian and DθΨk is an m×d Jacobian. Let u0=u0(θ,ξ0),uk+1=Ψk(uk,θ,ξk+1)(0≤k<N). Assume the displayed maps are measurable for the corresponding product sigma-algebras (Borel on Euclidean factors and Ek on each input factor), and that there is a common measurable null set outside which their sections are continuously differentiable in their state and parameter variables on U. Define FN(θ,ξ):=ϕ(uN,θ)+∑k=0N−1ℓk(uk,θ),JN(θ):=E[FN(θ,ξ)]. Assume FN(θ,ξ) is integrable for every θ∈U, and that there is a nonnegative integrable random variable M with ∥∇θFN(θ,ξ)∥2≤M for all θ∈U almost surely, while E∥∇θFN(θ0,ξ)∥22<∞. Put S0=Dθu0, propagate Sk+1=DuΨk Sk+DθΨk, and define reverse variables by pN=∇uϕ(uN,θ),pk=∇uℓk(uk,θ)+(DuΨk)Tpk+1. Then the discrete adjoint integrand ΓN=∇θϕ+S0Tp0+∑k=0N−1(∇θℓk+(DθΨk)Tpk+1) satisfies ∇JN(θ0)=E[ΓN(θ0,ξ)].

For a family of discretizations indexed by h, if each discrete objective satisfies the preceding pathwise interchange hypotheses, E∥Γh(θ0)−Γ(θ0)∥2→0, and the continuous-limit objective has derivative ∇J(θ0)=E[Γ(θ0)] under the same pathwise interchange conditions, then ∇Jh(θ0)→∇J(θ0). This conclusion gives no rate unless a quantitative bound on E∥Γh(θ0)−Γ(θ0)∥2 is also supplied. Euler–Maruyama is the special case Ψk(u,θ,ΔWk)=u+b(u,θ)hk+σ(u,θ)ΔWk, with ΔWk the simulated Brownian increment.

All tangent, reverse and adjoint derivatives are evaluated on the common full-probability event where the sample maps are C1. Define ΓN=0 on its measurable null complement, and use this version in expectations.

Facts & Assumptions

Given: The finite simulation graph, its explicitly measurable input random elements and product-measurable maps, its differentiability and pathwise envelope hypotheses, and, for the final convergence assertion, L1 convergence of the discrete adjoint integrands and the stated derivative representation of the continuous-limit objective.

[F1]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): derivatives of compositions of differentiable Euclidean maps are obtained by composing their total derivatives.

[F2]

The principle of mathematical induction: a property true at the initial index and inherited at each successor holds at every finite index.

[F3]

A dominated pathwise simulation gradient is unbiased: an integrable common envelope for a continuous pathwise gradient allows differentiation of its expected objective, with derivative equal to the expected pathwise derivative.

[F4]

Random elements and real random variables: each ξk is a measurable random element. A constant parameter map is measurable because each measurable-set preimage is either empty or the whole probability space.

[F5]

The reverse recursion is the exact gradient of a finite state-step objective: for a finite deterministic C1 state-step graph, the tangent and reverse recursions in the Statement give its exact objective gradient.

[F6]

Composition with a Borel measurable outer map preserves measurability: the composite of two measurable maps is measurable once the inner map is measurable into the outer map's measurable domain.

[F7]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn and Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation: ∣⟨u,v⟩∣≤∥u∥2∥v∥2, and ∥z∥2=sup⁡∥v∥2≤1⟨v,z⟩ (equality is attained by v=z/∥z∥2 when z≠0).

[F8]

Linearity, monotonicity, and the modulus bound for expectation: expectation is linear for integrable scalar random variables.

[F9]

Coordinate maps and permutations are measurable on finite products: a finite tuple of measurable coordinate maps is measurable into the finite product sigma-algebra.

[F10]

Arithmetic and lattice operations preserve measurability whenever they are defined: finite sums, differences, real scalar multiples and products of finite real measurable functions are measurable.

[F11]

Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable: a pointwise limit of a sequence of measurable functions is measurable.

Proof

1.1givenF1F2F3F4F6F9F10F11

Fix ϑ∈U. By [F4] the constant map ω↦ϑ and each ξk are measurable. The finite-tuple lemma [F9] first makes ω↦(ϑ,ξ0(ω)) measurable; joint measurability of the initial-state map and composition [F6] then make u0(ϑ,ξ0) measurable. If uk is measurable, [F9] makes ω↦(uk(ω),ϑ,ξk+1(ω)) measurable into the step map's finite product domain, and [F6] makes uk+1 measurable. Finite induction [F2] gives every state. Applying [F9] and [F6] to (uk,ϑ) in each payoff map and then [F10] to the finite sum proves measurability of FN(ϑ,ξ), also when N=0. Let A be the common measurable null set excluded in the Statement. Fix a coordinate j and put hn=1/(n+1) for n≥0. If ϑ+hnej∈U, form the measurable difference quotient Qj,n=(FN(ϑ+hnej,ξ)−FN(ϑ,ξ))/hn; otherwise put Qj,n=0. Measurability follows from the fixed-parameter argument and [F10]. Replace each Qj,n by zero on A: equivalently multiply it by the measurable indicator of Ac, which remains measurable by [F10]. Since U is open, these modified quotients converge at every outcome to the version of ∂jFN(ϑ,ξ) given by its derivative on Ac and zero on A. By [F11] that version is measurable. This works for every fixed ϑ∈U and every coordinate, as required by [F3], without assuming the probability space is complete. The initial state is differentiable with sensitivity S0=Dθu0. If uk is differentiable, [F1] applied to the parameter-dependent composition uk+1(θ)=Ψk(uk(θ),θ,ξk+1), then evaluated at θ0, gives Dθuk+1=DuΨk Dθuk+DθΨk. Thus the stated tangent recursion holds for every k<N by [F2].

2.1givenF1step 1.1

Applying the chain rule to FN at θ0 gives its pathwise gradient ∇θFN=∇θϕ+SNTpN+∑k=0N−1(∇θℓk+SkT∇uℓk), where pN=∇uϕ.

3.1givenF5step 1.1step 2.1algebra

Fix an input realization ξ outside the common null set and set x0ξ(θ)=u0(θ,ξ0), Ψkξ(u,θ)=Ψk(u,θ,ξk+1), ℓkξ(u,θ)=ℓk(u,θ), and ϕξ(u,θ)=ϕ(u,θ). For N≥1 this is a finite deterministic C1 state-step graph on U, so [F5] applies. For N=0, p0=pN=∇uϕ and step 2.1 directly gives the derivative ∇θϕ+S0Tp0=Γ0. For each k<N, the definitions of pk and Sk+1 imply SkTpk=SkT∇uℓk+Sk+1Tpk+1−(DθΨk)Tpk+1. Rearrange and sum these identities over k: the SkTpk terms telescope, and pN=∇uϕ. Thus SNTpN+∑k=0N−1SkT∇uℓk=S0Tp0+∑k=0N−1(DθΨk)Tpk+1, so the gradient in step 2.1 is exactly ΓN, agreeing with [F5] when N≥1.

4.1givenF3step 3.1

The pathwise derivative at θ0 is ΓN(θ0,ξ) by step 3.1. The Statement supplies integrability of FN, the common integrable derivative envelope on U, and square-integrability at θ0. Thus [F3] gives ∇JN(θ0)=E[ΓN(θ0,ξ)].

5.1givenF7F8step 4.1algebra∎

In the discretization family, step 4.1 gives ∇Jh(θ0)=E[Γh(θ0)]. For any integrable vector Z, [F7] and [F8] give, for every ∥v∥2≤1, ⟨v,EZ⟩=E⟨v,Z⟩≤E∥Z∥2. Taking the supremum over such v and using [F7] yields ∥EZ∥2≤E∥Z∥2. Applying this to Z=Γh(θ0)−Γ(θ0) yields ∥∇Jh(θ0)−∇J(θ0)∥2=∥E[Γh(θ0)−Γ(θ0)]∥2≤E∥Γh(θ0)−Γ(θ0)∥2⟶0 by the assumed L1 convergence. No state-payoff weak-convergence premise appears in this argument.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Summably biased SPSA has convergent objective values and zero gradient liminf

Statement

Assume AC. Let f:Rd→R be C1, bounded below by a finite finf⁡, and have an L-Lipschitz gradient. Let (Fk) be a filtration, let xk be Fk-measurable, and let Gk be the output of the SPSA estimator in Two-evaluation simultaneous-perturbation gradient estimator, measurable with respect to Fk+1. At each iteration, draw Δk and the simulator random inputs freshly and independently of Fk; the two paired calls may share their random input. Suppose Δk has a fixed perturbation law, the calls satisfy E[Yk±∣Fk,Δk]=f(xk±ckΔk), and their conditional bias and weighted second moments give, almost surely, ∥E[Gk∣Fk]−∇f(xk)∥2≤Bck2,Var⁡(Gk∣Fk)≤Vck−2,∥∇f(xk)∥2≤G, with deterministic B,V,G<∞, and deterministic ck∈(0,1]. The bias and variance hypotheses are supplied, for example, by the bounds of Symmetric simultaneous perturbations have second-order gradient bias and Weighted simulator moments give an inverse-step SPSA variance bound when their smoothness and weighted-moment conditions hold at each history.

For deterministic αk>0, update xk+1=xk−αkGk. Assume Xk:=f(xk)−finf⁡ is nonnegative, adapted, and integrable at each k, and ∑kαk=∞,ck⟶0,∑kαkck2<∞,∑kαk2ck2<∞. Then Xk converges almost surely, ∑kαk∥∇f(xk)∥22<∞almost surely,lim inf⁡k→∞∥∇f(xk)∥2=0almost surely. Thus the gradient norm has zero liminf almost surely. Without a compactness condition ensuring an iterate accumulation point, this does not guarantee a stationary iterate limit point, convergence to a minimizer, or convergence of the full gradient sequence.

Facts & Assumptions

Given: AC; the filtration-adapted SPSA update, conditional bias and variance bounds, gradient boundedness along the iterates, the integrable Lyapunov process Xk, the deterministic perturbation radii ck, and the four deterministic step-size conditions.

[A1]

The Axiom of Choice: every family of nonempty sets has a choice function. AC is required by the conditional-expectation and Doob interfaces in [F5].

[F1]

Filtration-adapted stochastic-gradient oracles and Robbins–Monro updates: xk is Fk-measurable, Gk is Fk+1-measurable, and the conditional vector second moment is the squared conditional mean plus the sum of coordinate conditional variances.

[F2]

Symmetric simultaneous perturbations have second-order gradient bias: under its perturbation, differentiability, conditional-unbiased-call, and reciprocal-moment assumptions, the conditional SPSA bias is bounded by a deterministic constant times ck2.

[F3]

Weighted simulator moments give an inverse-step SPSA variance bound: under its weighted conditional second-moment assumption, the conditional SPSA variance is bounded by a deterministic constant times ck−2.

[F4]

Descent inequality for a Lipschitz gradient: if ∇f is L-Lipschitz, then f(y)≤f(x)+⟨∇f(x),y−x⟩+(L/2)∥y−x∥22.

[F5]

Robbins–Siegmund almost-supermartingale convergence: under AC, nonnegative adapted integrable Xk with E[Xk+1∣Fk]≤Xk−bk+rk, for predictable nonnegative integrable bk and deterministic summable rk≥0, satisfies Xk convergent almost surely and ∑kbk<∞ almost surely.

[F6]

Basic algebra and order properties of conditional expectation and Taking out what is known: conditional expectation is linear and an integrable Fk-measurable factor may be taken outside it when the products are integrable.

Proof

1.1A1givenF1F6algebra

Put mk=E[Gk∣Fk] and bkbias=mk−∇f(xk). By [F1] and [F6], the Fk-measurable iterate and gradient can be taken outside the conditional moment calculations. The second-moment identity then gives, for a deterministic K<∞, E[∥Gk∥22∣Fk]=∥mk∥22+Var⁡(Gk∣Fk)≤(G+B)2+Vck−2≤K(1+ck−2), where the last inequality uses ck≤1.

2.1A1F1F2F3F4F6step 1.1givenalgebra

Apply [F4] to y=xk−αkGk and condition on Fk, using [F6] to take the known iterate and gradient outside conditional expectation. Since mk=∇f(xk)+bkbias and ∥∇f(xk)∥2≤G, this gives E[Xk+1∣Fk]≤Xk−αk∥∇f(xk)∥22+GBαkck2+LK2αk2(1+ck−2). For ck≤1, 1+ck−2≤2ck−2; hence the deterministic error rk:=GBαkck2+LKαk2ck−2 is summable by the step-size assumptions.

3.1F1F5step 2.1given

The process bk:=αk∥∇f(xk)∥22 is nonnegative, Fk-measurable, and integrable because ∥∇f(xk)∥2≤G. Step 2.1 is the Robbins–Siegmund inequality with multiplicative error ak=0, decrement bk, and deterministic error rk.

4.1A1F5step 3.1givenalgebra∎

By [F5], Xk converges almost surely and ∑kαk∥∇f(xk)∥22<∞ almost surely. If lim inf⁡k∥∇f(xk)∥2>0 on a path, there are ε>0 and an index k0 for which ∥∇f(xk)∥22≥ε for all k≥k0 on that path. Then the weighted sum is at least ε∑k≥k0αk=∞, contradicting its finiteness. Thus the liminf is zero almost surely.

5 · Examples, counterexamples and false statements

None yet.

Sources