Jacobus van der Linden
News
- [August 2026] Our paper Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance got accepted at TMLR.
- [June 2026] I presented at the Workshop on Models and Solvers for Dynamic Programming (DPSOLVE) at FLoC in Lisbon.
- [June 2026] I succesfully defended my PhD thesis Optimal Decision Trees: Algorithms and Applications.
- [Nov 2025] Our paper SORTeD Rashomon Sets of Sparse Decision Trees: Anytime Enumeration was accepted as a spotlight paper at NeurIPS (top 3% of submissions).
Publication highlights
Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance
Published in Transactions on Machine Learning Research, 2026
An extensive empirical comparison of optimal and greedy decision trees.
Recommended citation: Van der Linden, J. G. M., Vos, D., De Weerdt, M. M., Verwer, S. & Demirović, E. (2026) "Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance" Transactions on Machine Learning Research 2026.
Download Paper | Source Repository
Necessary and Sufficient Conditions for Optimal Decision Trees Using Dynamic Programming
Published in Advances in NeurIPS-23, 2023
We prove necessary and sufficient conditions for the use of DP for optimal decision trees and provide a framework STreeD that can optimize trees for a variety of objectives and constraints.
Recommended citation: Van der Linden, J. G. M., de Weerdt, M. M., & Demirović, E. (2023). "Necessary and Sufficient Conditions for Optimal Decision Trees Using Dynamic Programming." Advances in NeurIPS-23, 9173-9212.
Download Paper | Source Repository