{"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":"/task/combinatorial-optimization/papers/ran/1","list_of":"/task/combinatorial-optimization","task":"Combinatorial Optimization","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":2,"rows_per_page":100,"rows":[1,100],"of":122,"counts":{"archive_papers_tagged":1277,"with_a_code_link":401,"where_syntology_ran_a_sample":122,"not_listed_spam_title":0,"listed":1277,"listed_where_code_ran":122,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":105,"every_run_a_failure_of_syntologys_instrument":17,"listed_with_a_run_with_no_instrument_failure":105,"listed_every_run_a_failure_of_syntologys_instrument":17,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/combinatorial-optimization/papers/ran/1","prev":null,"next":"/task/combinatorial-optimization/papers/ran/2","papers":[{"url":"/paper/on-training-test-mis-alignment-in","slug":"on-training-test-mis-alignment-in","title":"On Training-Test (Mis)alignment in Unsupervised Combinatorial Optimization: Observation, Empirical Exploration, and Analysis","date":"2025-06-20","arxiv_id":"2506.16732","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-training-test-mis-alignment-in#ran","syntology_url":"https://syntology.ai/paper/2506.16732","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.16732"}},"official":{"repos":["bokveizen/uco_derand"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/heurigym-an-agentic-benchmark-for-llm-crafted","slug":"heurigym-an-agentic-benchmark-for-llm-crafted","title":"HeuriGym: An Agentic Benchmark for LLM-Crafted Heuristics in Combinatorial Optimization","date":"2025-06-09","arxiv_id":"2506.07972","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/heurigym-an-agentic-benchmark-for-llm-crafted#ran","syntology_url":"https://syntology.ai/paper/2506.07972","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.07972"}},"official":{"repos":["cornell-zhang/heurigym"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/latent-guided-sampling-for-combinatorial","slug":"latent-guided-sampling-for-combinatorial","title":"Latent Guided Sampling for Combinatorial Optimization","date":"2025-06-04","arxiv_id":"2506.03672","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/latent-guided-sampling-for-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2506.03672","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.03672"}},"official":{"repos":["SobihanSurendran/LGS"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-neural-combinatorial-optimization","slug":"rethinking-neural-combinatorial-optimization","title":"Rethinking Neural Combinatorial Optimization for Vehicle Routing Problems with Different Constraint Tightness Degrees","date":"2025-05-30","arxiv_id":"2505.24627","repositories_listed":0,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/rethinking-neural-combinatorial-optimization#ran","syntology_url":"https://syntology.ai/paper/2505.24627","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.24627"}},"official":null}},{"url":"/paper/generalizable-heuristic-generation-through","slug":"generalizable-heuristic-generation-through","title":"Generalizable Heuristic Generation Through Large Language Models with Meta-Optimization","date":"2025-05-27","arxiv_id":"2505.20881","repositories_listed":0,"syntology":{"n":13,"n_ran":9,"n_constructed":2,"n_ran_checked":3,"n_instrument":6,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"9 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 6 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/generalizable-heuristic-generation-through#ran","syntology_url":"https://syntology.ai/paper/2505.20881","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.20881"}},"official":null}},{"url":"/paper/graph-supported-dynamic-algorithm","slug":"graph-supported-dynamic-algorithm","title":"Graph-Supported Dynamic Algorithm Configuration for Multi-Objective Combinatorial Optimization","date":"2025-05-22","arxiv_id":"2505.16471","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/graph-supported-dynamic-algorithm#ran","syntology_url":"https://syntology.ai/paper/2505.16471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.16471"}},"official":{"repos":["robbertreijnen/gs-modac"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tropical-attention-neural-algorithmic","slug":"tropical-attention-neural-algorithmic","title":"Tropical Attention: Neural Algorithmic Reasoning for Combinatorial Algorithms","date":"2025-05-22","arxiv_id":"2505.17190","repositories_listed":0,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tropical-attention-neural-algorithmic#ran","syntology_url":"https://syntology.ai/paper/2505.17190","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.17190"}},"official":null}},{"url":"/paper/co-bench-benchmarking-language-model-agents","slug":"co-bench-benchmarking-language-model-agents","title":"CO-Bench: Benchmarking Language Model Agents in Algorithm Search for Combinatorial Optimization","date":"2025-04-06","arxiv_id":"2504.04310","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/co-bench-benchmarking-language-model-agents#ran","syntology_url":"https://syntology.ai/paper/2504.04310","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.04310"}},"official":{"repos":["sunnweiwei/co-bench"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-combinatorial-optimization-for-real","slug":"neural-combinatorial-optimization-for-real","title":"Neural Combinatorial Optimization for Real-World Routing","date":"2025-03-20","arxiv_id":"2503.16159","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/neural-combinatorial-optimization-for-real#ran","syntology_url":"https://syntology.ai/paper/2503.16159","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.16159"}},"official":{"repos":["ai4co/real-routing-nco"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-combinatorial-optimization-via","slug":"neural-combinatorial-optimization-via","title":"Neural Combinatorial Optimization via Preference Optimization","date":"2025-03-10","arxiv_id":"2503.07580","repositories_listed":0,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":2,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/neural-combinatorial-optimization-via#ran","syntology_url":"https://syntology.ai/paper/2503.07580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.07580"}},"official":null}},{"url":"/paper/destroy-and-repair-using-hyper-graphs-for","slug":"destroy-and-repair-using-hyper-graphs-for","title":"Destroy and Repair Using Hyper Graphs for Routing","date":"2025-02-22","arxiv_id":"2502.16170","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/destroy-and-repair-using-hyper-graphs-for#ran","syntology_url":"https://syntology.ai/paper/2502.16170","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.16170"}},"official":{"repos":["ciam-group/drhg"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-guided-rolling-horizon-optimization","slug":"learning-guided-rolling-horizon-optimization","title":"Learning-Guided Rolling Horizon Optimization for Long-Horizon Flexible Job-Shop Scheduling","date":"2025-02-18","arxiv_id":"2502.15791","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-guided-rolling-horizon-optimization#ran","syntology_url":"https://syntology.ai/paper/2502.15791","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.15791"}},"official":{"repos":["mit-wu-lab/l-rho"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/regularized-langevin-dynamics-for","slug":"regularized-langevin-dynamics-for","title":"Regularized Langevin Dynamics for Combinatorial Optimization","date":"2025-02-01","arxiv_id":"2502.00277","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/regularized-langevin-dynamics-for#ran","syntology_url":"https://syntology.ai/paper/2502.00277","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.00277"}},"official":{"repos":["shengyu-feng/rld4co"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/monte-carlo-tree-search-for-comprehensive","slug":"monte-carlo-tree-search-for-comprehensive","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","date":"2025-01-15","arxiv_id":"2501.08603","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/monte-carlo-tree-search-for-comprehensive#ran","syntology_url":"https://syntology.ai/paper/2501.08603","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.08603"}},"official":{"repos":["zz1358m/mcts-ahd-master"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-agent-reinforcement-learning-for-24","slug":"multi-agent-reinforcement-learning-for-24","title":"Multi Agent Reinforcement Learning for Sequential Satellite Assignment Problems","date":"2024-12-20","arxiv_id":"2412.15573","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-agent-reinforcement-learning-for-24#ran","syntology_url":"https://syntology.ai/paper/2412.15573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.15573"}},"official":{"repos":["Rainlabuw/rl-enabled-distributed-assignment"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hsevo-elevating-automatic-heuristic-design","slug":"hsevo-elevating-automatic-heuristic-design","title":"HSEvo: Elevating Automatic Heuristic Design with Diversity-Driven Harmony Search and Genetic Algorithm Using LLMs","date":"2024-12-19","arxiv_id":"2412.14995","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/hsevo-elevating-automatic-heuristic-design#ran","syntology_url":"https://syntology.ai/paper/2412.14995","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.14995"}},"official":{"repos":["datphamvn/hsevo"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/districtnet-decision-aware-learning-for","slug":"districtnet-decision-aware-learning-for","title":"DistrictNet: Decision-aware learning for geographical districting","date":"2024-12-11","arxiv_id":"2412.08287","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/districtnet-decision-aware-learning-for#ran","syntology_url":"https://syntology.ai/paper/2412.08287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.08287"}},"official":{"repos":["cheikh025/DistrictNet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/approximation-algorithms-for-combinatorial","slug":"approximation-algorithms-for-combinatorial","title":"Approximation Algorithms for Combinatorial Optimization with Predictions","date":"2024-11-25","arxiv_id":"2411.16600","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/approximation-algorithms-for-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2411.16600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.16600"}},"official":{"repos":["adampolak/steiner-tree-with-predictions"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/llmopt-learning-to-define-and-solve-general","slug":"llmopt-learning-to-define-and-solve-general","title":"LLMOPT: Learning to Define and Solve General Optimization Problems from Scratch","date":"2024-10-17","arxiv_id":"2410.13213","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":10,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/llmopt-learning-to-define-and-solve-general#ran","syntology_url":"https://syntology.ai/paper/2410.13213","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.13213"}},"official":{"repos":["caigaojiang/llmopt"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-solver-selection-for-combinatorial","slug":"neural-solver-selection-for-combinatorial","title":"Neural Solver Selection for Combinatorial Optimization","date":"2024-10-13","arxiv_id":"2410.09693","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/neural-solver-selection-for-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2410.09693","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.09693"}},"official":{"repos":["lamda-bbo/neural-solver-selection"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-solve-combinatorial-optimization-1","slug":"learning-to-solve-combinatorial-optimization-1","title":"Learning to Solve Combinatorial Optimization under Positive Linear Constraints via Non-Autoregressive Neural Networks","date":"2024-09-06","arxiv_id":"2409.04495","repositories_listed":2,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-to-solve-combinatorial-optimization-1#ran","syntology_url":"https://syntology.ai/paper/2409.04495","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.04495"}},"official":{"repos":["thinklab-sjtu/nar-co-solver"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/parco-learning-parallel-autoregressive","slug":"parco-learning-parallel-autoregressive","title":"Parallel AutoRegressive Models for Multi-Agent Combinatorial Optimization","date":"2024-09-05","arxiv_id":"2409.03811","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/parco-learning-parallel-autoregressive#ran","syntology_url":"https://syntology.ai/paper/2409.03811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.03811"}},"official":{"repos":["ai4co/parco"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/optimization-by-parallel-quasi-quantum","slug":"optimization-by-parallel-quasi-quantum","title":"Optimization by Parallel Quasi-Quantum Annealing with Gradient-Based Sampling","date":"2024-09-02","arxiv_id":"2409.02135","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/optimization-by-parallel-quasi-quantum#ran","syntology_url":"https://syntology.ai/paper/2409.02135","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.02135"}},"official":{"repos":["Yuma-Ichikawa/QQA4CO"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-great-architecture-for-edge-based-graph","slug":"a-great-architecture-for-edge-based-graph","title":"A GREAT Architecture for Edge-Based Graph Problems Like TSP","date":"2024-08-29","arxiv_id":"2408.16717","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-great-architecture-for-edge-based-graph#ran","syntology_url":"https://syntology.ai/paper/2408.16717","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.16717"}},"official":{"repos":["attila-lischka/GREAT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/2408-03195","slug":"2408-03195","title":"RELIEF: Reinforcement Learning Empowered Graph Feature Prompt Tuning","date":"2024-08-06","arxiv_id":"2408.03195","repositories_listed":1,"syntology":{"n":15,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":15,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/2408-03195#ran","syntology_url":"https://syntology.ai/paper/2408.03195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.03195"}},"official":{"repos":["JasonZhujp/RELIEF"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/2408-02207","slug":"2408-02207","title":"MARCO: A Memory-Augmented Reinforcement Framework for Combinatorial Optimization","date":"2024-08-05","arxiv_id":"2408.02207","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/2408-02207#ran","syntology_url":"https://syntology.ai/paper/2408.02207","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.02207"}},"official":{"repos":["TheLeprechaun25/MARCO"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/joint-admission-control-and-resource","slug":"joint-admission-control-and-resource","title":"Joint Admission Control and Resource Allocation of Virtual Network Embedding via Hierarchical Deep Reinforcement Learning","date":"2024-06-25","arxiv_id":"2406.17334","repositories_listed":2,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/joint-admission-control-and-resource#ran","syntology_url":"https://syntology.ai/paper/2406.17334","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17334"}},"official":{"repos":["geminilight/hrl-acra"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/memory-enhanced-neural-solvers-for-efficient","slug":"memory-enhanced-neural-solvers-for-efficient","title":"Memory-Enhanced Neural Solvers for Efficient Adaptation in Combinatorial Optimization","date":"2024-06-24","arxiv_id":"2406.16424","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/memory-enhanced-neural-solvers-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2406.16424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.16424"}},"official":{"repos":["instadeepai/memento"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/training-greedy-policy-for-proposal-batch","slug":"training-greedy-policy-for-proposal-batch","title":"Training Greedy Policy for Proposal Batch Selection in Expensive Multi-Objective Combinatorial Optimization","date":"2024-06-21","arxiv_id":"2406.14876","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/training-greedy-policy-for-proposal-batch#ran","syntology_url":"https://syntology.ai/paper/2406.14876","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14876"}},"official":{"repos":["snu-mllab/greedypolicyformoco"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/goal-a-generalist-combinatorial-optimization","slug":"goal-a-generalist-combinatorial-optimization","title":"GOAL: A Generalist Combinatorial Optimization Agent Learning","date":"2024-06-21","arxiv_id":"2406.15079","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/goal-a-generalist-combinatorial-optimization#ran","syntology_url":"https://syntology.ai/paper/2406.15079","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15079"}},"official":{"repos":["naver/goal-co"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-solution-aware-transformers-for","slug":"learning-solution-aware-transformers-for","title":"Learning Solution-Aware Transformers for Efficiently Solving Quadratic Assignment Problem","date":"2024-06-14","arxiv_id":"2406.09899","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":9,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":8,"n_pointer_only":15,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 1 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-solution-aware-transformers-for#ran","syntology_url":"https://syntology.ai/paper/2406.09899","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09899"}},"official":{"repos":["pkutan/sawt"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/distributional-miplib-a-multi-domain-library","slug":"distributional-miplib-a-multi-domain-library","title":"Distributional MIPLIB: a Multi-Domain Library for Advancing ML-Guided MILP Methods","date":"2024-06-11","arxiv_id":"2406.06954","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/distributional-miplib-a-multi-domain-library#ran","syntology_url":"https://syntology.ai/paper/2406.06954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06954"}},"official":{"repos":["amf272/Distributional-MIPLIB-Generators"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-diffusion-model-framework-for-unsupervised","slug":"a-diffusion-model-framework-for-unsupervised","title":"A Diffusion Model Framework for Unsupervised Neural Combinatorial Optimization","date":"2024-06-03","arxiv_id":"2406.01661","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-diffusion-model-framework-for-unsupervised#ran","syntology_url":"https://syntology.ai/paper/2406.01661","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.01661"}},"official":{"repos":["ml-jku/diffuco"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-a-general-gnn-framework-for","slug":"towards-a-general-gnn-framework-for","title":"Towards a General Recipe for Combinatorial Optimization with Multi-Filter GNNs","date":"2024-05-31","arxiv_id":"2405.20543","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":13,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/towards-a-general-gnn-framework-for#ran","syntology_url":"https://syntology.ai/paper/2405.20543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20543"}},"official":{"repos":["wenkelf/copt"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/bayesian-optimization-of-functions-over-node","slug":"bayesian-optimization-of-functions-over-node","title":"Bayesian Optimization of Functions over Node Subsets in Graphs","date":"2024-05-24","arxiv_id":"2405.15119","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":11,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/bayesian-optimization-of-functions-over-node#ran","syntology_url":"https://syntology.ai/paper/2405.15119","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.15119"}},"official":{"repos":["LeonResearch/GraphComBO"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/tackling-prevalent-conditions-in-unsupervised","slug":"tackling-prevalent-conditions-in-unsupervised","title":"Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More","date":"2024-05-14","arxiv_id":"2405.08424","repositories_listed":2,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/tackling-prevalent-conditions-in-unsupervised#ran","syntology_url":"https://syntology.ai/paper/2405.08424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.08424"}},"official":{"repos":["ai4co/unsupervised-co-ucom2","bokveizen/unsupervised-CO-ucom2"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/instance-conditioned-adaptation-for-large","slug":"instance-conditioned-adaptation-for-large","title":"Instance-Conditioned Adaptation for Large-scale Generalization of Neural Routing Solver","date":"2024-05-03","arxiv_id":"2405.01906","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/instance-conditioned-adaptation-for-large#ran","syntology_url":"https://syntology.ai/paper/2405.01906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.01906"}},"official":{"repos":["ciam-group/icam"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/mvmoe-multi-task-vehicle-routing-solver-with","slug":"mvmoe-multi-task-vehicle-routing-solver-with","title":"MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Experts","date":"2024-05-02","arxiv_id":"2405.01029","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/mvmoe-multi-task-vehicle-routing-solver-with#ran","syntology_url":"https://syntology.ai/paper/2405.01029","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.01029"}},"official":{"repos":["ai4co/awesome-fm4co","royalskye/routing-mvmoe"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/self-improvement-for-neural-combinatorial","slug":"self-improvement-for-neural-combinatorial","title":"Self-Improvement for Neural Combinatorial Optimization: Sample without Replacement, but Improvement","date":"2024-03-22","arxiv_id":"2403.15180","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-improvement-for-neural-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2403.15180","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.15180"}},"official":{"repos":["grimmlab/gumbeldore"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-combinatorial-optimization-via-heat","slug":"efficient-combinatorial-optimization-via-heat","title":"Efficient Combinatorial Optimization via Heat Diffusion","date":"2024-03-13","arxiv_id":"2403.08757","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":12,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/efficient-combinatorial-optimization-via-heat#ran","syntology_url":"https://syntology.ai/paper/2403.08757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.08757"}},"official":{"repos":["awakermhy/heo"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/ant-colony-sampling-with-gflownets-for","slug":"ant-colony-sampling-with-gflownets-for","title":"Ant Colony Sampling with GFlowNets for Combinatorial Optimization","date":"2024-03-11","arxiv_id":"2403.07041","repositories_listed":2,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ant-colony-sampling-with-gflownets-for#ran","syntology_url":"https://syntology.ai/paper/2403.07041","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.07041"}},"official":{"repos":["ai4co/gfacs","henry-yeh/DeepACO"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/acceleratedlingam-learning-causal-dags-at-the","slug":"acceleratedlingam-learning-causal-dags-at-the","title":"AcceleratedLiNGAM: Learning Causal DAGs at the speed of GPUs","date":"2024-03-06","arxiv_id":"2403.03772","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/acceleratedlingam-learning-causal-dags-at-the#ran","syntology_url":"https://syntology.ai/paper/2403.03772","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.03772"}},"official":{"repos":["viktour19/culingam"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-task-learning-for-routing-problem-with","slug":"multi-task-learning-for-routing-problem-with","title":"Multi-Task Learning for Routing Problem with Cross-Problem Zero-Shot Generalization","date":"2024-02-23","arxiv_id":"2402.16891","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/multi-task-learning-for-routing-problem-with#ran","syntology_url":"https://syntology.ai/paper/2402.16891","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.16891"}},"official":{"repos":["feiliu36/mtnco"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/moco-a-learnable-meta-optimizer-for","slug":"moco-a-learnable-meta-optimizer-for","title":"Moco: A Learnable Meta Optimizer for Combinatorial Optimization","date":"2024-02-07","arxiv_id":"2402.04915","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/moco-a-learnable-meta-optimizer-for#ran","syntology_url":"https://syntology.ai/paper/2402.04915","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04915"}},"official":{"repos":["timd3/moco"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/reevo-large-language-models-as-hyper","slug":"reevo-large-language-models-as-hyper","title":"ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution","date":"2024-02-02","arxiv_id":"2402.01145","repositories_listed":3,"syntology":{"n":10,"n_ran":5,"n_constructed":1,"n_ran_checked":2,"n_instrument":3,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/reevo-large-language-models-as-hyper#ran","syntology_url":"https://syntology.ai/paper/2402.01145","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.01145"}},"official":{"repos":["ai4co/llm-as-hh"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/an-example-of-evolutionary-computation-large","slug":"an-example-of-evolutionary-computation-large","title":"Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Model","date":"2024-01-04","arxiv_id":"2401.02051","repositories_listed":6,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-example-of-evolutionary-computation-large#ran","syntology_url":"https://syntology.ai/paper/2401.02051","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.02051"}},"official":{"repos":["feiliu36/eoh"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/variational-annealing-on-graphs-for","slug":"variational-annealing-on-graphs-for","title":"Variational Annealing on Graphs for Combinatorial Optimization","date":"2023-11-23","arxiv_id":"2311.14156","repositories_listed":1,"syntology":{"n":16,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":16,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/variational-annealing-on-graphs-for#ran","syntology_url":"https://syntology.ai/paper/2311.14156","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.14156"}},"official":{"repos":["ml-jku/vag-co"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-and-benchmarking-predict-then","slug":"rethinking-and-benchmarking-predict-then","title":"Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime","date":"2023-11-13","arxiv_id":"2311.07633","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rethinking-and-benchmarking-predict-then#ran","syntology_url":"https://syntology.ai/paper/2311.07633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.07633"}},"official":{"repos":["thinklab-sjtu/predictiveco-benchmark"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/combinatorial-optimization-with-policy","slug":"combinatorial-optimization-with-policy","title":"Combinatorial Optimization with Policy Adaptation using Latent Space Search","date":"2023-11-13","arxiv_id":"2311.13569","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/combinatorial-optimization-with-policy#ran","syntology_url":"https://syntology.ai/paper/2311.13569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.13569"}},"official":{"repos":["instadeepai/compass"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/large-language-models-as-evolutionary","slug":"large-language-models-as-evolutionary","title":"Large Language Models as Evolutionary Optimizers","date":"2023-10-29","arxiv_id":"2310.19046","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/large-language-models-as-evolutionary#ran","syntology_url":"https://syntology.ai/paper/2310.19046","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.19046"}},"official":{"repos":["cschen1205/lmea"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-multi-objective-combinatorial","slug":"neural-multi-objective-combinatorial","title":"Neural Multi-Objective Combinatorial Optimization with Diversity Enhancement","date":"2023-10-22","arxiv_id":"2310.15195","repositories_listed":1,"syntology":{"n":8,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/neural-multi-objective-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2310.15195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15195"}},"official":{"repos":["bill-cjb/nhde"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/survival-of-the-most-influential-prompts","slug":"survival-of-the-most-influential-prompts","title":"Survival of the Most Influential Prompts: Efficient Black-Box Prompt Search via Clustering and Pruning","date":"2023-10-19","arxiv_id":"2310.12774","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/survival-of-the-most-influential-prompts#ran","syntology_url":"https://syntology.ai/paper/2310.12774","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.12774"}},"official":{"repos":["cambridgeltl/claps"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/exploring-the-power-of-graph-neural-networks","slug":"exploring-the-power-of-graph-neural-networks","title":"Exploring the Power of Graph Neural Networks in Solving Linear Optimization Problems","date":"2023-10-16","arxiv_id":"2310.10603","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":8,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exploring-the-power-of-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2310.10603","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.10603"}},"official":{"repos":["chendiqian/IPM_MPNN"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-combinatorial-optimization-with-heavy","slug":"neural-combinatorial-optimization-with-heavy","title":"Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalization","date":"2023-10-12","arxiv_id":"2310.07985","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/neural-combinatorial-optimization-with-heavy#ran","syntology_url":"https://syntology.ai/paper/2310.07985","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.07985"}},"official":{"repos":["ciam-group/nco_code"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-deep-instance-generative-framework-for-milp-1","slug":"a-deep-instance-generative-framework-for-milp-1","title":"A Deep Instance Generative Framework for MILP Solvers Under Limited Data Availability","date":"2023-10-04","arxiv_id":"2310.02807","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-deep-instance-generative-framework-for-milp-1#ran","syntology_url":"https://syntology.ai/paper/2310.02807","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.02807"}},"official":{"repos":["miralab-ustc/l2o-g2milp"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/are-graph-neural-networks-optimal","slug":"are-graph-neural-networks-optimal","title":"Are Graph Neural Networks Optimal Approximation Algorithms?","date":"2023-10-01","arxiv_id":"2310.00526","repositories_listed":1,"syntology":{"n":13,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":13,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/are-graph-neural-networks-optimal#ran","syntology_url":"https://syntology.ai/paper/2310.00526","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.00526"}},"official":{"repos":["penlu/bespoke-gnn4do"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/controlling-continuous-relaxation-for","slug":"controlling-continuous-relaxation-for","title":"Controlling Continuous Relaxation for Combinatorial Optimization","date":"2023-09-29","arxiv_id":"2309.16965","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/controlling-continuous-relaxation-for#ran","syntology_url":"https://syntology.ai/paper/2309.16965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.16965"}},"official":{"repos":["Yuma-Ichikawa/CRA4CO"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-generalizable-neural-solvers-for","slug":"towards-generalizable-neural-solvers-for","title":"Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferrable Local Policy","date":"2023-08-27","arxiv_id":"2308.14104","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-generalizable-neural-solvers-for#ran","syntology_url":"https://syntology.ai/paper/2308.14104","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.14104"}},"official":{"repos":["gaocrr/elg"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/reinforcement-learning-based-non","slug":"reinforcement-learning-based-non","title":"Reinforcement Learning-based Non-Autoregressive Solver for Traveling Salesman Problems","date":"2023-08-01","arxiv_id":"2308.00560","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reinforcement-learning-based-non#ran","syntology_url":"https://syntology.ai/paper/2308.00560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.00560"}},"official":{"repos":["xybfight/nar4tsp"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rl4co-an-extensive-reinforcement-learning-for","slug":"rl4co-an-extensive-reinforcement-learning-for","title":"RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark","date":"2023-06-29","arxiv_id":"2306.17100","repositories_listed":3,"syntology":{"n":16,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":3,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/rl4co-an-extensive-reinforcement-learning-for#ran","syntology_url":"https://syntology.ai/paper/2306.17100","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.17100"}},"official":{"repos":["ai4co/rl4co","pytorch/rl"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/an-end-to-end-reinforcement-learning-approach","slug":"an-end-to-end-reinforcement-learning-approach","title":"An End-to-End Reinforcement Learning Approach for Job-Shop Scheduling Problems Based on Constraint Programming","date":"2023-06-09","arxiv_id":"2306.05747","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/an-end-to-end-reinforcement-learning-approach#ran","syntology_url":"https://syntology.ai/paper/2306.05747","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.05747"}},"official":{"repos":["ingambe/End2End-Job-Shop-Scheduling-CP"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-sage-scale-meta-learning-scheduled","slug":"meta-sage-scale-meta-learning-scheduled","title":"Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optimization","date":"2023-06-05","arxiv_id":"2306.02688","repositories_listed":1,"syntology":{"n":7,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":7,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/meta-sage-scale-meta-learning-scheduled#ran","syntology_url":"https://syntology.ai/paper/2306.02688","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02688"}},"official":{"repos":["kaist-silab/meta-sage"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/discovering-dynamic-causal-space-for-dag","slug":"discovering-dynamic-causal-space-for-dag","title":"Discovering Dynamic Causal Space for DAG Structure Learning","date":"2023-06-05","arxiv_id":"2306.02822","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/discovering-dynamic-causal-space-for-dag#ran","syntology_url":"https://syntology.ai/paper/2306.02822","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02822"}},"official":{"repos":["liuff19/casper"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-omni-generalizable-neural-methods-for","slug":"towards-omni-generalizable-neural-methods-for","title":"Towards Omni-generalizable Neural Methods for Vehicle Routing Problems","date":"2023-05-31","arxiv_id":"2305.19587","repositories_listed":1,"syntology":{"n":22,"n_ran":13,"n_constructed":3,"n_ran_checked":8,"n_instrument":5,"n_unverified":9,"n_honours":3,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"13 ran (of which 3 constructed an object rather than computing a result; 8 with no instrument failure: 3 honoured, 0 violated, 5 with no contract checked; 5 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/towards-omni-generalizable-neural-methods-for#ran","syntology_url":"https://syntology.ai/paper/2305.19587","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19587"}},"official":{"repos":["royalskye/omni-vrp"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":3,"n_ran_no_instrument_failure":8,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/combinatorial-optimization-enriched-machine","slug":"combinatorial-optimization-enriched-machine","title":"Combinatorial Optimization enriched Machine Learning to solve the Dynamic Vehicle Routing Problem with Time Windows","date":"2023-04-03","arxiv_id":"2304.00789","repositories_listed":1,"syntology":{"n":21,"n_ran":14,"n_constructed":2,"n_ran_checked":9,"n_instrument":5,"n_unverified":7,"n_honours":5,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"14 ran (of which 2 constructed an object rather than computing a result; 9 with no instrument failure: 5 honoured, 0 violated, 4 with no contract checked; 5 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/combinatorial-optimization-enriched-machine#ran","syntology_url":"https://syntology.ai/paper/2304.00789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.00789"}},"official":{"repos":["tumbais/euro-meets-neurips-2022"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":2,"n_ran_no_instrument_failure":9,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-airport-ground-handling","slug":"neural-airport-ground-handling","title":"Neural Airport Ground Handling","date":"2023-03-04","arxiv_id":"2303.02442","repositories_listed":1,"syntology":{"n":10,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/neural-airport-ground-handling#ran","syntology_url":"https://syntology.ai/paper/2303.02442","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.02442"}},"official":{"repos":["royalskye/agh"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/difusco-graph-based-diffusion-solvers-for-1","slug":"difusco-graph-based-diffusion-solvers-for-1","title":"DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimization","date":"2023-02-16","arxiv_id":"2302.08224","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/difusco-graph-based-diffusion-solvers-for-1#ran","syntology_url":"https://syntology.ai/paper/2302.08224","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08224"}},"official":{"repos":["edward-sun/difusco"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-based-online-optimization-for","slug":"learning-based-online-optimization-for","title":"Learning-based Online Optimization for Autonomous Mobility-on-Demand Fleet Control","date":"2023-02-08","arxiv_id":"2302.03963","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-based-online-optimization-for#ran","syntology_url":"https://syntology.ai/paper/2302.03963","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.03963"}},"official":{"repos":["tumBAIS/ML-CO-pipeline-AMoD-control"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-coloring-via-neural-networks-for","slug":"graph-coloring-via-neural-networks-for","title":"Graph Coloring via Neural Networks for Haplotype Assembly and Viral Quasispecies Reconstruction","date":"2022-10-21","arxiv_id":"2210.12158","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/graph-coloring-via-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/2210.12158","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12158"}},"official":{"repos":["xuehansheng/neurhap"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/touplegdd-a-fine-designed-solution-of","slug":"touplegdd-a-fine-designed-solution-of","title":"ToupleGDD: A Fine-Designed Solution of Influence Maximization by Deep Reinforcement Learning","date":"2022-10-14","arxiv_id":"2210.07500","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/touplegdd-a-fine-designed-solution-of#ran","syntology_url":"https://syntology.ai/paper/2210.07500","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07500"}},"official":{"repos":["Dtrycode/ToupleGDD"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/theory-and-approximate-solvers-for-branched","slug":"theory-and-approximate-solvers-for-branched","title":"Theory and Approximate Solvers for Branched Optimal Transport with Multiple Sources","date":"2022-10-14","arxiv_id":"2210.07702","repositories_listed":1,"syntology":{"n":24,"n_ran":23,"n_constructed":0,"n_ran_checked":23,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":23,"n_pointer_only":0,"phrase":"23 ran (of which 0 constructed an object rather than computing a result; 23 with no instrument failure: 0 honoured, 0 violated, 23 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/theory-and-approximate-solvers-for-branched#ran","syntology_url":"https://syntology.ai/paper/2210.07702","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07702"}},"official":{"repos":["hci-unihd/branchedot"],"state":"official (archive's flag): 23 ran","n_ran":23,"n_constructed":0,"n_ran_no_instrument_failure":23,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/dimes-a-differentiable-meta-solver-for","slug":"dimes-a-differentiable-meta-solver-for","title":"DIMES: A Differentiable Meta Solver for Combinatorial Optimization Problems","date":"2022-10-08","arxiv_id":"2210.04123","repositories_listed":1,"syntology":{"n":25,"n_ran":10,"n_constructed":1,"n_ran_checked":1,"n_instrument":9,"n_unverified":15,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 9 where Syntology's instrument failed) · 15 unverified","sample_list":"/paper/dimes-a-differentiable-meta-solver-for#ran","syntology_url":"https://syntology.ai/paper/2210.04123","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.04123"}},"official":{"repos":["dimesteam/dimes"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":15,"ran_from_kinds":["official"]}}},{"url":"/paper/winner-takes-it-all-training-performant-rl-1","slug":"winner-takes-it-all-training-performant-rl-1","title":"Winner Takes It All: Training Performant RL Populations for Combinatorial Optimization","date":"2022-10-07","arxiv_id":"2210.03475","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/winner-takes-it-all-training-performant-rl-1#ran","syntology_url":"https://syntology.ai/paper/2210.03475","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.03475"}},"official":null}},{"url":"/paper/one-model-any-csp-graph-neural-networks-as","slug":"one-model-any-csp-graph-neural-networks-as","title":"One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction","date":"2022-08-22","arxiv_id":"2208.10227","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/one-model-any-csp-graph-neural-networks-as#ran","syntology_url":"https://syntology.ai/paper/2208.10227","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.10227"}},"official":{"repos":["toenshoff/runcsp-pytorch"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/supplementing-recurrent-neural-networks-with","slug":"supplementing-recurrent-neural-networks-with","title":"Supplementing Recurrent Neural Networks with Annealing to Solve Combinatorial Optimization Problems","date":"2022-07-17","arxiv_id":"2207.08189","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/supplementing-recurrent-neural-networks-with#ran","syntology_url":"https://syntology.ai/paper/2207.08189","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.08189"}},"official":{"repos":["rnn-vca-co/rnn-vca-co"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-control-local-search-for","slug":"learning-to-control-local-search-for","title":"Learning to Control Local Search for Combinatorial Optimization","date":"2022-06-27","arxiv_id":"2206.13181","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-to-control-local-search-for#ran","syntology_url":"https://syntology.ai/paper/2206.13181","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.13181"}},"official":{"repos":["jokofa/neurols"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/diffusion-models-as-plug-and-play-priors","slug":"diffusion-models-as-plug-and-play-priors","title":"Diffusion models as plug-and-play priors","date":"2022-06-17","arxiv_id":"2206.09012","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/diffusion-models-as-plug-and-play-priors#ran","syntology_url":"https://syntology.ai/paper/2206.09012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.09012"}},"official":{"repos":["alexgraikos/diffusion_priors"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sym-nco-leveraging-symmetricity-for-neural","slug":"sym-nco-leveraging-symmetricity-for-neural","title":"Sym-NCO: Leveraging Symmetricity for Neural Combinatorial Optimization","date":"2022-05-26","arxiv_id":"2205.13209","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/sym-nco-leveraging-symmetricity-for-neural#ran","syntology_url":"https://syntology.ai/paper/2205.13209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13209"}},"official":{"repos":["alstn12088/sym-nco"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/collaborative-distillation-meta-learning-for","slug":"collaborative-distillation-meta-learning-for","title":"DevFormer: A Symmetric Transformer for Context-Aware Device Placement","date":"2022-05-26","arxiv_id":"2205.13225","repositories_listed":5,"syntology":{"n":23,"n_ran":16,"n_constructed":4,"n_ran_checked":13,"n_instrument":3,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":2,"phrase":"16 ran (of which 4 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/collaborative-distillation-meta-learning-for#ran","syntology_url":"https://syntology.ai/paper/2205.13225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13225"}},"official":{"repos":["kaist-silab/devformer","kaist-silab/dppbench"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":4,"n_ran_no_instrument_failure":10,"n_unverified":7,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/multi-objective-pointer-network-for","slug":"multi-objective-pointer-network-for","title":"Multi-objective Pointer Network for Combinatorial Optimization","date":"2022-04-25","arxiv_id":"2204.11860","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/multi-objective-pointer-network-for#ran","syntology_url":"https://syntology.ai/paper/2204.11860","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.11860"}},"official":{"repos":["gaoly/mopn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/the-machine-learning-for-combinatorial","slug":"the-machine-learning-for-combinatorial","title":"The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights","date":"2022-03-04","arxiv_id":"2203.02433","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-machine-learning-for-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2203.02433","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.02433"}},"official":{"repos":["ds4dm/ml4co-competition","megvii-research/neurips2021-ml4co-kida"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/instance-wise-algorithm-configuration-with","slug":"instance-wise-algorithm-configuration-with","title":"Instance-wise algorithm configuration with graph neural networks","date":"2022-02-10","arxiv_id":"2202.04910","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/instance-wise-algorithm-configuration-with#ran","syntology_url":"https://syntology.ai/paper/2202.04910","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.04910"}},"official":{"repos":["romeov/ml4co-competition"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/ml4co-kida-knowledge-inheritance-in-data","slug":"ml4co-kida-knowledge-inheritance-in-data","title":"ML4CO-KIDA: Knowledge Inheritance in Dataset Aggregation","date":"2022-01-25","arxiv_id":"2201.10328","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/ml4co-kida-knowledge-inheritance-in-data#ran","syntology_url":"https://syntology.ai/paper/2201.10328","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.10328"}},"official":{"repos":["megvii-research/neurips2021-ml4co-kida"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/predict-and-optimize-through-the-lens-of","slug":"predict-and-optimize-through-the-lens-of","title":"Decision-Focused Learning: Through the Lens of Learning to Rank","date":"2021-12-07","arxiv_id":"2112.03609","repositories_listed":1,"syntology":{"n":12,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/predict-and-optimize-through-the-lens-of#ran","syntology_url":"https://syntology.ai/paper/2112.03609","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.03609"}},"official":{"repos":["jayman91/ltr-predopt"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/symbolic-regression-via-neural-guided-genetic","slug":"symbolic-regression-via-neural-guided-genetic","title":"Symbolic Regression via Neural-Guided Genetic Programming Population Seeding","date":"2021-10-29","arxiv_id":"2111.00053","repositories_listed":2,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/symbolic-regression-via-neural-guided-genetic#ran","syntology_url":"https://syntology.ai/paper/2111.00053","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.00053"}},"official":{"repos":["brendenpetersen/deep-symbolic-optimization"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/openabc-d-a-large-scale-dataset-for-machine","slug":"openabc-d-a-large-scale-dataset-for-machine","title":"OpenABC-D: A Large-Scale Dataset For Machine Learning Guided Integrated Circuit Synthesis","date":"2021-10-21","arxiv_id":"2110.11292","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/openabc-d-a-large-scale-dataset-for-machine#ran","syntology_url":"https://syntology.ai/paper/2110.11292","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.11292"}},"official":{"repos":["nyu-mlda/openabc"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/rationales-for-sequential-predictions","slug":"rationales-for-sequential-predictions","title":"Rationales for Sequential Predictions","date":"2021-09-14","arxiv_id":"2109.06387","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/rationales-for-sequential-predictions#ran","syntology_url":"https://syntology.ai/paper/2109.06387","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.06387"}},"official":{"repos":["keyonvafa/sequential-rationales"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/learning-a-large-neighborhood-search","slug":"learning-a-large-neighborhood-search","title":"Learning a Large Neighborhood Search Algorithm for Mixed Integer Programs","date":"2021-07-21","arxiv_id":"2107.10201","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-a-large-neighborhood-search#ran","syntology_url":"https://syntology.ai/paper/2107.10201","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.10201"}},"official":{"repos":["deepmind/neural_lns"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/usco-solver-solving-undetermined-stochastic","slug":"usco-solver-solving-undetermined-stochastic","title":"USCO-Solver: Solving Undetermined Stochastic Combinatorial Optimization Problems","date":"2021-07-15","arxiv_id":"2107.07508","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/usco-solver-solving-undetermined-stochastic#ran","syntology_url":"https://syntology.ai/paper/2107.07508","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.07508"}},"official":null}},{"url":"/paper/maximum-entropy-weighted-independent-set","slug":"maximum-entropy-weighted-independent-set","title":"Maximum Entropy Weighted Independent Set Pooling for Graph Neural Networks","date":"2021-07-03","arxiv_id":"2107.01410","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/maximum-entropy-weighted-independent-set#ran","syntology_url":"https://syntology.ai/paper/2107.01410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.01410"}},"official":{"repos":["mewispool/mewispool"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/matrix-encoding-networks-for-neural","slug":"matrix-encoding-networks-for-neural","title":"Matrix Encoding Networks for Neural Combinatorial Optimization","date":"2021-06-21","arxiv_id":"2106.11113","repositories_listed":2,"syntology":{"n":7,"n_ran":4,"n_constructed":1,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/matrix-encoding-networks-for-neural#ran","syntology_url":"https://syntology.ai/paper/2106.11113","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.11113"}},"official":{"repos":["yd-kwon/MatNet"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/solving-graph-based-public-good-games-with","slug":"solving-graph-based-public-good-games-with","title":"Solving Graph-based Public Good Games with Tree Search and Imitation Learning","date":"2021-06-12","arxiv_id":"2106.06762","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/solving-graph-based-public-good-games-with#ran","syntology_url":"https://syntology.ai/paper/2106.06762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06762"}},"official":{"repos":["victordarvariu/solving-graph-pgg"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-bi-level-framework-for-learning-to-solve","slug":"a-bi-level-framework-for-learning-to-solve","title":"A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs","date":"2021-06-09","arxiv_id":"2106.04927","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-bi-level-framework-for-learning-to-solve#ran","syntology_url":"https://syntology.ai/paper/2106.04927","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04927"}},"official":{"repos":["thinklab-sjtu/ppo-bihyb"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/implicit-mle-backpropagating-through-discrete","slug":"implicit-mle-backpropagating-through-discrete","title":"Implicit MLE: Backpropagating Through Discrete Exponential Family Distributions","date":"2021-06-03","arxiv_id":"2106.01798","repositories_listed":3,"syntology":{"n":10,"n_ran":7,"n_constructed":2,"n_ran_checked":2,"n_instrument":5,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":6,"phrase":"7 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/implicit-mle-backpropagating-through-discrete#ran","syntology_url":"https://syntology.ai/paper/2106.01798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01798"}},"official":{"repos":["nec-research/tf-imle"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["community","listed","official"]}}},{"url":"/paper/meta-learning-based-deep-reinforcement","slug":"meta-learning-based-deep-reinforcement","title":"Meta-Learning-Based Deep Reinforcement Learning for Multiobjective Optimization Problems","date":"2021-05-06","arxiv_id":"2105.02741","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/meta-learning-based-deep-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2105.02741","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.02741"}},"official":{"repos":["zhangzizhen/ml-dam"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-reinforcement-learning-of-graph-matching","slug":"deep-reinforcement-learning-of-graph-matching","title":"Revocable Deep Reinforcement Learning with Affinity Regularization for Outlier-Robust Graph Matching","date":"2020-12-16","arxiv_id":"2012.08950","repositories_listed":2,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":8,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-reinforcement-learning-of-graph-matching#ran","syntology_url":"https://syntology.ai/paper/2012.08950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.08950"}},"official":{"repos":["thinklab-sjtu/rgm","Thinklab-SJTU/awesome-ml4co"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/ecole-a-gym-like-library-for-machine-learning","slug":"ecole-a-gym-like-library-for-machine-learning","title":"Ecole: A Gym-like Library for Machine Learning in Combinatorial Optimization Solvers","date":"2020-11-11","arxiv_id":"2011.06069","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ecole-a-gym-like-library-for-machine-learning#ran","syntology_url":"https://syntology.ai/paper/2011.06069","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.06069"}},"official":{"repos":["ds4dm/ecole"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/discrete-solution-pools-and-noise-contrastive","slug":"discrete-solution-pools-and-noise-contrastive","title":"Contrastive Losses and Solution Caching for Predict-and-Optimize","date":"2020-11-10","arxiv_id":"2011.05354","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/discrete-solution-pools-and-noise-contrastive#ran","syntology_url":"https://syntology.ai/paper/2011.05354","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.05354"}},"official":{"repos":["CryoCardiogram/ijcai-cache-loss-pno"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pomo-policy-optimization-with-multiple-optima","slug":"pomo-policy-optimization-with-multiple-optima","title":"POMO: Policy Optimization with Multiple Optima for Reinforcement Learning","date":"2020-10-30","arxiv_id":"2010.16011","repositories_listed":3,"syntology":{"n":8,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":8,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/pomo-policy-optimization-with-multiple-optima#ran","syntology_url":"https://syntology.ai/paper/2010.16011","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.16011"}},"official":{"repos":["yd-kwon/POMO"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/feature-importance-ranking-for-deep-learning","slug":"feature-importance-ranking-for-deep-learning","title":"Feature Importance Ranking for Deep Learning","date":"2020-10-18","arxiv_id":"2010.08973","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/feature-importance-ranking-for-deep-learning#ran","syntology_url":"https://syntology.ai/paper/2010.08973","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.08973"}},"official":{"repos":["maksym33/FeatureImportanceDL"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}}],"record_sha256":"d01ae0590d618a9128a390399b9099383a50e47b843f4be43193312400826701","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}