{"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/training-greedy-policy-for-proposal-batch","title":"Training Greedy Policy for Proposal Batch Selection in Expensive Multi-Objective Combinatorial Optimization","arxiv_id":"2406.14876","date":"2024-06-21","proceeding":null,"authors":["Deokjae Lee","Hyun Oh Song","Kyunghyun Cho"],"abstract":"Active learning is increasingly adopted for expensive multi-objective combinatorial optimization problems, but it involves a challenging subset selection problem, optimizing the batch acquisition score that quantifies the goodness of a batch for evaluation. Due to the excessively large search space of the subset selection problem, prior methods optimize the batch acquisition on the latent space, which has discrepancies with the actual space, or optimize individual acquisition scores without considering the dependencies among candidates in a batch instead of directly optimizing the batch acquisition. To manage the vast search space, a simple and effective approach is the greedy method, which decomposes the problem into smaller subproblems, yet it has difficulty in parallelization since each subproblem depends on the outcome from the previous ones. To this end, we introduce a novel greedy-style subset selection algorithm that optimizes batch acquisition directly on the combinatorial space by sequential greedy sampling from the greedy policy, specifically trained to address all greedy subproblems concurrently. Notably, our experiments on the red fluorescent proteins design task show that our proposed method achieves the baseline performance in 1.69x fewer queries, demonstrating its efficiency.","url_abs":"https://arxiv.org/abs/2406.14876v1","url_pdf":"https://arxiv.org/pdf/2406.14876v1.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":"training-greedy-policy-for-proposal-batch","repo_url":"https://github.com/snu-mllab/greedypolicyformoco","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"active-learning","task_name":"Active Learning"},{"task_slug":"combinatorial-optimization","task_name":"Combinatorial Optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2406.14876","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14876"}},"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":"deterministic:regex_extraction","url":"https://github.com/snu-mllab/GreedyPolicyForMOCO","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/snu-mllab/greedypolicyformoco","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran_honours":1,"ran":3,"unverified":1},"by_repo_kind":{"official":{"samples":5,"ran":4,"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":"0c9ba72808a75f12","entry":"combine_arrays","repo":"snu-mllab/greedypolicyformoco","repo_kind":"official","path":"setbench/algorithms/greedyrl.py","file_url":"https://github.com/snu-mllab/greedypolicyformoco/blob/HEAD/setbench/algorithms/greedyrl.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"0c9ba72808a75f12"}},{"code_sha256_prefix":"17e3999e128860fc","entry":"fused_swish","repo":"snu-mllab/GreedyPolicyForMOCO","repo_kind":"official","path":"setbench/models/masked_layers.py","file_url":"https://github.com/snu-mllab/GreedyPolicyForMOCO/blob/HEAD/setbench/models/masked_layers.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"17e3999e128860fc"}},{"code_sha256_prefix":"bdc16d26839fcb40","entry":"get_best_hv","repo":"snu-mllab/GreedyPolicyForMOCO","repo_kind":"official","path":"agg_scripts/agg_single_example.py","file_url":"https://github.com/snu-mllab/GreedyPolicyForMOCO/blob/HEAD/agg_scripts/agg_single_example.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"bdc16d26839fcb40"}},{"code_sha256_prefix":"ef1fe8afc34b157c","entry":"load_state","repo":"snu-mllab/GreedyPolicyForMOCO","repo_kind":"official","path":"agg_scripts/agg_single_example.py","file_url":"https://github.com/snu-mllab/GreedyPolicyForMOCO/blob/HEAD/agg_scripts/agg_single_example.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ef1fe8afc34b157c"}},{"code_sha256_prefix":"cc24690fd7d5598a","entry":"init_run","repo":"snu-mllab/greedypolicyformoco","repo_kind":"official","path":"run_scripts/run_single.py","file_url":"https://github.com/snu-mllab/greedypolicyformoco/blob/HEAD/run_scripts/run_single.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"cc24690fd7d5598a"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}