Tree Ensembles for Contextual Bandits

Hannes Nilsson, Rikard Johansson, Niklas Åkerblom, Morteza Haghir Chehreghani
2/10/2024
cs.LGcs.AIstat.ML

No official code found. Best implementation: HannesNilsson/tree_ensemble_bandits (0 stars, Apache-2.0, last commit 2025-11-30).

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.

View on arXivView PDF

Code Implementations(1)

Apache-2.0

Code for reproducing experiments in paper 'Tree Ensembles for Contextual Bandits'

00Shell, PythonNov 7, 202510 months agoApache-2.0

Similar Papers

Cite this paper

@article{nilsson2024tree,
  title  = {Tree Ensembles for Contextual Bandits},
  author = {Hannes Nilsson and Rikard Johansson and Niklas Åkerblom and Morteza Haghir Chehreghani},
  year   = {2024},
  eprint = {2402.06963},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2402.06963v3}
}

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/2402.06963.svg)](https://codeofpaper.com/paper/2402.06963)

Discussion