We propose a dynamic-programming-with-bounds approach to the construction of provably-optimal sparse survival trees. We are often able to find optimal sparse trees in a few seconds.
Jan 1, 2024
