Blossom: an Anytime Algorithm for Computing Optimal Decision Trees

Emir Demirovic, E. Hébrard, Louis Jean
2/12/2026
Semantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{demirovic2026blossom,
  title  = {Blossom: an Anytime Algorithm for Computing Optimal Decision Trees},
  author = {Emir Demirovic and E. Hébrard and Louis Jean},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:f0e255dc56faeb9ac151093e6521bc1e9fea7999},
  journal = {ICML 2023 2023}
}

Discussion