Optimal Policy Trees

12/03/2020
by   Maxime Amram, et al.
0

We propose an approach for learning optimal tree-based prescription policies directly from data, combining methods for counterfactual estimation from the causal inference literature with recent advances in training globally-optimal decision trees. The resulting method, Optimal Policy Trees, yields interpretable prescription policies, is highly scalable, and handles both discrete and continuous treatments. We conduct extensive experiments on both synthetic and real-world datasets and demonstrate that these trees offer best-in-class performance across a wide variety of problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/20/2022

Constrained Prescriptive Trees via Column Generation

With the abundance of available data, many enterprises seek to implement...
research
04/13/2021

Deep imagination is a close to optimal policy for planning in large decision trees under limited resources

Many decisions involve choosing an uncertain course of actions in deep a...
research
10/13/2022

Fast Optimization of Weighted Sparse Decision Trees for use in Optimal Treatment Regimes and Optimal Policy Design

Sparse decision trees are one of the most common forms of interpretable ...
research
12/13/2022

Policy learning for many outcomes of interest: Combining optimal policy trees with multi-objective Bayesian optimisation

Methods for learning optimal policies use causal machine learning models...
research
08/31/2021

Learning Optimal Prescriptive Trees from Observational Data

We consider the problem of learning an optimal prescriptive tree (i.e., ...
research
09/10/2019

GBDT-MO: Gradient Boosted Decision Trees for Multiple Outputs

Gradient boosted decision trees (GBDTs) are widely used in machine learn...
research
02/08/2022

Nonmyopic Multiclass Active Search for Diverse Discovery

Active search is a setting in adaptive experimental design where we aim ...

Please sign up or login with your details

Forgot password? Click here to reset