Literati: Anytime Optimal Decision Tree Induction via AO* Search

A new arXiv paper presents Literati, a method that uses AO* search to learn decision trees with optimal structures while still returning strong trees at any point during the search. It targets a known weakness of greedy top-down induction, which often produces overly complex trees on tabular data. The work joins a growing line of research on provably optimal, interpretable tree learning.