{"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/bayesian-optimization-of-functions-over-node","title":"Bayesian Optimization of Functions over Node Subsets in Graphs","arxiv_id":"2405.15119","date":"2024-05-24","proceeding":null,"authors":["Huidong Liang","Xingchen Wan","Xiaowen Dong"],"abstract":"We address the problem of optimizing over functions defined on node subsets in a graph. The optimization of such functions is often a non-trivial task given their combinatorial, black-box and expensive-to-evaluate nature. Although various algorithms have been introduced in the literature, most are either task-specific or computationally inefficient and only utilize information about the graph structure without considering the characteristics of the function. To address these limitations, we utilize Bayesian Optimization (BO), a sample-efficient black-box solver, and propose a novel framework for combinatorial optimization on graphs. More specifically, we map each $k$-node subset in the original graph to a node in a new combinatorial graph and adopt a local modeling approach to efficiently traverse the latter graph by progressively sampling its subgraphs using a recursive algorithm. Extensive experiments under both synthetic and real-world setups demonstrate the effectiveness of the proposed BO framework on various types of graphs and optimization tasks, where its behavior is analyzed in detail with ablation studies.","url_abs":"https://arxiv.org/abs/2405.15119v2","url_pdf":"https://arxiv.org/pdf/2405.15119v2.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-functions-over-node","repo_url":"https://github.com/LeonResearch/GraphComBO","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"bayesian-optimization","task_name":"Bayesian Optimization"},{"task_slug":"combinatorial-optimization","task_name":"Combinatorial Optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2405.15119","atlas_url":"https://app.syntology.ai/?focus=2405.15119","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.15119"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+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":"deterministic:regex_extraction","url":"https://github.com/LeonResearch/GraphComBO","reach":{"status":"ok"}}],"summary":{"ran":9,"unverified":2},"by_repo_kind":{"official":{"samples":11,"ran":9,"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":11,"samples":[{"code_sha256_prefix":"fed6c522abcdaa2a","entry":"ComboEdge_Indicator","repo":"LeonResearch/GraphComBO","repo_kind":"official","path":"search/recursive_sampling.py","file_url":"https://github.com/LeonResearch/GraphComBO/blob/HEAD/search/recursive_sampling.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"fed6c522abcdaa2a"}},{"code_sha256_prefix":"de6d5c8a546920ab","entry":"ComboSubgraph_Constructor","repo":"LeonResearch/GraphComBO","repo_kind":"official","path":"search/recursive_sampling.py","file_url":"https://github.com/LeonResearch/GraphComBO/blob/HEAD/search/recursive_sampling.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"de6d5c8a546920ab"}},{"code_sha256_prefix":"05c459b4d6a6c0a4","entry":"IC","repo":"LeonResearch/GraphComBO","repo_kind":"official","path":"problems/IC.py","file_url":"https://github.com/LeonResearch/GraphComBO/blob/HEAD/problems/IC.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"05c459b4d6a6c0a4"}},{"code_sha256_prefix":"4991f1a80065bfd3","entry":"IC_MC","repo":"LeonResearch/GraphComBO","repo_kind":"official","path":"problems/IC.py","file_url":"https://github.com/LeonResearch/GraphComBO/blob/HEAD/problems/IC.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"4991f1a80065bfd3"}},{"code_sha256_prefix":"f1e900de7d256cf4","entry":"NeighborFinder","repo":"LeonResearch/GraphComBO","repo_kind":"official","path":"search/recursive_sampling.py","file_url":"https://github.com/LeonResearch/GraphComBO/blob/HEAD/search/recursive_sampling.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"f1e900de7d256cf4"}},{"code_sha256_prefix":"2014bb900dcbe8e2","entry":"SIR_MC","repo":"LeonResearch/GraphComBO","repo_kind":"official","path":"problems/SIR.py","file_url":"https://github.com/LeonResearch/GraphComBO/blob/HEAD/problems/SIR.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"2014bb900dcbe8e2"}},{"code_sha256_prefix":"6373cef8e02fc725","entry":"create_path","repo":"LeonResearch/GraphComBO","repo_kind":"official","path":"create_path.py","file_url":"https://github.com/LeonResearch/GraphComBO/blob/HEAD/create_path.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"6373cef8e02fc725"}},{"code_sha256_prefix":"16dd8d0d6c04475b","entry":"get_initial_status","repo":"LeonResearch/GraphComBO","repo_kind":"official","path":"problems/SIR.py","file_url":"https://github.com/LeonResearch/GraphComBO/blob/HEAD/problems/SIR.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"16dd8d0d6c04475b"}},{"code_sha256_prefix":"26247306194df274","entry":"propagate","repo":"LeonResearch/GraphComBO","repo_kind":"official","path":"problems/IC.py","file_url":"https://github.com/LeonResearch/GraphComBO/blob/HEAD/problems/IC.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"26247306194df274"}},{"code_sha256_prefix":"e2ff191c94d35c4f","entry":"get_acqf","repo":"LeonResearch/GraphComBO","repo_kind":"official","path":"search/models.py","file_url":"https://github.com/LeonResearch/GraphComBO/blob/HEAD/search/models.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"e2ff191c94d35c4f"}},{"code_sha256_prefix":"a8306dc3ab0f7058","entry":"optimize_acqf","repo":"LeonResearch/GraphComBO","repo_kind":"official","path":"search/models.py","file_url":"https://github.com/LeonResearch/GraphComBO/blob/HEAD/search/models.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"a8306dc3ab0f7058"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}