Preferential Bayesian optimisation with Skew Gaussian Processes
Alessio Benavoli, Dario Azzimonti, Dario Piga

TL;DR
This paper introduces an exact Skew Gaussian Process model for Preferential Bayesian Optimisation, demonstrating improved convergence and computational efficiency over traditional Laplace approximation methods.
Contribution
It derives an exact SkewGP posterior for preference functions and applies it to Bayesian optimisation, outperforming Laplace-based methods in speed and accuracy.
Findings
SkewGP provides a more accurate posterior than Laplace approximation.
Exact SkewGP-based PBO outperforms Laplace-based PBO in experiments.
Framework extends to mixed preference and categorical judgments.
Abstract
Preferential Bayesian optimisation (PBO) deals with optimisation problems where the objective function can only be accessed via preference judgments, such as "this is better than that" between two candidate solutions (like in A/B tests or recommender systems). The state-of-the-art approach to PBO uses a Gaussian process to model the preference function and a Bernoulli likelihood to model the observed pairwise comparisons. Laplace's method is then employed to compute posterior inferences and, in particular, to build an appropriate acquisition function. In this paper, we prove that the true posterior distribution of the preference function is a Skew Gaussian Process (SkewGP), with highly skewed pairwise marginals and, thus, show that Laplace's method usually provides a very poor approximation. We then derive an efficient method to compute the exact SkewGP posterior and use it as surrogate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsGaussian Process
