Fast Learning of Optimal Policy Trees
Fast Learning of Optimal Policy Trees
We develop and implement a version of the popular "policytree" method (Athey and Wager, 2021) using discrete optimisation techniques. We test the performance of our algorithm in finite samples and find an improvement in the runtime of optimal policy tree learning by a factor of nearly 50 compared to the original version. We provide an R package, "fastpolicytree", for public use.
James Cussens、Julia Hatamyar、Vishalie Shah、Noemi Kreif
计算技术、计算机技术
James Cussens,Julia Hatamyar,Vishalie Shah,Noemi Kreif.Fast Learning of Optimal Policy Trees[EB/OL].(2025-06-18)[2025-06-29].https://arxiv.org/abs/2506.15435.点此复制
评论