{"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/boundary-exploration-for-bayesian","title":"Boundary Exploration for Bayesian Optimization With Unknown Physical Constraints","arxiv_id":"2402.07692","date":"2024-02-12","proceeding":null,"authors":["Yunsheng Tian","Ane Zuniga","Xinwei Zhang","Johannes P. Dürholt","Payel Das","Jie Chen","Wojciech Matusik","Mina Konaković Luković"],"abstract":"Bayesian optimization has been successfully applied to optimize black-box functions where the number of evaluations is severely limited. However, in many real-world applications, it is hard or impossible to know in advance which designs are feasible due to some physical or system limitations. These issues lead to an even more challenging problem of optimizing an unknown function with unknown constraints. In this paper, we observe that in such scenarios optimal solution typically lies on the boundary between feasible and infeasible regions of the design space, making it considerably more difficult than that with interior optima. Inspired by this observation, we propose BE-CBO, a new Bayesian optimization method that efficiently explores the boundary between feasible and infeasible designs. To identify the boundary, we learn the constraints with an ensemble of neural networks that outperform the standard Gaussian Processes for capturing complex boundaries. Our method demonstrates superior performance against state-of-the-art methods through comprehensive experiments on synthetic and real-world benchmarks. Code available at: https://github.com/yunshengtian/BE-CBO","url_abs":"https://arxiv.org/abs/2402.07692v2","url_pdf":"https://arxiv.org/pdf/2402.07692v2.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":"boundary-exploration-for-bayesian","repo_url":"https://github.com/yunshengtian/be-cbo","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"bayesian-optimization","task_name":"Bayesian Optimization"},{"task_slug":"gaussian-processes","task_name":"Gaussian Processes"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2402.07692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.07692"}},"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/yunshengtian/be-cbo","reach":null}],"summary":{"ran_draft_wrong":3},"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":"9abb12fd50a515b0","entry":"get_constr_lb_dynamic","repo":"yunshengtian/be-cbo","repo_kind":"official","path":"algorithms/becbo/becbo.py","file_url":"https://github.com/yunshengtian/be-cbo/blob/HEAD/algorithms/becbo/becbo.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9abb12fd50a515b0"}},{"code_sha256_prefix":"76cddc42dc13c6f1","entry":"get_feasible_band","repo":"yunshengtian/be-cbo","repo_kind":"official","path":"algorithms/becbo/becbo.py","file_url":"https://github.com/yunshengtian/be-cbo/blob/HEAD/algorithms/becbo/becbo.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"76cddc42dc13c6f1"}},{"code_sha256_prefix":"46574ad4dce4d3d7","entry":"get_feasible_prob","repo":"yunshengtian/be-cbo","repo_kind":"official","path":"algorithms/becbo/becbo.py","file_url":"https://github.com/yunshengtian/be-cbo/blob/HEAD/algorithms/becbo/becbo.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"46574ad4dce4d3d7"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}