Chapter 4 BART

4.1 A BART version of our hierachical trees model

We have a variable of interest for which we assume:

yij=mk=1Tree look up functionG(XijCovariates,Tree structureTk,Terminal node parametersMk)+ϵijNoise

for observation i=i,,nj in group j=1,,a. We also have that:

ϵijN(0,τ1),

where τ1 is the residual precision. In this setting, Mk will represent the terminal node parameters + the individual group parameters for tree k.

For a single terminal node, let:

Rijk1=Y(1)ijtkG(X(1)ij,Tt,Mt)

which represents the partial residuals for observation i, in group j, for tree k in terminal node 1. Now, let

Rj={Rij,,j=1,,a}

then

RjN(μj,τ1),μjN(μ,k1τ1/m),(m = number of trees)μN(0,k2τ1/m)

using the same marginalisation as for a single tree:

RjMVN(μ1,τ1(k1M1MMT+I)),(M = group model matrix)using the same trick as before and Ψ=k1M1MMT+I:RjMVN(0,τ1(Ψ+k2M111T)),

which is used yo get the marginal distribution of a new tree. The new posterior updates will be:

μ|MVN(1TΨ1RτΨ11+k12M1,τ1(1TΨ11+k12M1)),

μj|MVN(τ1(nj+k11M1))

The update for τ will be a little different. Let ˆfij be the overall prediction for observation Rij at the current iteration:

τ|Ga(n+m+12+α,i,j(yijˆfij)22+j,k(μjkμk)22+j,kμ2k2+β)