English

Tree Ensembles for Contextual Bandits

Machine Learning 2025-12-04 v3 Artificial Intelligence Machine Learning

Abstract

We propose a new framework for contextual multi-armed bandits based on tree ensembles. Our framework adapts two widely used bandit methods, Upper Confidence Bound and Thompson Sampling, for both standard and combinatorial settings. As part of this framework, we propose a novel method of estimating the uncertainty in tree ensemble predictions. We further demonstrate the effectiveness of our framework via several experimental studies, employing XGBoost and random forests, two popular tree ensemble methods. Compared to state-of-the-art methods based on decision trees and neural networks, our methods exhibit superior performance in terms of both regret minimization and computational runtime, when applied to benchmark datasets and the real-world application of navigation over road networks.

Keywords

Cite

@article{arxiv.2402.06963,
  title  = {Tree Ensembles for Contextual Bandits},
  author = {Hannes Nilsson and Rikard Johansson and Niklas Åkerblom and Morteza Haghir Chehreghani},
  journal= {arXiv preprint arXiv:2402.06963},
  year   = {2025}
}

Comments

The first two authors contributed equally to this work

R2 v1 2026-06-28T14:44:56.262Z