Chapter 4 BART

4.1 A BART version of our hierachical trees model

Let’s define:

  • P to be the number of trees
  • J to be the total number of groups
  • Θ will be the set of node hyperparameters
    • μ and μj for each tree in 1 to P

We have a variable of interest for which we assume:

yij=Pp=1Tree look up functionG(XijCovariates,Tree structureTp,Terminal node parametersΘp)+ϵijNoise

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

ϵijN(0,τ1),

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

For a single terminal node, let:

Rijp1=Y(1)ijtpG(X(1)ij,Tt,Mt)

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

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

then

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

using the same marginalisation as for a single tree:

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

which is used to 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(μk1+ˉRjnj(nj+k11),τ1(nj+k11))

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

τ|Ga(n+P+12+α,i,j(yijˆfij)22+j,p(μjpμp)22+j,pμ2p2+β)