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=P∑p=1Tree look up function⏞G(Xij⏟Covariates,Tree structure⏞Tp,Terminal node parameters⏞Θp)+ϵij⏟Noise
for observation i=i,…,nj in group j=1,…,J. We also have that:
ϵij∼N(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)ij−∑t≠pG(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
Rj∼∼N(μj,τ−1),μj∼N(μ,k1τ−1/P),(P = number of trees)μ∼N(0,k2τ−1/P)
using the same marginalisation as for a single tree:
Rj∼∼MVN(μ1,τ−1(k1MMT+I)),(M = group model matrix)using the same trick as before and Ψ=k1MMT+I:Rj∼∼MVN(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+k−12M−1,τ−1(1TΨ−11+k−12M−1)),
μj|⋯∼MVN(μk1+ˉRjnj(nj+k−11),τ−1(nj+k−11))
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+β)