SLIDE 78 Posterior computations : algorithm
Fix m ∈ N large enough, and Let K = {K1, . . . , Km} s.t. Ki = k iff zi = Zk = (x⋆
k , θ⋆ k) where Z = Z1, . . .
stand for unique values of z(m). At each iteration, successively sample from :
1 (Ki|K−i, y, Z, ξ, T) for 1 ≤ i ≤ n: let nk,i = #1≤l≤n l=i
{Kl = k}, κ(n) the number of distinct Zk values and κ0 a chosen natural, Ki
ind
∼
κ(m)
nk,i Lk,i(Z, ξ, T, y) δk(·) + α κ0
κ0
Lk+κ(m),i(Z, ξ, T, y) δk+κ(m)(·), where Lk,i(Z, ξ, T, y) stands for the likelihood under hypothesis that particle i is allocated to component k.
2 (Z|K, y, ξ, T): Random Walk Metropolis Hastings on parameters. 3 (ξi|ξ−i, K, y, Z, T) for 1 ≤ i ≤ m: Independent Metropolis Hastings with
prior Gamma(1, 1) taken as i.i.d. candidate distribution for ξi.
4 (T|K, y, Z, ξ): Random Walk Metropolis Hastings on scale parameter.
Zacharie Naulet BNP estimation for QHT 9th June 2015 36 / 36