Causal Trees and Honest Splitting
Decision trees built to find where a treatment effect differs across subgroups — and the trick of using separate data to choose the splits and to estimate the effect inside them, so the tree can't fool itself.
Prerequisites: Decision Trees and CART
An ordinary decision tree splits data to make predictions of an outcome more accurate in each leaf. A causal tree splits data to make the estimated treatment effect more different across leaves — it's hunting for the subgroups where a strategy, a policy, or an intervention helps a lot versus barely at all, rather than for subgroups where the outcome itself is high or low. The output isn't "predict the return"; it's "in this leaf, being treated adds roughly this much, and in that leaf it adds almost nothing."
That reframing creates a subtle overfitting risk that ordinary trees don't have in the same way. If you use the same data both to decide where to split and to estimate the treatment effect within each resulting leaf, you'll systematically find splits that look like they reveal a big effect difference purely because you searched over thousands of possible splits and picked whichever one happened, by chance, to produce the most extreme-looking numbers in that same sample. The estimated effects in the leaves become optimistic — a classic case of using the data to ask a question and then reusing it to answer that same question.
Honest splitting fixes this by dividing the training data into two disjoint subsamples before doing anything else: a splitting sample, used only to decide which variable and threshold divide the effect most cleanly, and an estimating sample, used only to compute the actual treatment-effect number reported in each resulting leaf. The tree structure is chosen by one half of the data and honestly evaluated on the other half, which never influenced where the boundaries were drawn — so the reported effect sizes aren't inflated by the same search that found the split.
Worked example
Suppose you're testing whether shortening a hedge fund's rebalancing window improves risk-adjusted returns, and you suspect the benefit depends on how volatile a stock's sector is. With 4,000 stock-months of data, you first split it in half: 2,000 observations for finding splits, 2,000 for estimating effects. The splitting sample suggests dividing on "sector realized volatility above/below 25% annualized." You then go to the separate 2,000-observation estimating sample and compute the average treatment effect in each of the two resulting groups directly from that sample: say, +0.4% monthly alpha in the high-volatility leaf and +0.05% in the low-volatility leaf. Because the estimating sample played no role in choosing the volatility cutoff, those two numbers are honest estimates of the split you already committed to — not numbers cherry-picked by the same search that found the cutoff.
What this means in practice
Causal trees are how you go from "does this strategy help on average" to "who does it help, and by how much" — routing traders, capital, or model overrides to the subgroups where an intervention genuinely moves the needle rather than applying it uniformly. Honesty costs statistical power (you've cut your effective sample size for each task in half), which is why causal trees are usually grown as an ensemble — a causal forest — rather than one single tree, averaging over many honest splits to recover some of that lost precision.
A causal tree finds subgroups with different treatment effects; honest splitting uses one subsample to decide the splits and a disjoint subsample to estimate the effect in each leaf, so the reported effect sizes aren't inflated by the same search that discovered the split.
Reading a causal tree's leaf-level effect estimates as if they came from a single, unified dataset — without checking whether the tree was grown honestly — is the classic mistake. A non-honest causal tree can report a dramatic-looking effect in some leaf that is largely an artifact of having searched thousands of candidate splits for the one that happened to look most extreme.
Related concepts
Practice in interviews
Further reading
- Athey and Imbens, Recursive Partitioning for Heterogeneous Causal Effects