TheoremBase

A Bound on the Noise Ornstein-Uhlenbeck Functional by Noise Gradients Gives Finite Weighted Fisher Information

If the noise Ornstein-Uhlenbeck functional of a measure is bounded by R times the noise-gradient norm on bounded C2C^2 cylindrical functions, then the measure has a relative score and weighted Fisher information at most R squared.

Statement

In the setting of A Diagonal Gaussian Reference Measure on the Noise Wasserstein Space, Rescaled Heads and Gaussian Tails: Standing Notation, let μ∈P2(X)\mu\in\mathcal{P}_{2}(X), the set of The Second Moment of a Borel Probability Measure on a Hilbert Space and the Probability Measures with Finite Second Moment §space, and let R∈RR\in\mathbb{R} be nonnegative. For n∈Nn\in\mathbb{N}, Cb2(Rn)C^{2}_{b}(\mathbb{R}^{n}) is the set of Bounded Twice Continuously Differentiable Functions with Bounded First and Second Partial Derivatives on Euclidean Space §bounded with q=nq=n; for g∈Cb2(Rn)g\in C^{2}_{b}(\mathbb{R}^{n}), the function g∘png\circ p_{n} is a bounded C2C^{2} cylindrical function, hence a bounded C1C^{1} cylindrical function by Noise Gradients of Bounded C^2 Cylindrical Functions Are Dense in the Noise Tangent Space §inclusion; the class of its noise gradient in L2(μ;Xa)L^{2}(\mu;X^{a}) is again written ∇a(g∘pn)\nabla_{a}(g\circ p_{n}), ∥⋅∥μ\lVert\cdot\rVert_{\mu} is the norm of L2(μ;Xa)L^{2}(\mu;X^{a}), and Lμa(g)L^{a}_{\mu}(g) is the noise Ornstein-Uhlenbeck functional of μ\mu at gg. Suppose that

∣Lμa(g)∣≤R ∥∇a(g∘pn)∥μfor every n∈N and every g∈Cb2(Rn).\bigl|L^{a}_{\mu}(g)\bigr|\le R\,\lVert\nabla_{a}(g\circ p_{n})\rVert_{\mu}\qquad\text{for every }n\in\mathbb{N}\text{ and every }g\in C^{2}_{b}(\mathbb{R}^{n}).

(Finite weighted Fisher information) Then μ\mu has a relative score with respect to γc\gamma_{c} and finite Fisher information relative to γc\gamma_{c} with weights aa, and Ia(μ ∣ γc)≤R2\mathcal{I}_{a}(\mu\,|\,\gamma_{c})\le R^{2}.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…