Quant-BnB: A Scalable Branch-and-Bound Method for Optimal Decision Trees with Continuous Features

23 June 2022

Papers citing "Quant-BnB: A Scalable Branch-and-Bound Method for Optimal Decision Trees with Continuous Features"

4 / 4 papers shown

Title
Interpretable and Editable Programmatic Tree Policies for Reinforcement Learning Hector Kohler Quentin Delfosse R. Akrour Kristian Kersting Philippe Preux 62 14 0 23 May 2024
Fast hyperboloid decision tree algorithms Philippe Chlenski Ethan Turok A. Moretti I. Pe’er 29 4 0 20 Oct 2023
Interpretable Decision Tree Search as a Markov Decision Process Hector Kohler R. Akrour Philippe Preux 19 2 0 22 Sep 2023
Learning Certifiably Optimal Rule Lists for Categorical Data E. Angelino Nicholas Larus-Stone Daniel Alabi Margo Seltzer Cynthia Rudin 60 195 0 06 Apr 2017