IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2609.07888.html

Median-based Splitting Rules for Causal Trees and Forests

Author

Listed:
  • Lennard Ma{ss}mann
  • Karolina Gliszczy'nska-Schroeder

Abstract

Heavy-tailed and skewed outcomes are common in the randomized experiments and observational studies used to estimate heterogeneous treatment effects, yet the mean-squared-error criterion that guides splitting in honest causal trees is sensitive to the extreme values they generate. Building on the causal forest framework (Athey and Imbens, 2016; Wager and Athey, 2018), we introduce the Median Squared Deviation (MSD) criterion, which replaces the leafwise difference in means in the honest splitting objective with the Hodges--Lehmann location estimator while leaving honest leaf estimation and forest inference unchanged. Two further median-based rules, the Median Absolute Deviation (MAD) and the Least Median of Squares (LMS), serve as robust baselines. We evaluate the criteria in a simulation study covering precision, bias, and confidence interval coverage. MSD restricts its robustness to split selection and lowers the error of conditional average treatment effect estimates under heavy-tailed and skewed outcomes. Further, we re-visit two empirical applications: the first analyzes the electoral effects of a Mexican conditional cash transfer program on precinct-level observations, while the second application studies antiretroviral treatments in HIV-positive adults.

Suggested Citation

  • Lennard Ma{ss}mann & Karolina Gliszczy'nska-Schroeder, 2026. "Median-based Splitting Rules for Causal Trees and Forests," Papers 2609.07888, arXiv.org.
  • Handle: RePEc:arx:papers:2609.07888
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2609.07888
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2609.07888. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.