Additive Cube Fixed Point Lower Bound — Cube Fixed Points with Gaussian Noise
Descriptions may be stale. Consult the linked Lean sources.
Cube Fixed Points with Gaussian Noise · Lean proof
Cube Fixed Points with Gaussian Noise
We seek an approximate fixed point of a map
The fixed-point problem is to find
Our assumptions:
Assumption 1 (Nonexpansiveness). For all
Assumption 2 (Additive Gaussian noise). At call
The algorithm uses measurable initialization, query, and output
rules, and its update is jointly measurable in the current state and
reply. After the allotted calls, its cube-valued output must have an
integrable fixed-point residual satisfying
Proved result
OracleTemplate.NonConvergence LongTails.Setups.GaussianAdditiveCubeFixedPoint.spec
LongTails.Theorems.AdditiveCubeFixedPointLowerBound.budgetRelevant previous results
No qualifying prior reference verified; this is not a proof of novelty.