{"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/3","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":13,"rows_per_page":100,"rows":[201,300],"of":1277,"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","prev":"/task/combinatorial-optimization/papers/2","next":"/task/combinatorial-optimization/papers/4","papers":[{"url":"/paper/fis-one-floor-identification-system-with-one","slug":"fis-one-floor-identification-system-with-one","title":"FIS-ONE: Floor Identification System with One Label for Crowdsourced RF Signals","date":"2023-07-12","arxiv_id":"2307.05914","repositories_listed":1,"syntology":null},{"url":"/paper/monte-carlo-policy-gradient-method-for-binary","slug":"monte-carlo-policy-gradient-method-for-binary","title":"Monte Carlo Policy Gradient Method for Binary Optimization","date":"2023-07-03","arxiv_id":"2307.00783","repositories_listed":1,"syntology":null},{"url":"/paper/a-formal-perspective-on-byte-pair-encoding","slug":"a-formal-perspective-on-byte-pair-encoding","title":"A Formal Perspective on Byte-Pair Encoding","date":"2023-06-29","arxiv_id":"2306.16837","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-truss-design-with-reinforcement","slug":"automatic-truss-design-with-reinforcement","title":"Automatic Truss Design with Reinforcement Learning","date":"2023-06-27","arxiv_id":"2306.15182","repositories_listed":1,"syntology":null},{"url":"/paper/d2match-leveraging-deep-learning-and","slug":"d2match-leveraging-deep-learning-and","title":"D2Match: Leveraging Deep Learning and Degeneracy for Subgraph Matching","date":"2023-06-10","arxiv_id":"2306.06380","repositories_listed":1,"syntology":null},{"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/treedqn-learning-to-minimize-branch-and-bound","slug":"treedqn-learning-to-minimize-branch-and-bound","title":"TreeDQN: Learning to minimize Branch-and-Bound tree","date":"2023-06-09","arxiv_id":"2306.05905","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-programming-on-a-quantum-annealer","slug":"dynamic-programming-on-a-quantum-annealer","title":"Dynamic Programming on a Quantum Annealer: Solving the RBC Model","date":"2023-06-07","arxiv_id":"2306.04285","repositories_listed":1,"syntology":null},{"url":"/paper/policy-based-self-competition-for-planning","slug":"policy-based-self-competition-for-planning","title":"Policy-Based Self-Competition for Planning Problems","date":"2023-06-07","arxiv_id":"2306.04403","repositories_listed":1,"syntology":null},{"url":"/paper/learning-based-heuristic-for-combinatorial","slug":"learning-based-heuristic-for-combinatorial","title":"Learning-Based Heuristic for Combinatorial Optimization of the Minimum Dominating Set Problem using Graph Convolutional Networks","date":"2023-06-06","arxiv_id":"2306.03434","repositories_listed":1,"syntology":null},{"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/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/symmetric-exploration-in-combinatorial","slug":"symmetric-exploration-in-combinatorial","title":"Symmetric Replay Training: Enhancing Sample Efficiency in Deep Reinforcement Learning for Combinatorial Optimization","date":"2023-06-02","arxiv_id":"2306.01276","repositories_listed":1,"syntology":null},{"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/dhrl-fnmr-an-intelligent-multicast-routing","slug":"dhrl-fnmr-an-intelligent-multicast-routing","title":"DHRL-FNMR: An Intelligent Multicast Routing Approach Based on Deep Hierarchical Reinforcement Learning in SDN","date":"2023-05-30","arxiv_id":"2305.19077","repositories_listed":1,"syntology":null},{"url":"/paper/let-the-flows-tell-solving-graph","slug":"let-the-flows-tell-solving-graph","title":"Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with GFlowNets","date":"2023-05-26","arxiv_id":"2305.17010","repositories_listed":1,"syntology":null},{"url":"/paper/local-energy-distribution-based","slug":"local-energy-distribution-based","title":"Local Energy Distribution Based Hyperparameter Determination for Stochastic Simulated Annealing","date":"2023-04-24","arxiv_id":"2304.11839","repositories_listed":1,"syntology":null},{"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/error-mitigated-quantum-approximate","slug":"error-mitigated-quantum-approximate","title":"Quantum approximate optimization via learning-based adaptive optimization","date":"2023-03-27","arxiv_id":"2303.14877","repositories_listed":1,"syntology":null},{"url":"/paper/a-graph-neural-network-approach-to","slug":"a-graph-neural-network-approach-to","title":"Graph Neural Networks for the Offline Nanosatellite Task Scheduling Problem","date":"2023-03-24","arxiv_id":"2303.13773","repositories_listed":1,"syntology":null},{"url":"/paper/rlor-a-flexible-framework-of-deep","slug":"rlor-a-flexible-framework-of-deep","title":"RLOR: A Flexible Framework of Deep Reinforcement Learning for Operation Research","date":"2023-03-23","arxiv_id":"2303.13117","repositories_listed":1,"syntology":null},{"url":"/paper/solving-routing-problems-for-multiple","slug":"solving-routing-problems-for-multiple","title":"Solving routing problems for multiple cooperative Unmanned Aerial Vehicles using Transformer networks, vol. 122, pp. 106085, 2023","date":"2023-03-09","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/rolling-horizon-based-temporal-decomposition","slug":"rolling-horizon-based-temporal-decomposition","title":"Rolling Horizon based Temporal Decomposition for the Offline Pickup and Delivery Problem with Time Windows","date":"2023-03-06","arxiv_id":"2303.03475","repositories_listed":1,"syntology":null},{"url":"/paper/dag-matters-gflownets-enhanced-explainer-for","slug":"dag-matters-gflownets-enhanced-explainer-for","title":"DAG Matters! GFlowNets Enhanced Explainer For Graph Neural Networks","date":"2023-03-04","arxiv_id":"2303.02448","repositories_listed":1,"syntology":null},{"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/asp-learn-a-universal-neural-solver","slug":"asp-learn-a-universal-neural-solver","title":"ASP: Learn a Universal Neural Solver!","date":"2023-03-01","arxiv_id":"2303.00466","repositories_listed":1,"syntology":null},{"url":"/paper/learning-large-neighborhood-search-for","slug":"learning-large-neighborhood-search-for","title":"Learning Large Neighborhood Search for Vehicle Routing in Airport Ground Handling","date":"2023-02-27","arxiv_id":"2302.13797","repositories_listed":1,"syntology":null},{"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/graph-adversarial-immunization-for","slug":"graph-adversarial-immunization-for","title":"Graph Adversarial Immunization for Certifiable Robustness","date":"2023-02-16","arxiv_id":"2302.08051","repositories_listed":1,"syntology":null},{"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/decils-pbo-an-effective-local-search-method","slug":"decils-pbo-an-effective-local-search-method","title":"DeciLS-PBO: an Effective Local Search Method for Pseudo-Boolean Optimization","date":"2023-01-28","arxiv_id":"2301.12251","repositories_listed":1,"syntology":null},{"url":"/paper/flex-net-a-graph-neural-network-approach-to","slug":"flex-net-a-graph-neural-network-approach-to","title":"Flex-Net: A Graph Neural Network Approach to Resource Management in Flexible Duplex Networks","date":"2023-01-20","arxiv_id":"2301.11166","repositories_listed":1,"syntology":null},{"url":"/paper/self-averaging-of-digital-memcomputing","slug":"self-averaging-of-digital-memcomputing","title":"Self-averaging of digital memcomputing machines","date":"2023-01-20","arxiv_id":"2301.08787","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-learning-for-combinatorial-1","slug":"unsupervised-learning-for-combinatorial-1","title":"Unsupervised Learning for Combinatorial Optimization Needs Meta-Learning","date":"2023-01-08","arxiv_id":"2301.03116","repositories_listed":1,"syntology":null},{"url":"/paper/walkability-optimization-formulations","slug":"walkability-optimization-formulations","title":"Walkability Optimization: Formulations, Algorithms, and a Case Study of Toronto","date":"2022-12-10","arxiv_id":"2212.05192","repositories_listed":1,"syntology":null},{"url":"/paper/the-bemi-stardust-a-structured-ensemble-of","slug":"the-bemi-stardust-a-structured-ensemble-of","title":"Multi-Objective Linear Ensembles for Robust and Sparse Training of Few-Bit Neural Networks","date":"2022-12-07","arxiv_id":"2212.03659","repositories_listed":1,"syntology":null},{"url":"/paper/reinforced-genetic-algorithm-for-structure","slug":"reinforced-genetic-algorithm-for-structure","title":"Reinforced Genetic Algorithm for Structure-based Drug Design","date":"2022-11-28","arxiv_id":"2211.16508","repositories_listed":1,"syntology":null},{"url":"/paper/domain-independent-dynamic-programming","slug":"domain-independent-dynamic-programming","title":"Domain-Independent Dynamic Programming: Generic State Space Search for Combinatorial Optimization","date":"2022-11-26","arxiv_id":"2211.14409","repositories_listed":1,"syntology":null},{"url":"/paper/optimal-discrete-beamforming-of","slug":"optimal-discrete-beamforming-of","title":"Optimal Discrete Beamforming of RIS-Aided Wireless Communications: An Inner Product Maximization Approach","date":"2022-11-08","arxiv_id":"2211.04167","repositories_listed":1,"syntology":null},{"url":"/paper/balancing-utility-and-fairness-in-submodular","slug":"balancing-utility-and-fairness-in-submodular","title":"Balancing Utility and Fairness in Submodular Maximization (Technical Report)","date":"2022-11-02","arxiv_id":"2211.00980","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-optimization-and-learning-for","slug":"end-to-end-optimization-and-learning-for","title":"Differentiable Model Selection for Ensemble Learning","date":"2022-11-01","arxiv_id":"2211.00251","repositories_listed":1,"syntology":null},{"url":"/paper/operator-selection-in-adaptive-large","slug":"operator-selection-in-adaptive-large","title":"Online Control of Adaptive Large Neighborhood Search using Deep Reinforcement Learning","date":"2022-11-01","arxiv_id":"2211.00759","repositories_listed":1,"syntology":null},{"url":"/paper/low-complexity-detect-and-avoid-for","slug":"low-complexity-detect-and-avoid-for","title":"Artificial Potential Field-Based Path Planning for Cluttered Environments","date":"2022-10-31","arxiv_id":"2210.17482","repositories_listed":1,"syntology":null},{"url":"/paper/neuroprim-an-attention-based-model-for","slug":"neuroprim-an-attention-based-model-for","title":"NeuroPrim: An Attention-based Model for Solving NP-hard Spanning Tree Problems","date":"2022-10-22","arxiv_id":"2210.12453","repositories_listed":1,"syntology":null},{"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/navigating-memory-construction-by-global","slug":"navigating-memory-construction-by-global","title":"Navigating Memory Construction by Global Pseudo-Task Simulation for Continual Learning","date":"2022-10-16","arxiv_id":"2210.08442","repositories_listed":1,"syntology":null},{"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/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/travel-the-same-path-a-novel-tsp-solving","slug":"travel-the-same-path-a-novel-tsp-solving","title":"Travel the Same Path: A Novel TSP Solving Strategy","date":"2022-10-12","arxiv_id":"2210.05906","repositories_listed":1,"syntology":null},{"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/sequential-brick-assembly-with-efficient","slug":"sequential-brick-assembly-with-efficient","title":"Budget-Aware Sequential Brick Assembly with Efficient Constraint Satisfaction","date":"2022-10-03","arxiv_id":"2210.01021","repositories_listed":1,"syntology":null},{"url":"/paper/inability-of-a-graph-neural-network-heuristic","slug":"inability-of-a-graph-neural-network-heuristic","title":"Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems like Max-Cut","date":"2022-10-02","arxiv_id":"2210.00623","repositories_listed":1,"syntology":null},{"url":"/paper/structure-learning-of-quantum-embeddings","slug":"structure-learning-of-quantum-embeddings","title":"Automatic and effective discovery of quantum kernels","date":"2022-09-22","arxiv_id":"2209.11144","repositories_listed":1,"syntology":null},{"url":"/paper/the-un-scalability-of-heuristic-approximators","slug":"the-un-scalability-of-heuristic-approximators","title":"The (Un)Scalability of Heuristic Approximators for NP-Hard Search Problems","date":"2022-09-07","arxiv_id":"2209.03393","repositories_listed":1,"syntology":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/evaluate-quantum-combinatorial-optimization","slug":"evaluate-quantum-combinatorial-optimization","title":"Evaluate Quantum Combinatorial Optimization for Distribution Network Reconfiguration","date":"2022-08-16","arxiv_id":"2208.07513","repositories_listed":1,"syntology":null},{"url":"/paper/combining-gradients-and-probabilities-for","slug":"combining-gradients-and-probabilities-for","title":"Combining Gradients and Probabilities for Heterogeneous Approximation of Neural Networks","date":"2022-08-15","arxiv_id":"2208.07265","repositories_listed":1,"syntology":null},{"url":"/paper/neural-set-function-extensions-learning-with","slug":"neural-set-function-extensions-learning-with","title":"Neural Set Function Extensions: Learning with Discrete Functions in High Dimensions","date":"2022-08-08","arxiv_id":"2208.04055","repositories_listed":1,"syntology":null},{"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/reinforcement-learning-assisted-recursive","slug":"reinforcement-learning-assisted-recursive","title":"Reinforcement Learning Assisted Recursive QAOA","date":"2022-07-13","arxiv_id":"2207.06294","repositories_listed":1,"syntology":null},{"url":"/paper/simulation-guided-beam-search-for-neural","slug":"simulation-guided-beam-search-for-neural","title":"Simulation-guided Beam Search for Neural Combinatorial Optimization","date":"2022-07-13","arxiv_id":"2207.06190","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/simulation-guided-beam-search-for-neural#ran","syntology_url":"https://syntology.ai/paper/2207.06190","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.06190"}},"official":{"repos":["yd-kwon/sgbs"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/unsupervised-learning-for-combinatorial","slug":"unsupervised-learning-for-combinatorial","title":"Unsupervised Learning for Combinatorial Optimization with Principled Objective Relaxation","date":"2022-07-13","arxiv_id":"2207.05984","repositories_listed":1,"syntology":null},{"url":"/paper/reinforced-lin-kernighan-helsgaun-algorithms","slug":"reinforced-lin-kernighan-helsgaun-algorithms","title":"Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems","date":"2022-07-08","arxiv_id":"2207.03876","repositories_listed":1,"syntology":null},{"url":"/paper/cracking-nuts-with-a-sledgehammer-when-modern","slug":"cracking-nuts-with-a-sledgehammer-when-modern","title":"Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set","date":"2022-06-27","arxiv_id":"2206.13211","repositories_listed":1,"syntology":null},{"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/neural-improvement-heuristics-for-preference","slug":"neural-improvement-heuristics-for-preference","title":"Neural Improvement Heuristics for Graph Combinatorial Optimization Problems","date":"2022-06-01","arxiv_id":"2206.00383","repositories_listed":1,"syntology":null},{"url":"/paper/mip-gnn-a-data-driven-framework-for-guiding","slug":"mip-gnn-a-data-driven-framework-for-guiding","title":"MIP-GNN: A Data-Driven Framework for Guiding Combinatorial Solvers","date":"2022-05-27","arxiv_id":"2205.14210","repositories_listed":1,"syntology":null},{"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/doge-train-discrete-optimization-on-gpu-with","slug":"doge-train-discrete-optimization-on-gpu-with","title":"DOGE-Train: Discrete Optimization on GPU with End-to-end Training","date":"2022-05-23","arxiv_id":"2205.11638","repositories_listed":1,"syntology":null},{"url":"/paper/terrain-analysis-in-starcraft-1-and-2-as","slug":"terrain-analysis-in-starcraft-1-and-2-as","title":"Terrain Analysis in StarCraft 1 and 2 as Combinatorial Optimization","date":"2022-05-18","arxiv_id":"2205.08683","repositories_listed":1,"syntology":null},{"url":"/paper/problem-decomposition-and-multi-shot-asp","slug":"problem-decomposition-and-multi-shot-asp","title":"Decomposition Strategies and Multi-shot ASP Solving for Job-shop Scheduling","date":"2022-05-16","arxiv_id":"2205.07537","repositories_listed":1,"syntology":null},{"url":"/paper/laws-look-around-and-warm-start-natural","slug":"laws-look-around-and-warm-start-natural","title":"LAWS: Look Around and Warm-Start Natural Gradient Descent for Quantum Neural Networks","date":"2022-05-05","arxiv_id":"2205.02666","repositories_listed":1,"syntology":null},{"url":"/paper/a-word-is-worth-a-thousand-dollars-2","slug":"a-word-is-worth-a-thousand-dollars-2","title":"A Word is Worth A Thousand Dollars: Adversarial Attack on Tweets Fools Stock Predictions","date":"2022-05-01","arxiv_id":"2205.01094","repositories_listed":1,"syntology":null},{"url":"/paper/bilp-q-quantum-coalition-structure-generation","slug":"bilp-q-quantum-coalition-structure-generation","title":"BILP-Q: Quantum Coalition Structure Generation","date":"2022-04-28","arxiv_id":"2204.13802","repositories_listed":1,"syntology":null},{"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/map-elites-based-hyper-heuristic-for-the","slug":"map-elites-based-hyper-heuristic-for-the","title":"MAP-Elites based Hyper-Heuristic for the Resource Constrained Project Scheduling Problem","date":"2022-04-24","arxiv_id":"2204.11162","repositories_listed":1,"syntology":null},{"url":"/paper/optimal-intermittent-particle-filter","slug":"optimal-intermittent-particle-filter","title":"Optimal Intermittent Particle Filter","date":"2022-04-13","arxiv_id":"2204.06265","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-solve-travelling-salesman-problem","slug":"learning-to-solve-travelling-salesman-problem","title":"Learning to Solve Travelling Salesman Problem with Hardness-adaptive Curriculum","date":"2022-04-07","arxiv_id":"2204.03236","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/learning-to-solve-travelling-salesman-problem#ran","syntology_url":"https://syntology.ai/paper/2204.03236","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.03236"}},"official":{"repos":["wondergo2017/tsp-hac"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/pareto-set-learning-for-neural-multi","slug":"pareto-set-learning-for-neural-multi","title":"Pareto Set Learning for Neural Multi-objective Combinatorial Optimization","date":"2022-03-29","arxiv_id":"2203.15386","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/pareto-set-learning-for-neural-multi#ran","syntology_url":"https://syntology.ai/paper/2203.15386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15386"}},"official":{"repos":["xi-l/pmoco"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/s-rocket-selective-random-convolution-kernels","slug":"s-rocket-selective-random-convolution-kernels","title":"S-Rocket: Selective Random Convolution Kernels for Time Series Classification","date":"2022-03-07","arxiv_id":"2203.03445","repositories_listed":1,"syntology":null},{"url":"/paper/combining-reinforcement-learning-and-optimal","slug":"combining-reinforcement-learning-and-optimal","title":"Combining Reinforcement Learning and Optimal Transport for the Traveling Salesman Problem","date":"2022-03-02","arxiv_id":"2203.00903","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-curriculum-learning-in-policy","slug":"understanding-curriculum-learning-in-policy","title":"Understanding Curriculum Learning in Policy Optimization for Online Combinatorial Optimization","date":"2022-02-11","arxiv_id":"2202.05423","repositories_listed":1,"syntology":null},{"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/l0learn-a-scalable-package-for-sparse","slug":"l0learn-a-scalable-package-for-sparse","title":"L0Learn: A Scalable Package for Sparse Learning using L0 Regularization","date":"2022-02-10","arxiv_id":"2202.04820","repositories_listed":1,"syntology":null},{"url":"/paper/gsn-a-universal-graph-neural-network-inspired","slug":"gsn-a-universal-graph-neural-network-inspired","title":"MGNN: Graph Neural Networks Inspired by Distance Geometry Problem","date":"2022-01-31","arxiv_id":"2201.12994","repositories_listed":1,"syntology":null},{"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/the-first-ai4tsp-competition-learning-to","slug":"the-first-ai4tsp-competition-learning-to","title":"The First AI4TSP Competition: Learning to Solve Stochastic Routing Problems","date":"2022-01-25","arxiv_id":"2201.10453","repositories_listed":1,"syntology":null},{"url":"/paper/what-s-wrong-with-deep-learning-in-tree","slug":"what-s-wrong-with-deep-learning-in-tree","title":"What's Wrong with Deep Learning in Tree Search for Combinatorial Optimization","date":"2022-01-25","arxiv_id":"2201.10494","repositories_listed":1,"syntology":null},{"url":"/paper/a-word-is-worth-a-thousand-dollars-1","slug":"a-word-is-worth-a-thousand-dollars-1","title":"A Word is Worth A Thousand Dollars: Adversarial Attack on Tweets Fools Stock Prediction","date":"2022-01-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/solving-dynamic-graph-problems-with-multi","slug":"solving-dynamic-graph-problems-with-multi","title":"Solving Dynamic Graph Problems with Multi-Attention Deep Reinforcement Learning","date":"2022-01-13","arxiv_id":"2201.04895","repositories_listed":1,"syntology":null},{"url":"/paper/an-efficient-combinatorial-optimization-model","slug":"an-efficient-combinatorial-optimization-model","title":"An Efficient Combinatorial Optimization Model Using Learning-to-Rank Distillation","date":"2021-12-24","arxiv_id":"2201.00695","repositories_listed":1,"syntology":null},{"url":"/paper/reconstructing-compact-building-models-from","slug":"reconstructing-compact-building-models-from","title":"Reconstructing Compact Building Models from Point Clouds Using Deep Implicit Fields","date":"2021-12-24","arxiv_id":"2112.13142","repositories_listed":1,"syntology":null},{"url":"/paper/a-deep-reinforcement-learning-approach-for-11","slug":"a-deep-reinforcement-learning-approach-for-11","title":"A Deep Reinforcement Learning Approach for Solving the Traveling Salesman Problem with Drone","date":"2021-12-22","arxiv_id":"2112.12545","repositories_listed":1,"syntology":null},{"url":"/paper/pretrained-cost-model-for-distributed","slug":"pretrained-cost-model-for-distributed","title":"Pretrained Cost Model for Distributed Constraint Optimization Problems","date":"2021-12-08","arxiv_id":"2112.04187","repositories_listed":1,"syntology":null},{"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/solving-graph-based-public-goods-games-with","slug":"solving-graph-based-public-goods-games-with","title":"Solving Graph-based Public Goods Games with Tree Search and Imitation Learning","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/symbolic-regression-via-deep-reinforcement","slug":"symbolic-regression-via-deep-reinforcement","title":"Symbolic Regression via Deep Reinforcement Learning Enhanced Genetic Programming Seeding","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/one-model-packs-thousands-of-items-with","slug":"one-model-packs-thousands-of-items-with","title":"One model Packs Thousands of Items with Recurrent Conditional Query Learning","date":"2021-11-12","arxiv_id":"2111.06726","repositories_listed":1,"syntology":null}],"record_sha256":"72e18e0e54f56e1073903308700ca9d4f48de4d1762d182519c6f3915a6f6d10","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}