mlsanityData to 7 Oct 2026

DT-PBO: an Interpretable Tree-based Surrogate Model for Preferential Bayesian Optimization

arXiv 2512.14263 ↗First posted 16 Dec 2025cs.LG cs.AI math.OCcited by 0

Not on the map. Why?

Abstract (arXiv)

Preferential Bayesian Optimization (PBO) aims to find a decision-maker's most preferred solution in as few pairwise comparisons as possible. Existing approaches rely on Gaussian Process (GP) surrogates, which provide strong performance but limited interpretability. This limits real-world usability in high-stakes domains, such as healthcare, where interpretability and trust are essential. We propose DT-PBO, a novel tree-based surrogate model for PBO that is inherently interpretable while capturing preference uncertainty. Specifically, we introduce a novel splitting heuristic that constructs interpretable shallow decision trees directly from pairwise comparison data, and use Laplace approximation to obtain probabilistic estimates for each leaf. This enables efficient preference modeling without sacrificing interpretability. Across eight benchmark functions, our method achieves competitive convergence to GP-based PBO, particularly on functions with rugged optimization landscapes. Additional experiments show robustness against noise and a fast computational running time. Experiments on real-world datasets further demonstrate that our model provides interpretable insights into decision-maker preferences that would remain opaque under GP-based approaches.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 20 of its 56 references that are in the map. First posted on arXiv 16 Dec 2025.

Builds on

20 of 56 references.

References · 20

  1. 2017On Kernelized Multi-armed Banditscited by 348
  2. 2013Expectation Propagation for approximate Bayesian inferencecited by 172
  3. 2018Preference-based Online Learning with Dueling Bandits: A Surveycited by 100
  4. 2017Preferential Bayesian Optimizationcited by 72
  5. 2014Reducing Dueling Bandits to Cardinal Banditscited by 62
  6. 2019Bayesian Optimisation over Multiple Continuous and Categorical Inputscited by 55
  7. 2017Multi-dueling Bandits with Dependent Armscited by 35
  8. 2022Stochastic Contextual Dueling Bandits under Linear Stochastic Transitivity Modelscited by 35
  9. 2023qEUBO: A Decision-Theoretic Acquisition Function for Preferential Bayesian Optimizationcited by 23
  10. 2024Feel-Good Thompson Sampling for Contextual Dueling Banditscited by 23
  11. 2020Top-k Ranking Bayesian Optimizationcited by 21
  12. 2023Towards Practical Preferential Bayesian Optimization with Skew Gaussian Processescited by 19
8 more
  1. 2020Preferential Batch Bayesian Optimizationcited by 18
  2. 2020Preferential Bayesian optimisation with Skew Gaussian Processescited by 18
  3. 2018Ordered Preference Elicitation Strategies for Supporting Multi-Objective Decision Makingcited by 17
  4. 2024Explaining Bayesian Optimization by Shapley Values Facilitates Human-AI Collaborationcited by 12
  5. 2021Efficient Exploration in Binary and Preferential Bayesian Optimizationcited by 5
  6. 2024A tutorial on learning from preferences and choices with Gaussian Processescited by 4
  7. 2020Certified Global Minima for a Benchmark of Difficult Optimization Problemscited by 3
  8. 2025Comparative Explanations: Explanation Guided Decision Making for Human-in-the-Loop Preference Selectioncited by 2

Built on by

Not cited yet.