11 citations · 28 across the 11 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.LG2023
Differentially-Private Decision Trees and Provable Robustness to Data Poisoning
Daniël Vos, Jelle Vos, Tianyu Li +2
Decision trees are interpretable models that are well-suited to non-linear learning problems. Much work has been done on extending decision tree learning algorithms with differenti…
cs.AI2023★ 7 cited
Optimal Decision Tree Policies for Markov Decision Processes
Daniël Vos, Sicco Verwer
Interpretability of reinforcement learning policies is essential for many real-world tasks but learning such interpretable policies is a hard problem. Particularly rule-based polic…