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.
Simulation gradient estimation and simultaneous perturbation
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Automatic differentiation and computational graphs
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Conditional Expectation
- Conformal Prediction and Exchangeable Ranks
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Darboux, L'Hôpital, and Taylor's Theorem
- Discrete continuous and pde adjoint sensitivities
- Discrete Time Martingales
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Domination and Likelihood Ratios
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Independence Borel Cantelli and Zero One Laws
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Martingale Inequalities and Convergence
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Numerical differentiation and derivative error control
- Order, Zorn's Lemma, and the Axiom of Choice
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Proximal gradient and accelerated composite optimization
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Scores and Information Bounds
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Statistical Experiments, Models and Identifiability
- Stochastic approximation and stochastic gradient methods
- Suprema and Infima
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Inverse and Implicit Function Theorems
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral: Definition and Integrability
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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 bias, while weighted second moments give an 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
Simulation objectives and unbiased payoff oracles
Definition
Fix a finite dimension , an open set , and a probability space . A simulation payoff is a jointly measurable map such that is integrable for each . Its objective is A payoff-oracle call at returns an integrable real random variable with . 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.
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.
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.
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.
On the one-point probability space, for put and let . By [F2], their laws are and . For every , , so their expectations converge uniformly to zero. For every bounded continuous , [F3] gives ; hence the output laws converge weakly at every fixed .
The expected payoff functions are and . By [F1], , whereas . Thus the derivatives do not converge, despite the stronger uniform convergence of the expected payoffs.
Pathwise and reparameterized simulation-gradient estimators
Definition
Use Simulation objectives and unbiased payoff oracles and write using one fixed random input whose law does not depend on . If, for almost every input, the map is differentiable, its pathwise (or reparameterized) gradient estimator is When , with differentiable and , the chain rule gives The estimator differentiates the simulated outcome while holding the same random input fixed. This definition alone does not assert that its expectation equals .
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 be open, fix , let be a fixed sigma-finite positive measure on a measurable space , and let be normalized densities of probability laws relative to . Suppose there are an open ball about , a measurable set , and one -null set such that, for every and every , exactly when , and is continuously differentiable. Assume the coordinate derivatives are measurable, let be measurable, and suppose for each . Finally assume there is such that If also where is the score of Score and Fisher information, then is Fréchet differentiable at and 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 , differentiability and measurable derivatives, the common integrable envelope, and the weighted second-moment hypothesis.
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].
Score and Fisher information: for a dominated differentiable density family, on the score is ; it is set to zero where . The definition does not itself give a common exceptional null set, which is imposed separately in the Statement.
Likelihood densities: each selected density represents the law relative to the fixed dominating measure.
The chain rule for total derivatives: : differentiating gives . Gradients are column vectors represented using the Euclidean inner product of The Euclidean inner product on , so this is .
The second fundamental theorem: if is differentiable on with and is integrable, then and A continuous function on 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.
Dominated convergence: almost-everywhere convergence dominated by one function permits passage of the limit through the -integral.
Moments, variance, and covariance on a probability space and Variance and covariance identities for random variables: a square-integrable real random variable has variance .
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.
The Lebesgue integral is linear on : the Lebesgue integral is linear on integrable functions, including each coordinate of an integrable vector-valued integrand.
Proof
Fix nonzero with . For , [F3] and [F4] applied to give With , subtracting the derivative at and applying [F7] gives
The right side of step 1.1 has a measurable version: outside , continuity in makes its supremum equal to the supremum over rational ; set it to zero on . This weighted supremum is bounded almost everywhere by by the envelope in the Statement and tends to zero for -almost every as . Thus [F5] shows along every sequence of nonzero . The envelope makes each coordinate of integrable, and the hypotheses make integrable. By [F9], for , . Therefore the Fréchet derivative is .
On the common support , and [F1] gives . Off , the density is identically zero on , so its derivative is zero almost everywhere. For each coordinate put . The weighted second-moment hypothesis makes square-integrable under , hence integrable since on a probability space. Its positive and negative parts are measurable and nonnegative; by [F2] and [F8], This explicitly extends the nonnegative density rule to the signed integrand. Substitution in step 2.1 therefore gives
The weighted second-moment assumption makes each coordinate square-integrable. [F6] gives finite variance, while step 3.1 gives its expectation as the corresponding objective derivative.
Coupled finite-difference simulation-gradient estimator
Definition
Use Simulation objectives and unbiased payoff oracles: let be the simulation payoff on its probability space and write its objective as For , a direction , and with , the coupled central-difference estimator is the random variable 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.
Two-evaluation simultaneous-perturbation gradient estimator
Definition
Input a dimension , , a scalar , a payoff oracle from Simulation objectives and unbiased payoff oracles, and a random vector whose coordinates are independent, symmetric about zero, and nonzero almost surely. Require almost surely. The perturbation and simulator inputs are realized on a common probability space. Require the paired random-parameter oracle outputs , extended by zero on the exceptional zero-output branch, to be measurable real random variables; fixed-parameter integrability alone does not impose this condition.
-
Draw one . If any or either or is outside , return the zero vector in without calling the oracle.
-
Call the oracle once at and once at , obtaining and .
-
Return
The same numerator supplies all coordinates. The zero-output branch has probability zero under the input assumptions, so one estimator uses exactly two oracle calls almost surely, independently of . The definition does not assert unbiasedness, finite variance, or convergence of an update rule.
A dominated pathwise simulation gradient is unbiased
Statement
Gradients are Euclidean column vectors, and vector expectations are taken coordinatewise.
Let be open, let be the simulation payoff from Simulation objectives and unbiased payoff oracles, and fix . Suppose there is an open ball about such that for almost every , is continuously differentiable on and is continuous there, and is measurable for every . Assume for all outside one measurable null set, where is nonnegative and integrable, and assume . Then is Fréchet differentiable at and Thus the pathwise estimator from Pathwise and reparameterized simulation-gradient estimators is unbiased at and has finite coordinate variances.
Facts & Assumptions
Given: The payoff and objective, , the neighborhood and pathwise differentiability, the common integrable derivative envelope, and the square-integrable pathwise gradient in the Statement.
Pathwise and reparameterized simulation-gradient estimators: when the same random input is held fixed, the pathwise estimator is ; the definition by itself does not assert unbiasedness.
The chain rule for total derivatives: : for a differentiable composition, . Gradients are column vectors represented using the Euclidean inner product of The Euclidean inner product on , so .
The second fundamental theorem: if is differentiable on with and is integrable, then and A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion: if is continuous on a compact interval, it is integrable there and .
Dominated convergence: almost-everywhere convergence under one integrable majorant permits passage of the limit through the integral.
Moments, variance, and covariance on a probability space and Variance and covariance identities for random variables: for square-integrable , .
Linearity, monotonicity, and the modulus bound for expectation: expectation is linear for integrable variables and satisfies .
Simulation objectives and unbiased payoff oracles: the objective is .
Proof
Fix nonzero with . For almost every , set on . By [F2], , which is continuous and hence integrable by [F3]. The FTC [F3] gives
For each such , the random variable is measurable: continuity in makes this countable supremum equal the supremum over . It satisfies almost surely. As , continuity of the sample gradient at gives almost surely.
By [F8], . Taking expectations in step 1.1, linearity in [F7] moves the finite inner product through expectation, and [F6] bounds it by . The modulus bound in [F7] therefore bounds the absolute first-order remainder divided by by . Along every sequence of nonzero , [F4] with majorant gives . Hence which is the Fréchet derivative formula.
Each coordinate of the unbiased estimator is square-integrable by the stated second-moment assumption. [F5] therefore gives finite variance for each coordinate.
Coupled finite differences have a covariance-controlled variance
Statement
Let and be square-integrable real simulation outputs with any specified joint law, and let . The central-difference estimator satisfies 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 on one probability space and a scalar .
Moments, variance, and covariance on a probability space: variance and covariance are the expectations of centered squares and products.
Coupled finite-difference simulation-gradient estimator: the central difference is , with the joint law fixed by the simulation coupling.
Expectations factor over finite products of independent random variables: independent integrable factors have product expectation equal to the product of their expectations.
Proof
By [F3], . Centering gives All terms are square-integrable by the hypotheses.
Squaring step 1.1, taking expectations, and expanding the cross term by [F1]–[F2] yields
For independent outputs, [F4] gives , 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.
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 be open, , and be . Let be independent, symmetric about zero, and nonzero almost surely, with For each , assume almost surely and, for almost every realized , this segment lies in an open set on which , where the operator norm is the supremum of over unit vectors . Assume the two oracle outputs in Two-evaluation simultaneous-perturbation gradient estimator satisfy and for every . Then
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.
The Axiom of Choice: every family of nonempty sets has a choice function. AC is used for the conditional-expectation classes below.
Two-evaluation simultaneous-perturbation gradient estimator: , using the same two outputs for all coordinates.
Forward and central differences have first- and second-order error bounds: if on a neighborhood of and , then .
The chain rule for total derivatives: : derivatives of a composition obey . Gradients are column vectors represented using the Euclidean inner product of The Euclidean inner product on , so .
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.
Conditional expectation as an ae class: under AC, conditional expectations exist as almost-sure classes.
Taking out what is known: an integrable measurable factor can be taken outside a conditional expectation when the products are integrable.
Linearity, monotonicity, and the modulus bound for expectation: expectation is linear on integrable real random variables.
Basic algebra and order properties of conditional expectation: conditional expectation is linear and satisfies the tower property.
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.
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
Fix a perturbation vector for which the hypotheses hold and set . By [F3], and . Applying [F2] with step gives
Write . By [F1], using step 1.1 and .
Since is integrable and -measurable, [F10] makes it its own conditional expectation. Conditional linearity [F8] and the hypothesis therefore give . The weighted integrability assumption makes integrable; [F6] takes the finite measurable factor out of the conditional expectation, and the tower property [F8] gives . For , . For , symmetry means and have the same law, so [F9] gives ; linearity [F7] then gives . Independence and the finite reciprocal moment give by [F4]. Therefore the expectation of the linear sum in step 2.1 is .
Taking expectations of the remainder bound in step 2.1 yields Squaring these coordinate bounds, summing over , and taking square roots gives the stated vector bound.
Weighted simulator moments give an inverse-step SPSA variance bound
Statement
Assume AC. At a current history , let , let almost surely, and use the two-evaluation estimator from Two-evaluation simultaneous-perturbation gradient estimator. Suppose the weighted conditional second moment is bounded: almost surely, with deterministic . Then 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 , nonzero perturbation coordinates, and the weighted conditional second-moment bound.
The Axiom of Choice: every family of nonempty sets has a choice function; AC is inherited by the conditional-expectation interface in [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.
Conditional variance is well-defined and has the second-moment formula: for a square-integrable vector oracle, .
Basic algebra and order properties of conditional expectation: conditional expectation preserves inequalities and satisfies the tower property for integrable variables.
Proof
For each coordinate, [F1] and give The weighted conditional bound and the tower property in [F4] make the right side integrable, so each coordinate of is square-integrable.
By conditional monotonicity [F4], taking conditional expectations in step 1.1 and applying the weighted bound yields .
By [F3], . Step 2.1 gives the second bound.
A finite stochastic adjoint gives the discrete gradient under domination
Statement
Gradients of scalar functions are Euclidean column vectors, with under The Euclidean inner product on ; vector expectations are taken coordinatewise.
Let be a probability space, let be measurable spaces for , and let each be a measurable random element; write . Let be open, fix , and choose an open ball with . Let , let be a finite integer, and let the states lie in . The maps are , , , and . Gradients of scalar functions are columns; is an Jacobian and is an Jacobian. Let Assume the displayed maps are measurable for the corresponding product sigma-algebras (Borel on Euclidean factors and 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 . Define Assume is integrable for every , and that there is a nonnegative integrable random variable with for all almost surely, while . Put , propagate and define reverse variables by Then the discrete adjoint integrand satisfies .
For a family of discretizations indexed by , if each discrete objective satisfies the preceding pathwise interchange hypotheses, , and the continuous-limit objective has derivative under the same pathwise interchange conditions, then . This conclusion gives no rate unless a quantitative bound on is also supplied. Euler–Maruyama is the special case , with the simulated Brownian increment.
All tangent, reverse and adjoint derivatives are evaluated on the common full-probability event where the sample maps are . Define 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, convergence of the discrete adjoint integrands and the stated derivative representation of the continuous-limit objective.
The chain rule for total derivatives: : derivatives of compositions of differentiable Euclidean maps are obtained by composing their total derivatives.
The principle of mathematical induction: a property true at the initial index and inherited at each successor holds at every finite index.
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.
Random elements and real random variables: each is a measurable random element. A constant parameter map is measurable because each measurable-set preimage is either empty or the whole probability space.
The reverse recursion is the exact gradient of a finite state-step objective: for a finite deterministic state-step graph, the tangent and reverse recursions in the Statement give its exact objective gradient.
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.
The Euclidean inner product on and Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation: , and (equality is attained by when ).
Linearity, monotonicity, and the modulus bound for expectation: expectation is linear for integrable scalar random variables.
Coordinate maps and permutations are measurable on finite products: a finite tuple of measurable coordinate maps is measurable into the finite product sigma-algebra.
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.
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
Fix . By [F4] the constant map and each are measurable. The finite-tuple lemma [F9] first makes measurable; joint measurability of the initial-state map and composition [F6] then make measurable. If is measurable, [F9] makes measurable into the step map's finite product domain, and [F6] makes measurable. Finite induction [F2] gives every state. Applying [F9] and [F6] to in each payoff map and then [F10] to the finite sum proves measurability of , also when . Let be the common measurable null set excluded in the Statement. Fix a coordinate and put for . If , form the measurable difference quotient ; otherwise put . Measurability follows from the fixed-parameter argument and [F10]. Replace each by zero on : equivalently multiply it by the measurable indicator of , which remains measurable by [F10]. Since is open, these modified quotients converge at every outcome to the version of given by its derivative on and zero on . By [F11] that version is measurable. This works for every fixed and every coordinate, as required by [F3], without assuming the probability space is complete. The initial state is differentiable with sensitivity . If is differentiable, [F1] applied to the parameter-dependent composition , then evaluated at , gives . Thus the stated tangent recursion holds for every by [F2].
Applying the chain rule to at gives its pathwise gradient where .
Fix an input realization outside the common null set and set , , , and . For this is a finite deterministic state-step graph on , so [F5] applies. For , and step 2.1 directly gives the derivative . For each , the definitions of and imply Rearrange and sum these identities over : the terms telescope, and . Thus so the gradient in step 2.1 is exactly , agreeing with [F5] when .
The pathwise derivative at is by step 3.1. The Statement supplies integrability of , the common integrable derivative envelope on , and square-integrability at . Thus [F3] gives .
In the discretization family, step 4.1 gives . For any integrable vector , [F7] and [F8] give, for every , Taking the supremum over such and using [F7] yields . Applying this to yields by the assumed convergence. No state-payoff weak-convergence premise appears in this argument.
Summably biased SPSA has convergent objective values and zero gradient liminf
Statement
Assume AC. Let be , bounded below by a finite , and have an -Lipschitz gradient. Let be a filtration, let be -measurable, and let be the output of the SPSA estimator in Two-evaluation simultaneous-perturbation gradient estimator, measurable with respect to . At each iteration, draw and the simulator random inputs freshly and independently of ; the two paired calls may share their random input. Suppose has a fixed perturbation law, the calls satisfy , and their conditional bias and weighted second moments give, almost surely, with deterministic , and deterministic . 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 , update . Assume is nonnegative, adapted, and integrable at each , and Then converges almost 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 , the deterministic perturbation radii , and the four deterministic step-size conditions.
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].
Filtration-adapted stochastic-gradient oracles and Robbins–Monro updates: is -measurable, is -measurable, and the conditional vector second moment is the squared conditional mean plus the sum of coordinate conditional variances.
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 .
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 .
Descent inequality for a Lipschitz gradient: if is -Lipschitz, then .
Robbins–Siegmund almost-supermartingale convergence: under AC, nonnegative adapted integrable with , for predictable nonnegative integrable and deterministic summable , satisfies convergent almost surely and almost surely.
Basic algebra and order properties of conditional expectation and Taking out what is known: conditional expectation is linear and an integrable -measurable factor may be taken outside it when the products are integrable.
Proof
Put and . By [F1] and [F6], the -measurable iterate and gradient can be taken outside the conditional moment calculations. The second-moment identity then gives, for a deterministic , where the last inequality uses .
Apply [F4] to and condition on , using [F6] to take the known iterate and gradient outside conditional expectation. Since and , this gives For , ; hence the deterministic error is summable by the step-size assumptions.
The process is nonnegative, -measurable, and integrable because . Step 2.1 is the Robbins–Siegmund inequality with multiplicative error , decrement , and deterministic error .
By [F5], converges almost surely and almost surely. If on a path, there are and an index for which for all on that path. Then the weighted sum is at least , contradicting its finiteness. Thus the liminf is zero almost surely.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Michael C. Fu, Stochastic Gradient Estimation, preprint of Handbook of Simulation Optimization, §3
- Paul Glasserman, Monte Carlo Methods in Financial Engineering, §7
- Michael C. Fu, Stochastic Gradient Estimation, preprint of Handbook of Simulation Optimization, §3.1
- Paul Glasserman, Monte Carlo Methods in Financial Engineering, §7.2
- Paul Glasserman, Monte Carlo Methods in Financial Engineering, §7.3.1
- Michael C. Fu, Stochastic Gradient Estimation, preprint of Handbook of Simulation Optimization, §§3.1 and 3.3.4
- J. C. Spall, An Overview of the Simultaneous Perturbation Method for Efficient Optimization, §§SPSA algorithm and perturbation conditions
- Michael C. Fu, Stochastic Gradient Estimation, preprint of Handbook of Simulation Optimization, §3.2
- Paul Glasserman, Monte Carlo Methods in Financial Engineering, §7.2.2
- J. C. Spall, An Overview of the Simultaneous Perturbation Method for Efficient Optimization, pp. 484–491
- Michael C. Fu, Stochastic Gradient Estimation, preprint of Handbook of Simulation Optimization, Proposition 3.1
- Paul Glasserman, Monte Carlo Methods in Financial Engineering, §§6–7
- Michael C. Fu, Stochastic Gradient Estimation, preprint of Handbook of Simulation Optimization, §§3–4
- J. C. Spall, An Overview of the Simultaneous Perturbation Method for Efficient Optimization, §§SPSA algorithm and gain sequences