{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/a-general-framework-for-constrained-bayesian","title":"A General Framework for Constrained Bayesian Optimization using Information-based Search","arxiv_id":"1511.09422","date":"2015-11-30","proceeding":null,"authors":["José Miguel Hernández-Lobato","Michael A. Gelbart","Ryan P. Adams","Matthew W. Hoffman","Zoubin Ghahramani"],"abstract":"We present an information-theoretic framework for solving global black-box\noptimization problems that also have black-box constraints. Of particular\ninterest to us is to efficiently solve problems with decoupled constraints, in\nwhich subsets of the objective and constraint functions may be evaluated\nindependently. For example, when the objective is evaluated on a CPU and the\nconstraints are evaluated independently on a GPU. These problems require an\nacquisition function that can be separated into the contributions of the\nindividual function evaluations. We develop one such acquisition function and\ncall it Predictive Entropy Search with Constraints (PESC). PESC is an\napproximation to the expected information gain criterion and it compares\nfavorably to alternative approaches based on improvement in several synthetic\nand real-world problems. In addition to this, we consider problems with a mix\nof functions that are fast and slow to evaluate. These problems require\nbalancing the amount of time spent in the meta-computation of PESC and in the\nactual evaluation of the target objective. We take a bounded rationality\napproach and develop partial update for PESC which trades off accuracy against\nspeed. We then propose a method for adaptively switching between the partial\nand full updates for PESC. This allows us to interpolate between versions of\nPESC that are efficient in terms of function evaluations and those that are\nefficient in terms of wall-clock time. Overall, we demonstrate that PESC is an\neffective algorithm that provides a promising direction towards a unified\nsolution for constrained Bayesian optimization.","url_abs":"http://arxiv.org/abs/1511.09422v2","url_pdf":"http://arxiv.org/pdf/1511.09422v2.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":"a-general-framework-for-constrained-bayesian","repo_url":"https://github.com/HIPS/Spearmint","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"bayesian-optimization","task_name":"Bayesian Optimization"},{"task_slug":null,"task_name":"CPU"},{"task_slug":null,"task_name":"GPU"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1511.09422","atlas_url":"https://app.syntology.ai/?focus=1511.09422","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1511.09422"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1511.09422\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1511.09422"},"call":"get_concepts_for_paper(arxiv_id=\"1511.09422\")"}],"by_repo":[{"repo":"HIPS/Spearmint","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"b92d63f178bb976587a3423cd30a03bc8ceb698c55dbd61bd896a9b76f0642b6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}