Preprint · 2025 · Open access
Acceleration Techniques for Learning Optimal Classification Trees with Integer Programming
arXiv (Cornell University) · Published 24 November 2025 · DOI 10.48550/arxiv.2511.18791
In brief
“Acceleration Techniques for Learning Optimal Classification Trees with Integer Programming” is a 2025 preprint by Keegan, Mitchell and 3 co-authors, published in arXiv (Cornell University). OpenAlex counts 2 citations as of 21 November 2026. It is open access under a CC BY-NC-ND licence: the full text is free to read at arXiv (Cornell University).
- Citations
- 2
- Most cited in
- 2026 (2)
- References
- 27
- Authors
- 4
Abstract
Decision trees are a popular machine learning model which are traditionally trained by heuristic methods. Massive improvements in computing power and optimisation techniques has led to renewed interest in learning globally optimal decision trees. Empirical evidence shows that optimal classification trees (OCTs) have better out-of-sample performance than heuristic methods. The dominant optimisation paradigms for training OCTs are mixed-integer programming (MIP) and dynamic programming (DP). MIP formulations offer flexibility in the objectives and constraints that are modelled, but suffer from poor scaling in the size of the training dataset and the maximum tree depth. DP models represent the state of the art in scaling for OCTs, but lack some of the flexibility of MIP models. In this paper we present progress on using advanced integer programming methods to integrate ideas from DP models into MIP formulations to begin bridging the scaling gap. Using the existing BendOCT model from the literature as a base model, we introduce valid inequalities, cutting planes, and a primal heuristic to improve the scaling of MIP formulations. We show that these techniques significantly improve the ability of BendOCT to find provably optimal solutions over a wide range of datasets.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Mitchell, K., Michael, F., Paul, C., & Abolghasemi, M. (2025). Acceleration Techniques for Learning Optimal Classification Trees with Integer Programming. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2511.18791
MLA 9
Mitchell, Keegan,, et al. “Acceleration Techniques for Learning Optimal Classification Trees with Integer Programming.” arXiv (Cornell University), 2025. https://doi.org/10.48550/arxiv.2511.18791.
Chicago
Mitchell, Keegan,, Forbes, Michael, Corry, Paul, and Mahdi Abolghasemi. 2025. “Acceleration Techniques for Learning Optimal Classification Trees with Integer Programming.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2511.18791.
Harvard
Mitchell, K. et al. (2025) ‘Acceleration Techniques for Learning Optimal Classification Trees with Integer Programming’, arXiv (Cornell University). doi:10.48550/arxiv.2511.18791.
IEEE
K. Mitchell, F. Michael, C. Paul, and M. Abolghasemi, “Acceleration Techniques for Learning Optimal Classification Trees with Integer Programming,” arXiv (Cornell University), 2025, doi: 10.48550/arxiv.2511.18791.
BibTeX
@misc{mitchell2025acceleration,
title = {{Acceleration Techniques for Learning Optimal Classification Trees with Integer Programming}},
author = {Mitchell, Keegan, and Michael, Forbes, and Paul, Corry, and Abolghasemi, Mahdi},
howpublished = {arXiv (Cornell University)},
year = {2025},
doi = {10.48550/arxiv.2511.18791},
url = {https://doi.org/10.48550/arxiv.2511.18791}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
- decision tree induction
- mixed integer programming
- dynamic programming
- valid inequalities
- cutting planes
- primal heuristics
- computational scaling
- out-of-sample performance
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Mitchell, K., Michael, F., Paul, C., & Abolghasemi, M. (2025). Acceleration Techniques for Learning Optimal Classification Trees with Integer Programming. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2511.18791
How many times has this paper been cited?
2 times, according to OpenAlex on 21 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.
Who wrote this paper?
Keegan, Mitchell, Forbes, Michael, Corry, Paul, Mahdi Abolghasemi.
What is the DOI of this paper?
10.48550/arxiv.2511.18791, permanently at https://doi.org/10.48550/arxiv.2511.18791. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 21 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.