{"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/qeubo-a-decision-theoretic-acquisition","title":"qEUBO: A Decision-Theoretic Acquisition Function for Preferential Bayesian Optimization","arxiv_id":"2303.15746","date":"2023-03-28","proceeding":null,"authors":["Raul Astudillo","Zhiyuan Jerry Lin","Eytan Bakshy","Peter I. Frazier"],"abstract":"Preferential Bayesian optimization (PBO) is a framework for optimizing a decision maker's latent utility function using preference feedback. This work introduces the expected utility of the best option (qEUBO) as a novel acquisition function for PBO. When the decision maker's responses are noise-free, we show that qEUBO is one-step Bayes optimal and thus equivalent to the popular knowledge gradient acquisition function. We also show that qEUBO enjoys an additive constant approximation guarantee to the one-step Bayes-optimal policy when the decision maker's responses are corrupted by noise. We provide an extensive evaluation of qEUBO and demonstrate that it outperforms the state-of-the-art acquisition functions for PBO across many settings. Finally, we show that, under sufficient regularity conditions, qEUBO's Bayesian simple regret converges to zero at a rate $o(1/n)$ as the number of queries, $n$, goes to infinity. In contrast, we show that simple regret under qEI, a popular acquisition function for standard BO often used for PBO, can fail to converge to zero. Enjoying superior performance, simple computation, and a grounded decision-theoretic justification, qEUBO is a promising acquisition function for PBO.","url_abs":"https://arxiv.org/abs/2303.15746v1","url_pdf":"https://arxiv.org/pdf/2303.15746v1.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":"qeubo-a-decision-theoretic-acquisition","repo_url":"https://github.com/facebookresearch/qeubo","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"bayesian-optimization","task_name":"Bayesian Optimization"}],"methods":[{"method_slug":"fail","method_name":"fail"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2303.15746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.15746"}},"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/facebookresearch/qeubo","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":5},"by_repo_kind":{"official":{"samples":5,"ran":0,"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":5,"samples":[{"code_sha256_prefix":"b73f115b66402a50","entry":"generate_initial_data","repo":"facebookresearch/qeubo","repo_kind":"official","path":"src/utils.py","file_url":"https://github.com/facebookresearch/qeubo/blob/HEAD/src/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"mcp_get_code":{"code_sha256":"b73f115b66402a50"}},{"code_sha256_prefix":"177d80b2020dfdc9","entry":"generate_random_queries","repo":"facebookresearch/qeubo","repo_kind":"official","path":"src/utils.py","file_url":"https://github.com/facebookresearch/qeubo/blob/HEAD/src/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"mcp_get_code":{"code_sha256":"177d80b2020dfdc9"}},{"code_sha256_prefix":"cc7bbd15b3d8ee6d","entry":"obj_func","repo":"facebookresearch/qeubo","repo_kind":"official","path":"experiments/ackley_runner.py","file_url":"https://github.com/facebookresearch/qeubo/blob/HEAD/experiments/ackley_runner.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"mcp_get_code":{"code_sha256":"cc7bbd15b3d8ee6d"}},{"code_sha256_prefix":"2c3de6f3aad9ffd6","entry":"obj_func","repo":"facebookresearch/qeubo","repo_kind":"official","path":"experiments/alpine1_runner.py","file_url":"https://github.com/facebookresearch/qeubo/blob/HEAD/experiments/alpine1_runner.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"mcp_get_code":{"code_sha256":"2c3de6f3aad9ffd6"}},{"code_sha256_prefix":"d4d12fe36c69e181","entry":"obj_func","repo":"facebookresearch/qeubo","repo_kind":"official","path":"experiments/hartmann_runner.py","file_url":"https://github.com/facebookresearch/qeubo/blob/HEAD/experiments/hartmann_runner.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"mcp_get_code":{"code_sha256":"d4d12fe36c69e181"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}