Breiman meets Bellman: Non-Greedy Decision Trees with MDPs

22 September 2023

Papers citing "Breiman meets Bellman: Non-Greedy Decision Trees with MDPs"

9 / 9 papers shown

Title
Limits of Actor-Critic Algorithms for Decision Tree Policies Learning in IBMDPs Hector Kohler R. Akrour Philippe Preux OffRL 58 1 0 23 Sep 2023
Optimal Interpretability-Performance Trade-off of Classification Trees with Black-Box Reinforcement Learning Hector Kohler R. Akrour Philippe Preux OffRL 34 0 0 11 Apr 2023
Quant-BnB: A Scalable Branch-and-Bound Method for Optimal Decision Trees with Continuous Features Rahul Mazumder X. Meng Haoyue Wang 40 15 0 23 Jun 2022
Self-Attention Between Datapoints: Going Beyond Individual Input-Output Pairs in Deep Learning Jannik Kossen Neil Band Clare Lyle Aidan Gomez Tom Rainforth Y. Gal OOD 3DPC 80 139 0 04 Jun 2021
Iterative Bounding MDPs: Learning Interpretable Policies via Non-Interpretable Methods Nicholay Topin Stephanie Milani Fei Fang Manuela Veloso OffRL 43 36 0 25 Feb 2021
MurTree: Optimal Classification Trees via Dynamic Programming and Search Emir Demirović Anna Lukina E. Hébrard Jeffrey Chan James Bailey C. Leckie K. Ramamohanarao Peter Stuckey 71 63 0 24 Jul 2020
Learning Optimal Classification Trees: Strong Max-Flow Formulations S. Aghaei A. Gómez P. Vayanos AI4CE 113 26 0 21 Feb 2020
Proximal Policy Optimization Algorithms John Schulman Filip Wolski Prafulla Dhariwal Alec Radford Oleg Klimov OffRL 446 18,931 0 20 Jul 2017
A Reinforcement Learning Approach to Online Learning of Decision Trees Abhinav Garlapati Aditi Raghunathan Vaishnavh Nagarajan Balaraman Ravindran OffRL 25 9 0 24 Jul 2015