Showing cs.LGShow all
2 papers · 1 filter
cs.LG2025
Breiman meets Bellman: Non-Greedy Decision Trees with MDPs
Hector Kohler, Riad Akrour, Philippe Preux
In supervised learning, decision trees are valued for their interpretability and performance. While greedy decision tree algorithms like CART remain widely used due to their comput…
cs.LG2025
Evaluating Interpretable Reinforcement Learning by Distilling Policies into Programs
Hector Kohler, Quentin Delfosse, Waris Radji +2
There exist applications of reinforcement learning like medicine where policies need to be ''interpretable'' by humans. User studies have shown that some policy classes might be mo…