{"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/optimization-fast-and-slow-optimally","title":"Optimization, fast and slow: optimally switching between local and Bayesian optimization","arxiv_id":"1805.08610","date":"2018-05-22","proceeding":"ICML 2018 7","authors":["Mark McLeod","Michael A. Osborne","Stephen J. Roberts"],"abstract":"We develop the first Bayesian Optimization algorithm, BLOSSOM, which selects\nbetween multiple alternative acquisition functions and traditional local\noptimization at each step. This is combined with a novel stopping condition\nbased on expected regret. This pairing allows us to obtain the best\ncharacteristics of both local and Bayesian optimization, making efficient use\nof function evaluations while yielding superior convergence to the global\nminimum on a selection of optimization problems, and also halting optimization\nonce a principled and intuitive stopping condition has been fulfilled.","url_abs":"http://arxiv.org/abs/1805.08610v1","url_pdf":"http://arxiv.org/pdf/1805.08610v1.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":"optimization-fast-and-slow-optimally","repo_url":"https://github.com/markm541374/gpbo","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"bayesian-optimization","task_name":"Bayesian Optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1805.08610","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.08610"}},"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/markm541374/gpbo","reach":null}],"summary":{"unverified":1},"by_repo_kind":{"official":{"samples":1,"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":1,"samples":[{"code_sha256_prefix":"ba2f344650d0a42a","entry":"f","repo":"markm541374/gpbo","repo_kind":"official","path":"gpbo/examples/eihypdemo.py","file_url":"https://github.com/markm541374/gpbo/blob/HEAD/gpbo/examples/eihypdemo.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"mcp_get_code":{"code_sha256":"ba2f344650d0a42a"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}