Journal article · 2026 · Open access

Learning Optimal Classification Trees Robust to Distribution Shifts

Nathan Justin, Sina Aghaei, Andres Gomez, Phebe Vayanos

Operations Research · Published 14 October 2026 · DOI 10.1287/opre.2024.0711

Open PDFView at the publisherCite this paper

In brief

“Learning Optimal Classification Trees Robust to Distribution Shifts” is a 2026 journal article by Nathan Justin and 3 co-authors, published in Operations Research. OpenAlex counts 8 citations as of 16 November 2026, which puts it in the top 4% of works published in 2026 by citations. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
8
Most cited in
2025 (5)
Field-weighted impact
9.50
References
16
Authors
4

Abstract

We consider the problem of learning classification trees that are robust to distribution shifts between training and testing/deployment data. This problem arises frequently in high stakes settings such as public health and social work where data is often collected using self-reported surveys which are highly sensitive to e.g., the framing of the questions, the time when and place where the survey is conducted, and the level of comfort the interviewee has in sharing information with the interviewer. We propose a method for learning optimal robust classification trees based on mixed-integer robust optimization technology. In particular, we demonstrate that the problem of learning an optimal robust tree can be cast as a single-stage mixed-integer robust optimization problem with a highly nonlinear and discontinuous objective. We reformulate this problem equivalently as a two-stage linear robust optimization problem for which we devise a tailored solution procedure based on constraint generation. We evaluate the performance of our approach on numerous publicly available datasets, and compare the performance to a regularized, non-robust optimal tree. We show an increase of up to 12.48 percentage points in worst-case accuracy and of up to 4.85 percentage points in average-case accuracy across several datasets and distribution shifts from using our robust solution in comparison to the non-robust one.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Justin, N., Aghaei, S., Gomez, A., & Vayanos, P. (2026). Learning Optimal Classification Trees Robust to Distribution Shifts. Operations Research. https://doi.org/10.1287/opre.2024.0711

MLA 9

Justin, Nathan, et al. “Learning Optimal Classification Trees Robust to Distribution Shifts.” Operations Research, 2026. https://doi.org/10.1287/opre.2024.0711.

Chicago

Justin, Nathan, Sina Aghaei, Andres Gomez, and Phebe Vayanos. 2026. “Learning Optimal Classification Trees Robust to Distribution Shifts.” Operations Research. https://doi.org/10.1287/opre.2024.0711.

Harvard

Justin, N. et al. (2026) ‘Learning Optimal Classification Trees Robust to Distribution Shifts’, Operations Research. doi:10.1287/opre.2024.0711.

IEEE

N. Justin, S. Aghaei, A. Gomez, and P. Vayanos, “Learning Optimal Classification Trees Robust to Distribution Shifts,” Operations Research, 2026, doi: 10.1287/opre.2024.0711.

BibTeX

@article{justin2026learning,
  title     = {{Learning Optimal Classification Trees Robust to Distribution Shifts}},
  author    = {Justin, Nathan and Aghaei, Sina and Gomez, Andres and Vayanos, Phebe},
  journal   = {Operations Research},
  year      = {2026},
  doi       = {10.1287/opre.2024.0711},
  url       = {https://doi.org/10.1287/opre.2024.0711}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Social Sciences › Decision Sciences › Management Science and Operations Research › Risk and Portfolio Optimization

  • classification trees
  • distribution shift
  • robust optimization
  • constraint generation

Work with this paper

Most-cited papers in Decision Sciences

All highly cited Decision Sciences papers

Questions about this paper

How do I cite this paper in APA style?

Justin, N., Aghaei, S., Gomez, A., & Vayanos, P. (2026). Learning Optimal Classification Trees Robust to Distribution Shifts. Operations Research. https://doi.org/10.1287/opre.2024.0711

How many times has this paper been cited?

8 times, according to OpenAlex on 16 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?

Nathan Justin, Sina Aghaei, Andres Gomez, Phebe Vayanos.

What is the DOI of this paper?

10.1287/opre.2024.0711, permanently at https://doi.org/10.1287/opre.2024.0711. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 16 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.