mlsanityData to 7 Oct 2026

Tree Ensembles for Contextual Bandits

arXiv 2402.06963 ↗First posted 10 Feb 2024cs.LG cs.AI stat.MLcited by 3

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 14 of its 38 references that are in the map. First posted on arXiv 10 Feb 2024.

Builds on

14 of 38 references.

References · 14

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  2. 2021Revisiting Deep Learning Models for Tabular Datacited by 725
  3. 2021Deep Neural Networks and Tabular Data: A Surveycited by 489
  4. 2019Introduction to Multi-Armed Banditscited by 475
  5. 2017A Tutorial on Thompson Samplingcited by 420
  6. 2013Learning to Optimize Via Posterior Samplingcited by 253
  7. 2020Neural Thompson Samplingcited by 127
  8. 2021Epistemic Neural Networkscited by 120
  9. 2017Ensemble Samplingcited by 62
  10. 2023Scalable Neural Contextual Bandit for Recommender Systemscited by 12
  11. 2015Random Forest for the Contextual Bandit Problem - extended versioncited by 11
  12. 2021Online Learning of Energy Consumption for Navigation of Electric Vehiclescited by 7
2 more
  1. 2013Generalized Thompson Sampling for Contextual Banditscited by 5
  2. 2022A Contextual Combinatorial Semi-Bandit Approach to Network Bottleneck Identificationcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 3.

3 papers.