Alphabeta Math
AlgorithmAlgorithm: AI-adaptedProof: Not applicablePipeline-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.

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.

Depends on

Used by

Dependency tree · two levels

3 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