{"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/evolutionary-algorithms/papers/2","list_of":"/task/evolutionary-algorithms","task":"Evolutionary Algorithms","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":2,"pages_in_order":12,"rows_per_page":100,"rows":[101,200],"of":1107,"counts":{"archive_papers_tagged":1107,"with_a_code_link":241,"where_syntology_ran_a_sample":36,"not_listed_spam_title":0,"listed":1107,"listed_where_code_ran":36,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":32,"every_run_a_failure_of_syntologys_instrument":4,"listed_with_a_run_with_no_instrument_failure":32,"listed_every_run_a_failure_of_syntologys_instrument":4,"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/evolutionary-algorithms","prev":"/task/evolutionary-algorithms","next":"/task/evolutionary-algorithms/papers/3","papers":[{"url":"/paper/large-language-model-for-multi-objective","slug":"large-language-model-for-multi-objective","title":"Large Language Model for Multi-objective Evolutionary Optimization","date":"2023-10-19","arxiv_id":"2310.12541","repositories_listed":1,"syntology":null},{"url":"/paper/abcd-a-component-wise-adjustable-framework","slug":"abcd-a-component-wise-adjustable-framework","title":"AbCD: A Component-wise Adjustable Framework for Dynamic Optimization Problems","date":"2023-10-09","arxiv_id":"2310.05505","repositories_listed":1,"syntology":null},{"url":"/paper/bivariate-estimation-of-distribution","slug":"bivariate-estimation-of-distribution","title":"Bivariate Estimation-of-Distribution Algorithms Can Find an Exponential Number of Optima","date":"2023-10-06","arxiv_id":"2310.04042","repositories_listed":1,"syntology":null},{"url":"/paper/speeding-up-evolutionary-algorithms-to-solve","slug":"speeding-up-evolutionary-algorithms-to-solve","title":"Speeding-up Evolutionary Algorithms to solve Black-Box Optimization Problems","date":"2023-09-23","arxiv_id":"2309.13349","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-saeas-with-unevaluated-solutions-a","slug":"enhancing-saeas-with-unevaluated-solutions-a","title":"Enhancing SAEAs with Unevaluated Solutions: A Case Study of Relation Model for Expensive Optimization","date":"2023-09-21","arxiv_id":"2309.11994","repositories_listed":1,"syntology":null},{"url":"/paper/fastaialloc-a-real-time-multi-resources","slug":"fastaialloc-a-real-time-multi-resources","title":"FastAiAlloc: A real-time multi-resources allocation framework proposal based on predictive model and multiple optimization strategies","date":"2023-08-09","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/many-objective-optimization-via-voting-for","slug":"many-objective-optimization-via-voting-for","title":"Many-objective Optimization via Voting for Elites","date":"2023-07-05","arxiv_id":"2307.02661","repositories_listed":1,"syntology":null},{"url":"/paper/improving-time-and-memory-efficiency-of","slug":"improving-time-and-memory-efficiency-of","title":"Improving Time and Memory Efficiency of Genetic Algorithms by Storing Populations as Minimum Spanning Trees of Patches","date":"2023-06-29","arxiv_id":"2306.16686","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-the-effects-of-robotic-design-on","slug":"exploring-the-effects-of-robotic-design-on","title":"Exploring the effects of robotic design on learning and neural control","date":"2023-06-06","arxiv_id":"2306.03757","repositories_listed":1,"syntology":null},{"url":"/paper/continuous-cartesian-genetic-programming","slug":"continuous-cartesian-genetic-programming","title":"Continuous Cartesian Genetic Programming based representation for Multi-Objective Neural Architecture Search","date":"2023-06-05","arxiv_id":"2306.02648","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-genetic-optimization-of","slug":"accelerating-genetic-optimization-of","title":"Accelerating genetic optimization of nonlinear model predictive control by learning optimal search space size","date":"2023-05-14","arxiv_id":"2305.08094","repositories_listed":1,"syntology":null},{"url":"/paper/how-well-does-the-metropolis-algorithm-cope","slug":"how-well-does-the-metropolis-algorithm-cope","title":"How Well Does the Metropolis Algorithm Cope With Local Optima?","date":"2023-04-21","arxiv_id":"2304.10848","repositories_listed":1,"syntology":null},{"url":"/paper/evolving-constrained-reinforcement-learning","slug":"evolving-constrained-reinforcement-learning","title":"Evolving Constrained Reinforcement Learning Policy","date":"2023-04-19","arxiv_id":"2304.09869","repositories_listed":1,"syntology":null},{"url":"/paper/rank-based-learning-and-local-model-based","slug":"rank-based-learning-and-local-model-based","title":"Rank-Based Learning and Local Model Based Evolutionary Algorithm for High-Dimensional Expensive Multi-Objective Problems","date":"2023-04-19","arxiv_id":"2304.09444","repositories_listed":1,"syntology":null},{"url":"/paper/experience-based-evolutionary-algorithms-for","slug":"experience-based-evolutionary-algorithms-for","title":"Experience-Based Evolutionary Algorithms for Expensive Optimization","date":"2023-04-09","arxiv_id":"2304.04166","repositories_listed":1,"syntology":null},{"url":"/paper/neuroevolution-of-recurrent-architectures-on","slug":"neuroevolution-of-recurrent-architectures-on","title":"Neuroevolution of Recurrent Architectures on Control Tasks","date":"2023-04-03","arxiv_id":"2304.12431","repositories_listed":1,"syntology":null},{"url":"/paper/scaling-multi-objective-security-games","slug":"scaling-multi-objective-security-games","title":"Scaling Multi-Objective Security Games Provably via Space Discretization Based Evolutionary Search","date":"2023-03-28","arxiv_id":"2303.15821","repositories_listed":1,"syntology":null},{"url":"/paper/improving-the-data-efficiency-of-multi","slug":"improving-the-data-efficiency-of-multi","title":"Improving the Data Efficiency of Multi-Objective Quality-Diversity through Gradient Assistance and Crowding Exploration","date":"2023-02-24","arxiv_id":"2302.12668","repositories_listed":1,"syntology":null},{"url":"/paper/pareto-dominance-archive-and-coordinated","slug":"pareto-dominance-archive-and-coordinated","title":"Pareto Dominance Archive and Coordinated Selection Strategy-Based Many-Objective Optimizer for Protein Structure Prediction","date":"2023-02-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/efficient-generator-of-mathematical","slug":"efficient-generator-of-mathematical","title":"Efficient Generator of Mathematical Expressions for Symbolic Regression","date":"2023-02-20","arxiv_id":"2302.09893","repositories_listed":1,"syntology":null},{"url":"/paper/elea-build-your-own-evolutionary-algorithm-in","slug":"elea-build-your-own-evolutionary-algorithm-in","title":"ELEA -- Build your own Evolutionary Algorithm in your Browser","date":"2023-02-13","arxiv_id":"2302.06277","repositories_listed":1,"syntology":null},{"url":"/paper/benchmarking-algorithms-for-submodular","slug":"benchmarking-algorithms-for-submodular","title":"Benchmarking Algorithms for Submodular Optimization Problems Using IOHProfiler","date":"2023-02-02","arxiv_id":"2302.01464","repositories_listed":1,"syntology":null},{"url":"/paper/nasiam-efficient-representation-learning","slug":"nasiam-efficient-representation-learning","title":"NASiam: Efficient Representation Learning using Neural Architecture Search for Siamese Networks","date":"2023-01-31","arxiv_id":"2302.00059","repositories_listed":1,"syntology":null},{"url":"/paper/pypop7-a-pure-python-library-for-population","slug":"pypop7-a-pure-python-library-for-population","title":"PyPop7: A Pure-Python Library for Population-Based Black-Box Optimization","date":"2022-12-12","arxiv_id":"2212.05652","repositories_listed":1,"syntology":null},{"url":"/paper/coevolutionary-framework-for-generalized","slug":"coevolutionary-framework-for-generalized","title":"Coevolutionary Framework for Generalized Multimodal Multi-objective Optimization","date":"2022-12-02","arxiv_id":"2212.01219","repositories_listed":1,"syntology":null},{"url":"/paper/on-narrative-information-and-the-distillation","slug":"on-narrative-information-and-the-distillation","title":"On Narrative Information and the Distillation of Stories","date":"2022-11-22","arxiv_id":"2211.12423","repositories_listed":1,"syntology":null},{"url":"/paper/multi-objective-optimization-via-evolutionary","slug":"multi-objective-optimization-via-evolutionary","title":"Multi-objective optimization via evolutionary algorithm (MOVEA) for high-definition transcranial electrical stimulation of the human brain","date":"2022-11-10","arxiv_id":"2211.05658","repositories_listed":1,"syntology":null},{"url":"/paper/erl-re-2-efficient-evolutionary-reinforcement","slug":"erl-re-2-efficient-evolutionary-reinforcement","title":"ERL-Re$^2$: Efficient Evolutionary Reinforcement Learning with Shared State Representation and Individual Policy Representation","date":"2022-10-26","arxiv_id":"2210.17375","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":1,"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/erl-re-2-efficient-evolutionary-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2210.17375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.17375"}},"official":{"repos":["yeshenpy/erl-re2"],"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/shortest-edit-path-crossover-a-theory-driven","slug":"shortest-edit-path-crossover-a-theory-driven","title":"Shortest Edit Path Crossover: A Theory-driven Solution to the Permutation Problem in Evolutionary Neural Architecture Search","date":"2022-10-25","arxiv_id":"2210.14016","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/shortest-edit-path-crossover-a-theory-driven#ran","syntology_url":"https://syntology.ai/paper/2210.14016","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.14016"}},"official":{"repos":["cognizant-ai-labs/sepx-paper"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/multi-objective-optimization-via-equivariant","slug":"multi-objective-optimization-via-equivariant","title":"Multi-objective optimization via equivariant deep hypervolume approximation","date":"2022-10-05","arxiv_id":"2210.02177","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-objective-optimization-via-equivariant#ran","syntology_url":"https://syntology.ai/paper/2210.02177","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.02177"}},"official":{"repos":["jimbo994/deephv-iclr"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-re-optimization-of-leadingones-with","slug":"fast-re-optimization-of-leadingones-with","title":"Fast Re-Optimization of LeadingOnes with Frequent Changes","date":"2022-09-09","arxiv_id":"2209.04391","repositories_listed":1,"syntology":null},{"url":"/paper/a-new-kind-of-adversarial-example","slug":"a-new-kind-of-adversarial-example","title":"A New Kind of Adversarial Example","date":"2022-08-04","arxiv_id":"2208.02430","repositories_listed":1,"syntology":null},{"url":"/paper/evolutionary-bagged-ensemble-learning","slug":"evolutionary-bagged-ensemble-learning","title":"Evolutionary bagging for ensemble learning","date":"2022-08-04","arxiv_id":"2208.02400","repositories_listed":1,"syntology":null},{"url":"/paper/assessing-ranking-and-effectiveness-of","slug":"assessing-ranking-and-effectiveness-of","title":"Assessing Ranking and Effectiveness of Evolutionary Algorithm Hyperparameters Using Global Sensitivity Analysis Methodologies","date":"2022-07-11","arxiv_id":"2207.04820","repositories_listed":1,"syntology":null},{"url":"/paper/multimodal-multi-objective-optimization","slug":"multimodal-multi-objective-optimization","title":"Multimodal Multi-objective Optimization: Comparative Study of the State-of-the-Art","date":"2022-07-11","arxiv_id":"2207.04730","repositories_listed":1,"syntology":null},{"url":"/paper/centralized-and-decentralized-control-in","slug":"centralized-and-decentralized-control-in","title":"Centralized and Decentralized Control in Modular Robots and Their Effect on Morphology","date":"2022-06-27","arxiv_id":"2206.13366","repositories_listed":1,"syntology":null},{"url":"/paper/cycle-mutation-evolving-permutations-via","slug":"cycle-mutation-evolving-permutations-via","title":"Cycle Mutation: Evolving Permutations via Cycle Induction","date":"2022-05-27","arxiv_id":"2205.14125","repositories_listed":1,"syntology":null},{"url":"/paper/evolutionary-multi-armed-bandits-with-genetic","slug":"evolutionary-multi-armed-bandits-with-genetic","title":"Evolutionary Multi-Armed Bandits with Genetic Thompson Sampling","date":"2022-04-26","arxiv_id":"2205.10113","repositories_listed":1,"syntology":null},{"url":"/paper/high-performance-evolutionary-algorithms-for","slug":"high-performance-evolutionary-algorithms-for","title":"High-performance Evolutionary Algorithms for Online Neuron Control","date":"2022-04-14","arxiv_id":"2204.06765","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/high-performance-evolutionary-algorithms-for#ran","syntology_url":"https://syntology.ai/paper/2204.06765","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.06765"}},"official":{"repos":["animadversio/actmax-optimizer-dev"],"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/improving-lshade-by-means-of-a-pre-screening","slug":"improving-lshade-by-means-of-a-pre-screening","title":"Improving LSHADE by means of a pre-screening mechanism","date":"2022-04-08","arxiv_id":"2204.04105","repositories_listed":1,"syntology":null},{"url":"/paper/reproducibility-and-baseline-reporting-for","slug":"reproducibility-and-baseline-reporting-for","title":"Reproducibility and Baseline Reporting for Dynamic Multi-objective Benchmark Problems","date":"2022-04-08","arxiv_id":"2204.04140","repositories_listed":1,"syntology":null},{"url":"/paper/novelty-driven-evolutionary-neural","slug":"novelty-driven-evolutionary-neural","title":"Novelty Driven Evolutionary Neural Architecture Search","date":"2022-04-01","arxiv_id":"2204.00188","repositories_listed":1,"syntology":null},{"url":"/paper/evolutionary-programmer-autonomously-creating","slug":"evolutionary-programmer-autonomously-creating","title":"Evolutionary Programmer: Autonomously Creating Path Planning Programs based on Evolutionary Algorithms","date":"2022-03-30","arxiv_id":"2204.02970","repositories_listed":1,"syntology":null},{"url":"/paper/non-elitist-selection-among-survivor","slug":"non-elitist-selection-among-survivor","title":"Non-Elitist Selection Can Improve the Performance of Irace","date":"2022-03-17","arxiv_id":"2203.09227","repositories_listed":1,"syntology":null},{"url":"/paper/automated-formulaic-alpha-generation-for","slug":"automated-formulaic-alpha-generation-for","title":"Automated Formulaic Alpha Generation for Quantitative Investing using Evolutionary Algorithms","date":"2022-03-13","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/solving-multi-structured-problems-by","slug":"solving-multi-structured-problems-by","title":"Solving Multi-Structured Problems by Introducing Linkage Kernels into GOMEA","date":"2022-03-11","arxiv_id":"2203.05970","repositories_listed":1,"syntology":null},{"url":"/paper/neural-architecture-search-using-progressive","slug":"neural-architecture-search-using-progressive","title":"Neural Architecture Search using Progressive Evolution","date":"2022-03-03","arxiv_id":"2203.01559","repositories_listed":1,"syntology":null},{"url":"/paper/theory-inspired-parameter-control-benchmarks","slug":"theory-inspired-parameter-control-benchmarks","title":"Theory-inspired Parameter Control Benchmarks for Dynamic Algorithm Configuration","date":"2022-02-07","arxiv_id":"2202.03259","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/theory-inspired-parameter-control-benchmarks#ran","syntology_url":"https://syntology.ai/paper/2202.03259","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.03259"}},"official":{"repos":["caroladoerr/leadingonedac"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/coil-constrained-optimization-in-learned","slug":"coil-constrained-optimization-in-learned","title":"COIL: Constrained Optimization in Learned Latent Space: Learning Representations for Valid Solutions","date":"2022-02-04","arxiv_id":"2202.02163","repositories_listed":1,"syntology":null},{"url":"/paper/optimizing-llvm-pass-sequences-with","slug":"optimizing-llvm-pass-sequences-with","title":"Optimizing LLVM Pass Sequences with Shackleton: A Linear Genetic Programming Framework","date":"2022-01-31","arxiv_id":"2201.13305","repositories_listed":1,"syntology":null},{"url":"/paper/zeroth-order-actor-critic-1","slug":"zeroth-order-actor-critic-1","title":"Zeroth-Order Actor-Critic: An Evolutionary Framework for Sequential Decision Problems","date":"2022-01-29","arxiv_id":"2201.12518","repositories_listed":1,"syntology":null},{"url":"/paper/search-trajectories-networks-of","slug":"search-trajectories-networks-of","title":"Search Trajectories Networks of Multiobjective Evolutionary Algorithms","date":"2022-01-27","arxiv_id":"2201.11726","repositories_listed":1,"syntology":null},{"url":"/paper/training-quantized-deep-neural-networks-via","slug":"training-quantized-deep-neural-networks-via","title":"Training Quantized Deep Neural Networks via Cooperative Coevolution","date":"2021-12-23","arxiv_id":"2112.14834","repositories_listed":1,"syntology":null},{"url":"/paper/hybrid-self-attention-neat-a-novel","slug":"hybrid-self-attention-neat-a-novel","title":"Hybrid Self-Attention NEAT: A novel evolutionary approach to improve the NEAT algorithm","date":"2021-12-07","arxiv_id":"2112.03670","repositories_listed":1,"syntology":null},{"url":"/paper/evolearner-learning-description-logics-with","slug":"evolearner-learning-description-logics-with","title":"EvoLearner: Learning Description Logics with Evolutionary Algorithms","date":"2021-11-08","arxiv_id":"2111.04879","repositories_listed":1,"syntology":null},{"url":"/paper/result-diversification-by-multi-objective","slug":"result-diversification-by-multi-objective","title":"Result Diversification by Multi-objective Evolutionary Algorithms with Theoretical Guarantees","date":"2021-10-18","arxiv_id":"2110.09332","repositories_listed":1,"syntology":null},{"url":"/paper/improving-the-sample-efficiency-of-neural","slug":"improving-the-sample-efficiency-of-neural","title":"Improving the sample-efficiency of neural architecture search with reinforcement learning","date":"2021-10-13","arxiv_id":"2110.06751","repositories_listed":1,"syntology":null},{"url":"/paper/towards-explainable-real-estate-valuation-via","slug":"towards-explainable-real-estate-valuation-via","title":"Towards Explainable Real Estate Valuation via Evolutionary Algorithms","date":"2021-10-11","arxiv_id":"2110.05116","repositories_listed":1,"syntology":null},{"url":"/paper/evolving-evolutionary-algorithms-with","slug":"evolving-evolutionary-algorithms-with","title":"Evolving Evolutionary Algorithms with Patterns","date":"2021-10-10","arxiv_id":"2110.05951","repositories_listed":1,"syntology":null},{"url":"/paper/transfer-learning-based-multi-objective","slug":"transfer-learning-based-multi-objective","title":"Transfer Learning Based Multi-Objective Genetic Algorithm for Dynamic Community Detection","date":"2021-09-30","arxiv_id":"2109.15136","repositories_listed":1,"syntology":null},{"url":"/paper/modern-evolution-strategies-for-creativity","slug":"modern-evolution-strategies-for-creativity","title":"Modern Evolution Strategies for Creativity: Fitting Concrete Images and Abstract Concepts","date":"2021-09-18","arxiv_id":"2109.08857","repositories_listed":1,"syntology":null},{"url":"/paper/a-scalable-continuous-unbounded-optimisation","slug":"a-scalable-continuous-unbounded-optimisation","title":"A Continuous Optimisation Benchmark Suite from Neural Network Regression","date":"2021-09-12","arxiv_id":"2109.05606","repositories_listed":1,"syntology":null},{"url":"/paper/what-can-phylogenetic-metrics-tell-us-about","slug":"what-can-phylogenetic-metrics-tell-us-about","title":"What can phylogenetic metrics tell us about useful diversity in evolutionary algorithms?","date":"2021-08-28","arxiv_id":"2108.12586","repositories_listed":1,"syntology":null},{"url":"/paper/evolving-evolutionary-algorithms-using-multi","slug":"evolving-evolutionary-algorithms-using-multi","title":"Evolving Evolutionary Algorithms using Multi Expression Programming","date":"2021-08-22","arxiv_id":"2109.13737","repositories_listed":1,"syntology":null},{"url":"/paper/quasi-genetic-algorithms-and-continuation","slug":"quasi-genetic-algorithms-and-continuation","title":"Continuation Newton methods with deflation techniques for global optimization problems","date":"2021-07-29","arxiv_id":"2107.13864","repositories_listed":1,"syntology":null},{"url":"/paper/improved-evolutionary-generative-adversarial","slug":"improved-evolutionary-generative-adversarial","title":"IE-GAN: An Improved Evolutionary Generative Adversarial Network Using a New Fitness Function and a Generic Crossover Operator","date":"2021-07-25","arxiv_id":"2109.11078","repositories_listed":1,"syntology":null},{"url":"/paper/a-federated-data-driven-evolutionary-1","slug":"a-federated-data-driven-evolutionary-1","title":"A Federated Data-Driven Evolutionary Algorithm for Expensive Multi/Many-objective Optimization","date":"2021-06-22","arxiv_id":"2106.12086","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-resource-allocation-with-graph","slug":"unsupervised-resource-allocation-with-graph","title":"Unsupervised Resource Allocation with Graph Neural Networks","date":"2021-06-17","arxiv_id":"2106.09761","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/unsupervised-resource-allocation-with-graph#ran","syntology_url":"https://syntology.ai/paper/2106.09761","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09761"}},"official":{"repos":["MilesCranmer/gnn_resource_allocation"],"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-behaviour-discovery-with-quality","slug":"unsupervised-behaviour-discovery-with-quality","title":"Unsupervised Behaviour Discovery with Quality-Diversity Optimisation","date":"2021-06-10","arxiv_id":"2106.05648","repositories_listed":1,"syntology":null},{"url":"/paper/janus-parallel-tempered-genetic-algorithm","slug":"janus-parallel-tempered-genetic-algorithm","title":"JANUS: Parallel Tempered Genetic Algorithm Guided by Deep Neural Networks for Inverse Molecular Design","date":"2021-06-07","arxiv_id":"2106.04011","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/janus-parallel-tempered-genetic-algorithm#ran","syntology_url":"https://syntology.ai/paper/2106.04011","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04011"}},"official":{"repos":["aspuru-guzik-group/janus"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/evolutionary-algorithms-for-designing","slug":"evolutionary-algorithms-for-designing","title":"Evolutionary Algorithms for Designing Reversible Cellular Automata","date":"2021-05-25","arxiv_id":"2105.12039","repositories_listed":1,"syntology":null},{"url":"/paper/behavior-based-neuroevolutionary-training-in","slug":"behavior-based-neuroevolutionary-training-in","title":"Behavior-based Neuroevolutionary Training in Reinforcement Learning","date":"2021-05-17","arxiv_id":"2105.07960","repositories_listed":1,"syntology":null},{"url":"/paper/graph-aware-evolutionary-algorithms-for","slug":"graph-aware-evolutionary-algorithms-for","title":"Graph-Aware Evolutionary Algorithms for Influence Maximization","date":"2021-04-30","arxiv_id":"2104.14909","repositories_listed":1,"syntology":null},{"url":"/paper/breeding-diverse-packings-for-the-knapsack","slug":"breeding-diverse-packings-for-the-knapsack","title":"Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms","date":"2021-04-27","arxiv_id":"2104.13133","repositories_listed":1,"syntology":null},{"url":"/paper/seeking-quality-diversity-in-evolutionary-co","slug":"seeking-quality-diversity-in-evolutionary-co","title":"Seeking Quality Diversity in Evolutionary Co-design of Morphology and Control of Soft Tensegrity Modular Robots","date":"2021-04-25","arxiv_id":"2104.12175","repositories_listed":1,"syntology":null},{"url":"/paper/population-network-structure-impacts-genetic","slug":"population-network-structure-impacts-genetic","title":"Population network structure impacts genetic algorithm optimisation performance","date":"2021-04-09","arxiv_id":"2104.04254","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-object-detection-for-autonomous","slug":"enhancing-object-detection-for-autonomous","title":"Enhancing Object Detection for Autonomous Driving by Optimizing Anchor Generation and Addressing Class Imbalance","date":"2021-04-08","arxiv_id":"2104.03888","repositories_listed":1,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/enhancing-object-detection-for-autonomous#ran","syntology_url":"https://syntology.ai/paper/2104.03888","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.03888"}},"official":{"repos":["carranza96/waymo-detection-optimization"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/playing-against-the-board-rolling-horizon","slug":"playing-against-the-board-rolling-horizon","title":"Playing Against the Board: Rolling Horizon Evolutionary Algorithms Against Pandemic","date":"2021-03-28","arxiv_id":"2103.15090","repositories_listed":1,"syntology":null},{"url":"/paper/policy-search-with-rare-significant-events","slug":"policy-search-with-rare-significant-events","title":"Policy Search with Rare Significant Events: Choosing the Right Partner to Cooperate with","date":"2021-03-11","arxiv_id":"2103.06846","repositories_listed":1,"syntology":null},{"url":"/paper/real-time-topology-optimization-in-3d-via","slug":"real-time-topology-optimization-in-3d-via","title":"Real-Time Topology Optimization in 3D via Deep Transfer Learning","date":"2021-02-11","arxiv_id":"2102.07657","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-stochastic-fractal-search","slug":"a-survey-on-stochastic-fractal-search","title":"A Survey On (Stochastic Fractal Search) Algorithm","date":"2021-01-25","arxiv_id":"2102.01503","repositories_listed":1,"syntology":null},{"url":"/paper/evolutionary-learning-of-interpretable","slug":"evolutionary-learning-of-interpretable","title":"Evolutionary learning of interpretable decision trees","date":"2020-12-14","arxiv_id":"2012.07723","repositories_listed":1,"syntology":null},{"url":"/paper/on-statistical-analysis-of-moeas-with","slug":"on-statistical-analysis-of-moeas-with","title":"On Statistical Analysis of MOEAs with Multiple Performance Indicators","date":"2020-12-01","arxiv_id":"2012.00886","repositories_listed":1,"syntology":null},{"url":"/paper/metaheuristics-for-the-minimum-set-cover","slug":"metaheuristics-for-the-minimum-set-cover","title":"Metaheuristics for the Minimum Set Cover Problem: A Comparison","date":"2020-11-12","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/real-valued-evolutionary-multi-modal-multi","slug":"real-valued-evolutionary-multi-modal-multi","title":"Real-valued Evolutionary Multi-modal Multi-objective Optimization by Hill-Valley Clustering","date":"2020-10-28","arxiv_id":"2010.14998","repositories_listed":1,"syntology":null},{"url":"/paper/black-box-ripper-copying-black-box-models","slug":"black-box-ripper-copying-black-box-models","title":"Black-Box Ripper: Copying black-box models using generative evolutionary algorithms","date":"2020-10-21","arxiv_id":"2010.11158","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/black-box-ripper-copying-black-box-models#ran","syntology_url":"https://syntology.ai/paper/2010.11158","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11158"}},"official":{"repos":["antoniobarbalau/black-box-ripper"],"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/competitiveness-of-map-elites-against","slug":"competitiveness-of-map-elites-against","title":"Competitiveness of MAP-Elites against Proximal Policy Optimization on locomotion tasks in deterministic simulations","date":"2020-09-17","arxiv_id":"2009.08438","repositories_listed":1,"syntology":null},{"url":"/paper/optimistic-variants-of-single-objective","slug":"optimistic-variants-of-single-objective","title":"Optimistic variants of single-objective bilevel optimization for evolutionary algorithms","date":"2020-08-22","arxiv_id":"2008.09926","repositories_listed":1,"syntology":null},{"url":"/paper/a-study-of-a-genetic-algorithm-for","slug":"a-study-of-a-genetic-algorithm-for","title":"A Study of a Genetic Algorithm for Polydisperse Spray Flames","date":"2020-08-11","arxiv_id":"2008.07397","repositories_listed":1,"syntology":null},{"url":"/paper/using-neural-networks-and-diversifying","slug":"using-neural-networks-and-diversifying","title":"Using Neural Networks and Diversifying Differential Evolution for Dynamic Optimisation","date":"2020-08-10","arxiv_id":"2008.04002","repositories_listed":1,"syntology":null},{"url":"/paper/neural-architecture-search-in-graph-neural","slug":"neural-architecture-search-in-graph-neural","title":"Neural Architecture Search in Graph Neural Networks","date":"2020-07-31","arxiv_id":"2008.00077","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":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) · 1 unverified","sample_list":"/paper/neural-architecture-search-in-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2008.00077","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.00077"}},"official":{"repos":["mhnnunes/nas_gnn"],"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/revisiting-locality-in-binary-integer","slug":"revisiting-locality-in-binary-integer","title":"Revisiting Locality in Binary-Integer Representations","date":"2020-07-23","arxiv_id":"2007.12159","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-the-evolution-of-gans-through","slug":"exploring-the-evolution-of-gans-through","title":"Exploring the Evolution of GANs through Quality Diversity","date":"2020-07-13","arxiv_id":"2007.06251","repositories_listed":1,"syntology":null},{"url":"/paper/qd-rl-efficient-mixing-of-quality-and","slug":"qd-rl-efficient-mixing-of-quality-and","title":"Diversity Policy Gradient for Sample Efficient Quality-Diversity Optimization","date":"2020-06-15","arxiv_id":"2006.08505","repositories_listed":1,"syntology":null},{"url":"/paper/unified-framework-for-the-adaptive-operator","slug":"unified-framework-for-the-adaptive-operator","title":"Unified Framework for the Adaptive Operator Selection of Discrete Parameters","date":"2020-05-12","arxiv_id":"2005.05613","repositories_listed":1,"syntology":null},{"url":"/paper/the-dynamic-travelling-thief-problem","slug":"the-dynamic-travelling-thief-problem","title":"The Dynamic Travelling Thief Problem: Benchmarks and Performance of Evolutionary Algorithms","date":"2020-04-25","arxiv_id":"2004.12045","repositories_listed":1,"syntology":null},{"url":"/paper/analysis-of-the-performance-of-algorithm","slug":"analysis-of-the-performance-of-algorithm","title":"Analysis of the Performance of Algorithm Configurators for Search Heuristics with Global Mutation Operators","date":"2020-04-09","arxiv_id":"2004.04519","repositories_listed":1,"syntology":null},{"url":"/paper/self-adjusting-evolutionary-algorithms-for","slug":"self-adjusting-evolutionary-algorithms-for","title":"Self-Adjusting Evolutionary Algorithms for Multimodal Optimization","date":"2020-04-07","arxiv_id":"2004.03266","repositories_listed":1,"syntology":null},{"url":"/paper/re-purposing-heterogeneous-generative","slug":"re-purposing-heterogeneous-generative","title":"Re-purposing Heterogeneous Generative Ensembles with Evolutionary Computation","date":"2020-03-30","arxiv_id":"2003.13532","repositories_listed":1,"syntology":null},{"url":"/paper/npenas-neural-predictor-guided-evolution-for","slug":"npenas-neural-predictor-guided-evolution-for","title":"NPENAS: Neural Predictor Guided Evolution for Neural Architecture Search","date":"2020-03-28","arxiv_id":"2003.12857","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":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) · 2 unverified","sample_list":"/paper/npenas-neural-predictor-guided-evolution-for#ran","syntology_url":"https://syntology.ai/paper/2003.12857","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.12857"}},"official":{"repos":["auroua/NPENASv1"],"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"]}}}],"record_sha256":"7a78675be8d9fd8a977ca0eba821f4e9124159d10cea5c356eb431e6439bae15","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}