Recursive Partitioning for Personalization using Observational Data
Nathan Kallus

TL;DR
This paper introduces a recursive partitioning method for personalized treatment selection from observational data, offering a unified, interpretable model that improves over traditional regress-and-compare approaches.
Contribution
It proposes a novel recursive partitioning framework for personalized treatment choice, extending to a globally optimal partitioning method for better interpretability and effectiveness.
Findings
Effective in personalized medicine applications
Improves treatment selection accuracy
Provides new validation tools for observational data
Abstract
We study the problem of learning to choose from m discrete treatment options (e.g., news item or medical drug) the one with best causal effect for a particular instance (e.g., user or patient) where the training data consists of passive observations of covariates, treatment, and the outcome of the treatment. The standard approach to this problem is regress and compare: split the training data by treatment, fit a regression model in each split, and, for a new instance, predict all m outcomes and pick the best. By reformulating the problem as a single learning task rather than m separate ones, we propose a new approach based on recursively partitioning the data into regimes where different treatments are optimal. We extend this approach to an optimal partitioning approach that finds a globally optimal partition, achieving a compact, interpretable, and impactful personalization model. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Methods and Inference · Bayesian Methods and Mixture Models · Machine Learning and Algorithms
