Doob's h-transform

In mathematics, more specifically in stochastics, Doob's h-transform is a method to transform a Markov process into a new Markov process, which exhibits certain properties. Most prominently, for a homogeneous Markov process X with (random) lifetime T, the reverse process (XT−t)t≥0 and the conditioned process X∣XT=x on terminating at a single point x, can be expressed as an h-transform of the original process via some deterministic function h. The method was first introduced by J. L. Doob in 1957 to analyze quotients f/h of superharmonic functions f and (positive) harmonic functions h from a probabilistic point of view.

The key advantage of Doob's h-transform is that the transition probabilities of the transformed process are explicitly given as functions of h. If X is an Itô diffusion, for example a Brownian motion, then under relatively mild conditions, the h-transformed process is again an Itô diffusion with an explicit drift term depending on ∇log⁡h.

Motivation

Consider a d-dimensional Brownian motion W started in x0 and stopped at the time T, when it first hits the unit ball B, and one is interested in the process Wx of W conditioned on hitting some point x∈∂B at time T. In law, Wx is given byℙx0(Wx∈A):=ℙx0(W∈A∣WT=x)=ℙ(W∈A∣WT=x,W0=x0),for any Borel set A⊂{f∈C([0,∞),ℝd):f(0)=x0}.

According to Bayes formula, for some fixed t≥0, conditioning Wt on WT can be expressed in terms of the distribution of WT given Wt and the distribution of Wt, namely for M∈ℬ(ℝd)ℙx0(Wt∈M∣WT=x)=1q(x∣x0)∫Mq(x∣y)ℙx0(Wt∈dy),withq(x∣y):=dℙ(WT∈⋅∣Wt=y)dσ(x)=dℙy(WT∈⋅)dσ(x),where σ denotes the uniform distribution on the sphere. In this context, the function q happens to be the well-known Poisson kernel, which has the explicit formulaq(x∣y)=1σ(∂B)1−‖y‖2‖x−y‖d,x∈∂B,y∈B.The distribution of Wt under ℙx0 is explicit as well, since the Brownian Motion is a Gaussian process and so the Bayes formula for Wtx gives an explicit way to compute the transition probabilities. The Bayes formula from above is precisely an h-transform of W with h=q(x∣⋅).

For the simulation of Wx, one is interested in a stochastic differential equation for the latter. With the Bayes formula from above, the infinitesimal generator 𝒜x of Wx can be related to the generator 𝒜=12Δ (the Laplace operator) of Brownian motion: For f∈C2(ℝd), and by denoting the Feller semigroups of W and Wx by (Pt)t≥0 and (Ptx)t≥0 respectively, it holds for y∈ℝd𝒜xf(y)=limt→0Ptxf(y)−f(y)t=1q(x∣y)limt→0Pt(q(x∣⋅)f)(y)−q(x∣y)f(y)t=1q(x∣y)𝒜(q(x∣⋅)f)(y)=1q(x∣y)∇yq(x∣y)⋅∇f(y)+12Δf(y),because Δq(x∣⋅)=0. Comparing 𝒜x with the generator of a general Itô diffusion, one can conclude thatdWtx=∇log⁡q(x∣Wt)dt+dWt,W0=x0.

Definition

Homogeneous Markov processes

