Branches: Efficiently Seeking Optimal Sparse Decision Trees via AO

Ayman Chaouki, Jesse Read, A. Bifet
2/14/2026

No official code found. Best implementation: Chaoukia/branches (8 stars, MIT, last commit 2025-08-01).

Semantic Scholar

Code Implementations(1)

Chaoukia/branchesCommunity73%
MIT

Branches algorithm, fast AO* search for optimal sparse Decision Trees.

80Python, Jupyter NotebookMay 31, 20241 years agoMIT
and-or-searchbranch-and-bounddecision-trees-learningdynamic-programmingoptimal-decision-trees+1 more

Similar Papers

ContraDiff: Planning Towards High Return States via Contrastive Learning

100% match2026

NeurRev: Train Better Sparse Neural Network Practically via Neuron Revitalization

100% match2026

COSMIC: Compress Satellite Image Efficiently via Diffusion Compensation

100% match1 repo242026

GiLOT: Interpreting Generative Language Models via Optimal Transport

100% match2026

DataGen: Unified Synthetic Dataset Generation via Large Language Models

100% match1 repo682026

Visual Instruction Inversion: Image Editing via Image Prompting

100% match2026

Cite this paper

@article{chaouki2026branches,
  title  = {Branches: Efficiently Seeking Optimal Sparse Decision Trees via AO},
  author = {Ayman Chaouki and Jesse Read and A. Bifet},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:42ba835f72c5e0cef3349b27b8e05c6ca2bcae48},
  journal = {ICML 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/42ba835f72c5e0cef3349b27b8e05c6ca2bcae48.svg)](https://codeofpaper.com/paper/42ba835f72c5e0cef3349b27b8e05c6ca2bcae48)

Discussion