{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/towards-practical-preferential-bayesian","title":"Towards Practical Preferential Bayesian Optimization with Skew Gaussian Processes","arxiv_id":"2302.01513","date":"2023-02-03","proceeding":null,"authors":["Shion Takeno","Masahiro Nomura","Masayuki Karasuyama"],"abstract":"We study preferential Bayesian optimization (BO) where reliable feedback is limited to pairwise comparison called duels. An important challenge in preferential BO, which uses the preferential Gaussian process (GP) model to represent flexible preference structure, is that the posterior distribution is a computationally intractable skew GP. The most widely used approach for preferential BO is Gaussian approximation, which ignores the skewness of the true posterior. Alternatively, Markov chain Monte Carlo (MCMC) based preferential BO is also proposed. In this work, we first verify the accuracy of Gaussian approximation, from which we reveal the critical problem that the predictive probability of duels can be inaccurate. This observation motivates us to improve the MCMC-based estimation for skew GP, for which we show the practical efficiency of Gibbs sampling and derive the low variance MC estimator. However, the computational time of MCMC can still be a bottleneck in practice. Towards building a more practical preferential BO, we develop a new method that achieves both high computational efficiency and low sample complexity, and then demonstrate its effectiveness through extensive numerical experiments.","url_abs":"https://arxiv.org/abs/2302.01513v2","url_pdf":"https://arxiv.org/pdf/2302.01513v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"towards-practical-preferential-bayesian","repo_url":"https://github.com/CyberAgentAILab/preferentialBO","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"bayesian-optimization","task_name":"Bayesian Optimization"},{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"},{"task_slug":"gaussian-processes","task_name":"Gaussian Processes"}],"methods":[{"method_slug":"gaussian-process","method_name":"Gaussian Process"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2302.01513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.01513"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/CyberAgentAILab/preferentialBO","reach":null}],"summary":{"ran_fixture":1,"ran_violates":1,"ran_honours":1},"by_repo_kind":{"official":{"samples":3,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"f98ab87d983f94c3","entry":"minimize","repo":"CyberAgentAILab/preferentialBO","repo_kind":"official","path":"src/preferential_bayesian_opt.py","file_url":"https://github.com/CyberAgentAILab/preferentialBO/blob/HEAD/src/preferential_bayesian_opt.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f98ab87d983f94c3"}},{"code_sha256_prefix":"81384ca52f8196ea","entry":"normcdf","repo":"CyberAgentAILab/preferentialBO","repo_kind":"official","path":"src/preferential_bayesian_opt.py","file_url":"https://github.com/CyberAgentAILab/preferentialBO/blob/HEAD/src/preferential_bayesian_opt.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"81384ca52f8196ea"}},{"code_sha256_prefix":"6fc7ee2f83da1f75","entry":"normpdf","repo":"CyberAgentAILab/preferentialBO","repo_kind":"official","path":"src/preferential_bayesian_opt.py","file_url":"https://github.com/CyberAgentAILab/preferentialBO/blob/HEAD/src/preferential_bayesian_opt.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"6fc7ee2f83da1f75"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}