Let X be a homogeneous Markov process with state space E, which is often assumed to be a locally compact Polish space to guarantee the existence of regular conditional expectations, and denote its transition semigroup by (Pt)t≥0. Let h:E→[0,∞] be an excessive function, that is,∀t≥0:∫Eh(y)Pt(x,dy)≤h(x),limt→0∫Eh(y)Pt(x,dy)=h(x).Then the h-transform Xh is defined as the Markov process with transition semigroup (Pth)t≥0 defined byPth(x,A):={1h(x)∫Ah(y)Pt(x,dy),x∈E∖{h=0 or h=∞}0,x∈{h=0 or h=∞}for all t≥0 and A∈ℬ(E).

This definition implies that in general Pth(x,E)≤1, which means that the process need not staying inside its state space for all times. For such processes, one usually defines an additional cemetery state ∂∉E that the process enters with probability 1−Pt(x,E) for all x∈E and which it never leaves again, i.e., Pt(∂,{∂})=1. In other words, the process is allowed to be killed at some finite time. On the extended state space E∂=E∪{∂}, the Pth(x,⋅) with the previous definitions are probability measures for all x∈E∂ by construction.

The points x∈{h=0 or h=∞} are so-called branching points, for which it holds P0(x,{x})=0 and P0(x,{∂})=1. Thus, the h-transformed process never enters the set {h=0 or h=∞}, and it is killed at the random time Th=inf⁡{t≥0:Xth=∂}.

Inhomogeneous Markov processes

Let X be an inhomogeneous Markov process with values in ℝd, inhomogeneous transition probabilities (Pt,s)t≥s≥0 and let h:[0,∞)×ℝd→(0,∞) be space-time regular, that is, for s>0, t≥0 and x∈ℝdh(t,x)=∫ℝdh(t+s,y)Pt+s,s(x,dy).Then the h-transform Xh is defined as the (inhomogeneous) Markov process with transition probabilities (Pt,sh)t≥s≥0 defined byPt+s,sh(x,A):=1h(t,x)∫Ah(t+s,y)Pt+s,s(x,dy),∀x∈E,A∈ℬ(E).

Properties

In the theory of h-transforms for homogeneous Markov processes X on a filtered probability space (Ω,ℱ,(ℱt)t≥0,ℙ) it is assumed that

  1. X0 is distributed according to some distribution μ,
  2. X has a lifetime T, that is, a random variable (not necessarily a stopping time) such that Xt(ω)∈E for t>T(ω) and Xt(ω)=∂ for t≥T(ω),
  3. X is a strong Markov process with càdlàg paths on (0,T).

For simplicity, the underlying probability space is usually chosen as the canonical space of càdlàg paths with values in (E,ℬ(E)) and X as the identity.

Probabilities

The transition semigroup (Pth)t≥0 generates a family of probability measures (ℙhx)x∈E on the canonical space of càdlàg paths. For any stopping time τ, it holds for A∈ℱτ and x∈E∖{h=0 or h=∞}

ℙhx(A,T>τ)=1h(x)𝔼x[1Ah(Xτ)].

For a family (us)s∈S of excessive functions on E over an index set S (and measurable w.r.t. the product σ-algebra on E×S), if h is of the form

h(x)=∫Sus(x)dβ(s)

with some finite measure β on S, then for A∈ℱ the probability simplifies to

ℙhx(A)=1h(x)∫Sus(x)ℙusx(A)dβ(s).

Infinitesimal generator

As an almost direct consequence of the above, if X has infinite lifetime (T=∞) and has generator A, then the generator of its h-transformed process Xh is

Ahf(x)=limt→0𝔼x[f(Xth)]−f(x)t=1h(x)limt→0𝔼x[f(Xt)h(Xt)]−f(x)h(x)t=1h(x)A(fh)(x)

for all x∈E and all functions f such that fh is in the domain of A.

Killing

If τ is a co-optional time, that is, if for any t≥0 it holds τ∘θt=(τ−t)+, where (θs)s≥0 is the shift-semigroup, then one can defineh(x):=ℙx(τ>0),x∈EXtτ:={Xt,t<τ∂,t≥τfor which it holds that Xτ is an h-transform of X.

Time-reversal

The time-reversal X← of X is defined as

Xt←(ω)={XT(ω)−t,t≤T(ω)∂,t>T(ω) or T(ω)=∞.

X← is again a homogeneous Markov process, however now with left-continuous paths.

If Xh has initial measure ν∝h⋅dμ, then the reverses of X and Xh have the same transition probabilities. In particular, for a co-optional time τ (for example a last hitting time), if X starts in a fixed point almost surely, then the reverses of X and Xτ have the same transition probabilities.

Moreover, if X possesses a dual process X̂ (defined below), then its reverse can be expressed as an h-transform of its dual. To formulate this statement, we define for X and X̂ respectively the transition semigroups (Pt)t≥0 and (P̂t)t≥0, and, for p≥0, the resolvents

Up:=∫0∞e−ptPtdt,Ûp:=∫0∞e−ptP̂tdt.

While for p>0 the resolvents are always finite, U0 can become infinite.

As the dual of X, X̂ must fulfill for some measure ν

  1. X̂ is a strong Markov process with càdlàg paths,
  2. For all p≥0 and f,g≥0 measurable: ∫E∫Ef(y)Up(x,dy)g(x)dν(x)=∫Ef(x)∫Eg(y)Ûp(x,dy)dν(x),
  3. For all p≥0 and x∈E, both Up(x,⋅) and Ûp(x,⋅) are absolutely continuous w.r.t. ν.

By setting

h(y):=∫EdU0(x,⋅)dν(y)dμ(x):=∫Eu0(x,y)dμ(x),y∈E,

if 0<h<∞, then X← and X̂h have the same transition probabilities.

Conditioning

Doob's h-transform can also be used to condition the process X on hitting a distinct point or, more generally, to attain a pre-determined distribution at its lifetime. For simplicity, it is supposed that P̂0(x,{x})=1 for all x∈E, that is, the dual process X̂ has no branching points.

Let y∈E and U0 be the resolvent of X for p=0 as defined above. Then with

h(x)=u0(x,y),

it holds that XT−h=limt↑TXth=y almost surely on {T<∞}.

If μ=δx0, that is, X starts in x0 almost surely, and α is a distribution on E such that

β(A)=∫A1u0(x,y)dα(y),A∈ℬ(E),

is a σ-finite measure, then one can achieve XT−h∼α by choosing

h(x):=∫Eu0(x,y)dβ(y)=∫Eu0(x,y)u0(x0,y)dα(y).

Applications

Generative modelling

Doob's h-transform has begun to find applications in generative modelling, for example for point clouds, climate data, graphs and image segmentation. The method has also been proposed for faster conditional training and sampling of diffusion models.

See also

Notes

  1. ↑ Doob, Joseph L. (1957). "Conditional Brownian motion and the boundary limits of harmonic functions". Bulletin de la Société Mathématique de France. 45: 431–458. doi:10.24033/bsmf.1494. hdl:2027/mdp.39015095252097.
  2. ↑ Doob, Joseph L. (1958). "Probability and the first boundary value problem". Illinois Journal of Mathematics. 2: 19–36. doi:10.1215/ijm/1255380830.
  3. ↑ Chung & Walsh 2005, p. 334.
  4. 1 2 Särkkä & Solin 2019, pp. 113–115.
  5. 1 2 Rogers & Williams 2000, p. 83–86.
  6. ↑ Chung & Walsh 2005, p. 45.
  7. ↑ Chung & Walsh 2005, p. 320.
  8. ↑ Chung & Walsh 2005, p. 325.
  9. ↑ Chung & Walsh 2005, p. 326.
  10. ↑ Chung & Walsh 2005, p. 331.
  11. ↑ Chung & Walsh 2005, pp. 303–304.
  12. ↑ Chung & Walsh 2005, p. 333.
  13. ↑ Chung & Walsh 2005, p. 366.
  14. 1 2 Chung & Walsh 2005, p. 368.
  15. ↑ Ye, Mao; Wu, Lemeng; Liu, Qiang (2022). "First Hitting Diffusion Models for Generating Manifold, Graph and Categorical Data". Advances in Neural Information Processing Systems. 35: 27280–27292. arXiv:2209.01170. doi:10.52202/068431-1978. ISBN 978-1-7138-7108-8.{{cite journal}}: CS1 maint: periodical has ISBN (link)
  16. ↑ Denker, Alexander; Vargas, Francisco; Padhy, Shreyas; Didi, Kieran; Mathis, Simon; Dutordoir, Vincent; Barbano, Riccardo; Mathieu, Emile; Komorowska, Urszula Julia; Lio, Pietro (2024). "DEFT: Efficient Fine-Tuning of Diffusion Models byLearning the Generalised h-transform". Advances in Neural Information Processing Systems. 37: 19636–19682. doi:10.52202/079017-0620. ISBN 979-8-3313-1438-5.{{cite journal}}: CS1 maint: periodical has ISBN (link)

References