Adaptive KappaSharp: Condition-Number Shaping for Preferential Bayesian Optimization
Not on the map. Why?
Abstract (arXiv)
Preferential Bayesian optimization (PBO) optimizes objectives accessible only through pairwise user comparisons. The standard approach fits a Gaussian process surrogate for observed pairwise comparisons (PairwiseGP) using the Laplace approximation and selects queries with the Expected Utility of Best Option (EUBO) acquisition function. EUBO queries new candidates at each step, producing pairs that share no candidates with previous queries. Each such pair forms an isolated component in the comparison graph, removing one degree of freedom from the likelihood Hessian and making it rank-deficient. This deficiency is structural and cannot be resolved by changing the surrogate modeling approach. Existing approaches to remedy this issue either waste query budget by forcing comparisons to stay connected, or apply uniform regularization that also perturbs directions already well-constrained by the observed comparisons. We propose KappaSharp that enables a diagonal correction to the Hessian to reduce its condition number, with larger corrections where the prior uncertainty is higher. The correction is only applied in the model fitting step, not query selection. An adaptive variant of KappaSharp is also presented that activates the correction only when the surrogate is confident about recent comparisons, avoiding unnecessary corrections when the problem is well-conditioned. On 11 benchmarks (5--20 dimensions), including a 16-dimensional controller tuning problem in plasma medicine, Adaptive KappaSharp outperforms the standard PBO baseline, with up to +10.9% (p=0.003).
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 12 of its 19 references that are in the map. First posted on arXiv 8 Aug 2026.
Builds on
12 of 19 references.
References · 12
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2017Preferential Bayesian Optimizationcited by 74
- 2015Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependencecited by 61
- 2022Preference Exploration for Efficient Bayesian Optimization with Multiple Outcomescited by 42
- 2019Preference-Based Learning for Exoskeleton Gait Optimizationcited by 24
- 2023qEUBO: A Decision-Theoretic Acquisition Function for Preferential Bayesian Optimizationcited by 23
- 2020Projective Preferential Bayesian Optimizationcited by 22
- 2023Towards Practical Preferential Bayesian Optimization with Skew Gaussian Processescited by 19
- 2020Preferential Bayesian optimisation with Skew Gaussian Processescited by 18
- 2024Principled Preferential Bayesian Optimizationcited by 16
- 2023Iterative Methods for Vecchia-Laplace Approximations for Latent Gaussian Process Modelscited by 6
- 2017Laplace approximation and the natural gradient for Gaussian process regression with the heteroscedastic Student-t modelcited by 5
Built on by
Not cited yet.