# Optimization of Tree Ensembles

**Authors:** Velibor V. Mi\v{s}i\'c

arXiv: 1705.10883 · 2019-10-11

## TL;DR

This paper develops a mixed-integer optimization framework for tuning controllable variables in tree ensemble models to maximize predictions, with scalable solution methods demonstrated on real-world case studies.

## Contribution

It introduces a novel optimization formulation for tree ensembles, analyzes its strength, and proposes scalable algorithms for large-scale problems.

## Key findings

- Efficiently solves large-scale tree ensemble optimization problems.
- Outperforms heuristic methods in case studies.
- Successfully applies to drug design and pricing scenarios.

## Abstract

Tree ensemble models such as random forests and boosted trees are among the most widely used and practically successful predictive models in applied machine learning and business analytics. Although such models have been used to make predictions based on exogenous, uncontrollable independent variables, they are increasingly being used to make predictions where the independent variables are controllable and are also decision variables. In this paper, we study the problem of tree ensemble optimization: given a tree ensemble that predicts some dependent variable using controllable independent variables, how should we set these variables so as to maximize the predicted value? We formulate the problem as a mixed-integer optimization problem. We theoretically examine the strength of our formulation, provide a hierarchy of approximate formulations with bounds on approximation quality and exploit the structure of the problem to develop two large-scale solution methods, one based on Benders decomposition and one based on iteratively generating tree split constraints. We test our methodology on real data sets, including two case studies in drug design and customized pricing, and show that our methodology can efficiently solve large-scale instances to near or full optimality, and outperforms solutions obtained by heuristic approaches. In our drug design case, we show how our approach can identify compounds that efficiently trade-off predicted performance and novelty with respect to existing, known compounds. In our customized pricing case, we show how our approach can efficiently determine optimal store-level prices under a random forest model that delivers excellent predictive accuracy.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1705.10883/full.md

## Figures

12 figures with captions in the complete paper: https://tomesphere.com/paper/1705.10883/full.md

## References

52 references — full list in the complete paper: https://tomesphere.com/paper/1705.10883/full.md

---
Source: https://tomesphere.com/paper/1705.10883