{"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/bayesian-optimization-of-combinatorial","title":"Bayesian Optimization of Combinatorial Structures","arxiv_id":"1806.08838","date":"2018-06-22","proceeding":"ICML 2018 7","authors":["Ricardo Baptista","Matthias Poloczek"],"abstract":"The optimization of expensive-to-evaluate black-box functions over\ncombinatorial structures is an ubiquitous task in machine learning, engineering\nand the natural sciences. The combinatorial explosion of the search space and\ncostly evaluations pose challenges for current techniques in discrete\noptimization and machine learning, and critically require new algorithmic\nideas. This article proposes, to the best of our knowledge, the first algorithm\nto overcome these challenges, based on an adaptive, scalable model that\nidentifies useful combinatorial structure even when data is scarce. Our\nacquisition function pioneers the use of semidefinite programming to achieve\nefficiency and scalability. Experimental evaluations demonstrate that this\nalgorithm consistently outperforms other methods from combinatorial and\nBayesian optimization.","url_abs":"http://arxiv.org/abs/1806.08838v2","url_pdf":"http://arxiv.org/pdf/1806.08838v2.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":"bayesian-optimization-of-combinatorial","repo_url":"https://github.com/baptistar/BOCS","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"bayesian-optimization-of-combinatorial","repo_url":"https://github.com/aryandeshwal/Submodular_Relaxation_BOCS","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"GPL-3.0"}}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"bayesian-optimization","task_name":"Bayesian Optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1806.08838","atlas_url":"https://app.syntology.ai/?focus=1806.08838","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":"1806.08838"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1806.08838\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1806.08838"},"call":"get_concepts_for_paper(arxiv_id=\"1806.08838\")"}],"by_repo":[{"repo":"baptistar/BOCS","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"aryandeshwal/Submodular_Relaxation_BOCS","kind":"listed","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":"8d2de8a9c952de5af919374331f1e52de49fd1b59c9a9fd7b05064d6b1421e74","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}