{"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","name":"Evolutionary Algorithms","slug":"evolutionary-algorithms","description_markdown":null,"categories":[{"name":"Methodology","url":"/area/methodology"},{"name":"Miscellaneous","url":"/area/miscellaneous"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":1107,"papers_with_code":241,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/stochastic-optimization","name":"Stochastic Optimization"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":12,"rows_per_page":100,"shown":100,"of":1107,"of_with_code":241,"tagged_in_all":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":30,"every_run_a_failure_of_syntologys_instrument":6,"listed_with_a_run_with_no_instrument_failure":30,"listed_every_run_a_failure_of_syntologys_instrument":6,"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"},"items":[{"url":"/paper/progressive-neural-architecture-search","slug":"progressive-neural-architecture-search","title":"Progressive Neural Architecture Search","date":"2017-12-02","arxiv_id":"1712.00559","repositories_listed":18,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/progressive-neural-architecture-search#ran","syntology_url":"https://syntology.ai/paper/1712.00559","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.00559"}},"official":{"repos":["chenxi116/PNASNet.TF","tensorflow/models","chenxi116/PNASNet.pytorch"],"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":["listed","official"]}}},{"url":"/paper/deep-neuroevolution-genetic-algorithms-are-a","slug":"deep-neuroevolution-genetic-algorithms-are-a","title":"Deep Neuroevolution: Genetic Algorithms Are a Competitive Alternative for Training Deep Neural Networks for Reinforcement Learning","date":"2017-12-18","arxiv_id":"1712.06567","repositories_listed":12,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/deep-neuroevolution-genetic-algorithms-are-a#ran","syntology_url":"https://syntology.ai/paper/1712.06567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.06567"}},"official":null}},{"url":"/paper/evolution-guided-policy-gradient-in","slug":"evolution-guided-policy-gradient-in","title":"Evolution-Guided Policy Gradient in Reinforcement Learning","date":"2018-05-21","arxiv_id":"1805.07917","repositories_listed":6,"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":3,"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/evolution-guided-policy-gradient-in#ran","syntology_url":"https://syntology.ai/paper/1805.07917","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.07917"}},"official":{"repos":["ShawK91/erl_paper_nips18"],"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/tree-search-vs-optimization-approaches-for","slug":"tree-search-vs-optimization-approaches-for","title":"Tree Search vs Optimization Approaches for Map Generation","date":"2019-03-27","arxiv_id":"1903.11678","repositories_listed":5,"syntology":null},{"url":"/paper/neural-architecture-optimization","slug":"neural-architecture-optimization","title":"Neural Architecture Optimization","date":"2018-08-22","arxiv_id":"1808.07233","repositories_listed":5,"syntology":null},{"url":"/paper/regularized-evolution-for-image-classifier","slug":"regularized-evolution-for-image-classifier","title":"Regularized Evolution for Image Classifier Architecture Search","date":"2018-02-05","arxiv_id":"1802.01548","repositories_listed":5,"syntology":null},{"url":"/paper/evolutionary-thoughts-integration-of-large","slug":"evolutionary-thoughts-integration-of-large","title":"Evolutionary thoughts: integration of large language models and evolutionary algorithms","date":"2025-05-09","arxiv_id":"2505.05756","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/evolutionary-thoughts-integration-of-large#ran","syntology_url":"https://syntology.ai/paper/2505.05756","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.05756"}},"official":{"repos":["ajjimeno/fast-evolutionary-evaluation","ajjimeno/list-data","ajjimeno/llm-gp"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"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/iohanalyzer-performance-analysis-for","slug":"iohanalyzer-performance-analysis-for","title":"IOHanalyzer: Detailed Performance Analyses for Iterative Optimization Heuristics","date":"2020-07-08","arxiv_id":"2007.03953","repositories_listed":3,"syntology":null},{"url":"/paper/genattack-practical-black-box-attacks-with","slug":"genattack-practical-black-box-attacks-with","title":"GenAttack: Practical Black-box Attacks with Gradient-Free Optimization","date":"2018-05-28","arxiv_id":"1805.11090","repositories_listed":3,"syntology":{"n":12,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":7,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/genattack-practical-black-box-attacks-with#ran","syntology_url":"https://syntology.ai/paper/1805.11090","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.11090"}},"official":{"repos":["nesl/adversarial_genattack"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/2505-11427","slug":"2505-11427","title":"Mergenetic: a Simple Evolutionary Model Merging Library","date":"2025-05-16","arxiv_id":"2505.11427","repositories_listed":2,"syntology":null},{"url":"/paper/improving-genetic-programming-for-symbolic","slug":"improving-genetic-programming-for-symbolic","title":"Improving Genetic Programming for Symbolic Regression with Equality Graphs","date":"2025-01-29","arxiv_id":"2501.17848","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-genetic-programming-for-symbolic#ran","syntology_url":"https://syntology.ai/paper/2501.17848","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.17848"}},"official":{"repos":["folivetti/eggp_paper_GECCO","folivetti/srtree"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/evorl-a-gpu-accelerated-framework-for","slug":"evorl-a-gpu-accelerated-framework-for","title":"EvoRL: A GPU-accelerated Framework for Evolutionary Reinforcement Learning","date":"2025-01-25","arxiv_id":"2501.15129","repositories_listed":2,"syntology":null},{"url":"/paper/evos-efficient-implicit-neural-training-via","slug":"evos-efficient-implicit-neural-training-via","title":"EVOS: Efficient Implicit Neural Training via EVOlutionary Selector","date":"2024-12-13","arxiv_id":"2412.10153","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/evos-efficient-implicit-neural-training-via#ran","syntology_url":"https://syntology.ai/paper/2412.10153","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.10153"}},"official":{"repos":["zwx-open/evos-inr"],"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":["listed","official"]}}},{"url":"/paper/single-and-multi-objective-benchmark-problems","slug":"single-and-multi-objective-benchmark-problems","title":"Single and Multi-Objective Optimization Benchmark Problems Focusing on Human-Powered Aircraft Design","date":"2023-12-14","arxiv_id":"2312.08953","repositories_listed":2,"syntology":null},{"url":"/paper/synergizing-quality-diversity-with-descriptor","slug":"synergizing-quality-diversity-with-descriptor","title":"Synergizing Quality-Diversity with Descriptor-Conditioned Reinforcement Learning","date":"2023-12-10","arxiv_id":"2401.08632","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/synergizing-quality-diversity-with-descriptor#ran","syntology_url":"https://syntology.ai/paper/2401.08632","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.08632"}},"official":{"repos":["adaptive-intelligent-robotics/DCRL-MAP-Elites"],"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":["listed","official"]}}},{"url":"/paper/connecting-large-language-models-with","slug":"connecting-large-language-models-with","title":"EvoPrompt: Connecting LLMs with Evolutionary Algorithms Yields Powerful Prompt Optimizers","date":"2023-09-15","arxiv_id":"2309.08532","repositories_listed":2,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":3,"n_instrument":8,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 8 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/connecting-large-language-models-with#ran","syntology_url":"https://syntology.ai/paper/2309.08532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.08532"}},"official":null}},{"url":"/paper/p-rocket-pruning-random-convolution-kernels","slug":"p-rocket-pruning-random-convolution-kernels","title":"POCKET: Pruning Random Convolution Kernels for Time Series Classification from a Feature Selection Perspective","date":"2023-09-15","arxiv_id":"2309.08499","repositories_listed":2,"syntology":null},{"url":"/paper/fedpop-federated-population-based","slug":"fedpop-federated-population-based","title":"FedPop: Federated Population-based Hyperparameter Tuning","date":"2023-08-16","arxiv_id":"2308.08634","repositories_listed":2,"syntology":null},{"url":"/paper/cognitive-evolutionary-search-to-select","slug":"cognitive-evolutionary-search-to-select","title":"Cognitive Evolutionary Search to Select Feature Interactions for Click-Through Rate Prediction","date":"2023-08-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/a-suite-of-diagnostic-metrics-for","slug":"a-suite-of-diagnostic-metrics-for","title":"A suite of diagnostic metrics for characterizing selection schemes","date":"2022-04-29","arxiv_id":"2204.13839","repositories_listed":2,"syntology":null},{"url":"/paper/rank-based-non-dominated-sorting","slug":"rank-based-non-dominated-sorting","title":"Rank-based Non-dominated Sorting","date":"2022-03-25","arxiv_id":"2203.13654","repositories_listed":2,"syntology":null},{"url":"/paper/hawks-evolving-challenging-benchmark-sets-for","slug":"hawks-evolving-challenging-benchmark-sets-for","title":"HAWKS: Evolving Challenging Benchmark Sets for Cluster Analysis","date":"2021-02-13","arxiv_id":"2102.06940","repositories_listed":2,"syntology":null},{"url":"/paper/es-enas-combining-evolution-strategies-with","slug":"es-enas-combining-evolution-strategies-with","title":"ES-ENAS: Efficient Evolutionary Optimization for Large Hybrid Search Spaces","date":"2021-01-19","arxiv_id":"2101.07415","repositories_listed":2,"syntology":null},{"url":"/paper/epidemioptim-a-toolbox-for-the-optimization-1","slug":"epidemioptim-a-toolbox-for-the-optimization-1","title":"EpidemiOptim: A Toolbox for the Optimization of Control Policies in Epidemiological Models","date":"2020-10-09","arxiv_id":"2010.04452","repositories_listed":2,"syntology":null},{"url":"/paper/local-search-is-a-remarkably-strong-baseline","slug":"local-search-is-a-remarkably-strong-baseline","title":"Local Search is a Remarkably Strong Baseline for Neural Architecture Search","date":"2020-04-20","arxiv_id":"2004.08996","repositories_listed":2,"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":0,"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/local-search-is-a-remarkably-strong-baseline#ran","syntology_url":"https://syntology.ai/paper/2004.08996","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.08996"}},"official":{"repos":["ArkadiyD/MacroNASBenchmark","tdenottelander/MacroNAS"],"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/uncrowded-hypervolume-based-multi-objective","slug":"uncrowded-hypervolume-based-multi-objective","title":"Uncrowded Hypervolume-based Multi-objective Optimization with Gene-pool Optimal Mixing","date":"2020-04-10","arxiv_id":"2004.05068","repositories_listed":2,"syntology":null},{"url":"/paper/boosting-binary-optimization-via-binary","slug":"boosting-binary-optimization-via-binary","title":"Boosting Binary Optimization via Binary Classification: A Case Study of Job Shop Scheduling","date":"2018-08-31","arxiv_id":"1808.10813","repositories_listed":2,"syntology":null},{"url":"/paper/the-moeadr-package-a-component-based","slug":"the-moeadr-package-a-component-based","title":"The MOEADr Package - A Component-Based Framework for Multiobjective Evolutionary Algorithms Based on Decomposition","date":"2018-07-18","arxiv_id":"1807.06731","repositories_listed":2,"syntology":null},{"url":"/paper/large-scale-evolution-of-image-classifiers","slug":"large-scale-evolution-of-image-classifiers","title":"Large-Scale Evolution of Image Classifiers","date":"2017-03-03","arxiv_id":"1703.01041","repositories_listed":2,"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/large-scale-evolution-of-image-classifiers#ran","syntology_url":"https://syntology.ai/paper/1703.01041","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.01041"}},"official":null}},{"url":"/paper/deep-neural-networks-are-easily-fooled-high","slug":"deep-neural-networks-are-easily-fooled-high","title":"Deep Neural Networks are Easily Fooled: High Confidence Predictions for Unrecognizable Images","date":"2014-12-05","arxiv_id":"1412.1897","repositories_listed":2,"syntology":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/benchmarking-moeas-for-solving-continuous","slug":"benchmarking-moeas-for-solving-continuous","title":"Benchmarking MOEAs for solving continuous multi-objective RL problems","date":"2025-05-19","arxiv_id":"2505.13726","repositories_listed":1,"syntology":null},{"url":"/paper/randomised-optimism-via-competitive-co","slug":"randomised-optimism-via-competitive-co","title":"Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback","date":"2025-05-19","arxiv_id":"2505.13562","repositories_listed":1,"syntology":null},{"url":"/paper/rainbowplus-enhancing-adversarial-prompt","slug":"rainbowplus-enhancing-adversarial-prompt","title":"RainbowPlus: Enhancing Adversarial Prompt Generation via Evolutionary Quality-Diversity Search","date":"2025-04-21","arxiv_id":"2504.15047","repositories_listed":1,"syntology":null},{"url":"/paper/controller-distillation-reduces-fragile-brain","slug":"controller-distillation-reduces-fragile-brain","title":"Controller Distillation Reduces Fragile Brain-Body Co-Adaptation and Enables Migrations in MAP-Elites","date":"2025-04-09","arxiv_id":"2504.06523","repositories_listed":1,"syntology":null},{"url":"/paper/gpu-accelerated-evolutionary-many-objective","slug":"gpu-accelerated-evolutionary-many-objective","title":"GPU-accelerated Evolutionary Many-objective Optimization Using Tensorized NSGA-III","date":"2025-04-08","arxiv_id":"2504.06067","repositories_listed":1,"syntology":null},{"url":"/paper/overcoming-deceptiveness-in-fitness","slug":"overcoming-deceptiveness-in-fitness","title":"Overcoming Deceptiveness in Fitness Optimization with Unsupervised Quality-Diversity","date":"2025-04-02","arxiv_id":"2504.01915","repositories_listed":1,"syntology":null},{"url":"/paper/island-based-evolutionary-computation-with","slug":"island-based-evolutionary-computation-with","title":"Island-Based Evolutionary Computation with Diverse Surrogates and Adaptive Knowledge Transfer for High-Dimensional Data-Driven Optimization","date":"2025-03-17","arxiv_id":"2503.12856","repositories_listed":1,"syntology":null},{"url":"/paper/pair-a-novel-large-language-model-guided","slug":"pair-a-novel-large-language-model-guided","title":"PAIR: A Novel Large Language Model-Guided Selection Strategy for Evolutionary Algorithms","date":"2025-03-05","arxiv_id":"2503.03239","repositories_listed":1,"syntology":null},{"url":"/paper/evolving-form-and-function-dual-objective","slug":"evolving-form-and-function-dual-objective","title":"Evolving Form and Function: Dual-Objective Optimization in Neural Symbolic Regression Networks","date":"2025-02-24","arxiv_id":"2502.17393","repositories_listed":1,"syntology":null},{"url":"/paper/reward-guided-iterative-refinement-in","slug":"reward-guided-iterative-refinement-in","title":"Reward-Guided Iterative Refinement in Diffusion Models at Test-Time with Applications to Protein and DNA Design","date":"2025-02-20","arxiv_id":"2502.14944","repositories_listed":1,"syntology":null},{"url":"/paper/dominated-novelty-search-rethinking-local","slug":"dominated-novelty-search-rethinking-local","title":"Dominated Novelty Search: Rethinking Local Competition in Quality-Diversity","date":"2025-02-01","arxiv_id":"2502.00593","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"8 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/dominated-novelty-search-rethinking-local#ran","syntology_url":"https://syntology.ai/paper/2502.00593","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.00593"}},"official":{"repos":["adaptive-intelligent-robotics/dominated-novelty-search"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/what-if-eye-computationally-recreating-vision","slug":"what-if-eye-computationally-recreating-vision","title":"What if Eye...? Computationally Recreating Vision Evolution","date":"2025-01-25","arxiv_id":"2501.15001","repositories_listed":1,"syntology":null},{"url":"/paper/evaluation-and-efficiency-comparison-of","slug":"evaluation-and-efficiency-comparison-of","title":"Evaluation and Efficiency Comparison of Evolutionary Algorithms for Service Placement Optimization in Fog Architectures","date":"2025-01-17","arxiv_id":"2501.09958","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-deep-learning-based-forward-solvers","slug":"efficient-deep-learning-based-forward-solvers","title":"Efficient Deep Learning-based Forward Solvers for Brain Tumor Growth Models","date":"2025-01-14","arxiv_id":"2501.08226","repositories_listed":1,"syntology":null},{"url":"/paper/uber-uncertainty-based-evolution-with-large","slug":"uber-uncertainty-based-evolution-with-large","title":"QUBE: Enhancing Automatic Heuristic Design via Quality-Uncertainty Balanced Evolution","date":"2024-12-30","arxiv_id":"2412.20694","repositories_listed":1,"syntology":null},{"url":"/paper/quantum-time-series-learning-with","slug":"quantum-time-series-learning-with","title":"Quantum Time-Series Learning with Evolutionary Algorithms","date":"2024-12-23","arxiv_id":"2412.17580","repositories_listed":1,"syntology":null},{"url":"/paper/two-layer-walk-a-community-aware-graph","slug":"two-layer-walk-a-community-aware-graph","title":"Two Layer Walk: A Community-Aware Graph Embedding","date":"2024-12-17","arxiv_id":"2412.12933","repositories_listed":1,"syntology":null},{"url":"/paper/runtime-analysis-for-multi-objective","slug":"runtime-analysis-for-multi-objective","title":"Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces","date":"2024-12-16","arxiv_id":"2412.11684","repositories_listed":1,"syntology":null},{"url":"/paper/configx-modular-configuration-for","slug":"configx-modular-configuration-for","title":"ConfigX: Modular Configuration for Evolutionary Algorithms via Multitask Reinforcement Learning","date":"2024-12-10","arxiv_id":"2412.07507","repositories_listed":1,"syntology":null},{"url":"/paper/learnable-evolutionary-multi-objective","slug":"learnable-evolutionary-multi-objective","title":"Learnable Evolutionary Multi-Objective Combinatorial Optimization via Sequence-to-Sequence Model","date":"2024-12-09","arxiv_id":"2412.06140","repositories_listed":1,"syntology":null},{"url":"/paper/optimizing-hearthstone-agents-using-an","slug":"optimizing-hearthstone-agents-using-an","title":"Optimizing Hearthstone Agents using an Evolutionary Algorithm","date":"2024-10-25","arxiv_id":"2410.19681","repositories_listed":1,"syntology":null},{"url":"/paper/synthesizing-interpretable-control-policies","slug":"synthesizing-interpretable-control-policies","title":"Synthesizing Interpretable Control Policies through Large Language Model Guided Search","date":"2024-10-07","arxiv_id":"2410.05406","repositories_listed":1,"syntology":null},{"url":"/paper/diffusion-models-are-evolutionary-algorithms","slug":"diffusion-models-are-evolutionary-algorithms","title":"Diffusion Models are Evolutionary Algorithms","date":"2024-10-03","arxiv_id":"2410.02543","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":4,"n_ran_checked":7,"n_instrument":3,"n_unverified":1,"n_honours":2,"n_violates":1,"n_no_contract":4,"n_pointer_only":11,"phrase":"10 ran (of which 4 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 1 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/diffusion-models-are-evolutionary-algorithms#ran","syntology_url":"https://syntology.ai/paper/2410.02543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.02543"}},"official":{"repos":["Zhangyanbo/diffusion-evolution"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":4,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/symbolic-regression-with-a-learned-concept","slug":"symbolic-regression-with-a-learned-concept","title":"Symbolic Regression with a Learned Concept Library","date":"2024-09-14","arxiv_id":"2409.09359","repositories_listed":1,"syntology":null},{"url":"/paper/libmoon-a-gradient-based-multiobjective","slug":"libmoon-a-gradient-based-multiobjective","title":"LibMOON: A Gradient-based MultiObjective OptimizatioN Library in PyTorch","date":"2024-09-04","arxiv_id":"2409.02969","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/libmoon-a-gradient-based-multiobjective#ran","syntology_url":"https://syntology.ai/paper/2409.02969","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.02969"}},"official":{"repos":["xzhang2523/libmoon"],"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/syntax-guided-procedural-synthesis-of","slug":"syntax-guided-procedural-synthesis-of","title":"Procedural Synthesis of Synthesizable Molecules","date":"2024-08-24","arxiv_id":"2409.05873","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":1,"n_ran_checked":4,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":2,"n_no_contract":2,"n_pointer_only":0,"phrase":"6 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 2 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/syntax-guided-procedural-synthesis-of#ran","syntology_url":"https://syntology.ai/paper/2409.05873","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.05873"}},"official":{"repos":["shiningsunnyday/synthesisnet"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":1,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/evaluation-framework-for-ai-driven-molecular","slug":"evaluation-framework-for-ai-driven-molecular","title":"Evaluation Framework for AI-driven Molecular Design of Multi-target Drugs: Brain Diseases as a Case Study","date":"2024-08-20","arxiv_id":"2408.10482","repositories_listed":1,"syntology":null},{"url":"/paper/surrogate-assisted-search-with-competitive","slug":"surrogate-assisted-search-with-competitive","title":"Surrogate-Assisted Search with Competitive Knowledge Transfer for Expensive Optimization","date":"2024-08-13","arxiv_id":"2408.07176","repositories_listed":1,"syntology":null},{"url":"/paper/paretotracker-understanding-population","slug":"paretotracker-understanding-population","title":"ParetoTracker: Understanding Population Dynamics in Multi-objective Evolutionary Algorithms through Visual Analytics","date":"2024-08-08","arxiv_id":"2408.04539","repositories_listed":1,"syntology":null},{"url":"/paper/2408-02451","slug":"2408-02451","title":"An investigation on the use of Large Language Models for hyperparameter tuning in Evolutionary Algorithms","date":"2024-08-05","arxiv_id":"2408.02451","repositories_listed":1,"syntology":null},{"url":"/paper/2408-00448","slug":"2408-00448","title":"How quantum and evolutionary algorithms can help each other: two examples","date":"2024-08-01","arxiv_id":"2408.00448","repositories_listed":1,"syntology":null},{"url":"/paper/grammar-based-game-description-generation","slug":"grammar-based-game-description-generation","title":"Grammar-based Game Description Generation using Large Language Models","date":"2024-07-24","arxiv_id":"2407.17404","repositories_listed":1,"syntology":null},{"url":"/paper/pareto-local-search-for-a-multi-objective","slug":"pareto-local-search-for-a-multi-objective","title":"Pareto local search for a multi-objective demand response problem in residential areas with heat pumps and electric vehicles","date":"2024-07-16","arxiv_id":"2407.11719","repositories_listed":1,"syntology":null},{"url":"/paper/surrogate-assisted-evolutionary-framework","slug":"surrogate-assisted-evolutionary-framework","title":"Surrogate-assisted evolutionary framework with an ensemble of teaching-learning and differential evolution for expensive optimization","date":"2024-06-28","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/efficient-evolutionary-search-over-chemical","slug":"efficient-evolutionary-search-over-chemical","title":"Efficient Evolutionary Search Over Chemical Space with Large Language Models","date":"2024-06-23","arxiv_id":"2406.16976","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/efficient-evolutionary-search-over-chemical#ran","syntology_url":"https://syntology.ai/paper/2406.16976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.16976"}},"official":{"repos":["zoom-wang112358/molleo"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/evoagent-towards-automatic-multi-agent","slug":"evoagent-towards-automatic-multi-agent","title":"EvoAgent: Towards Automatic Multi-Agent Generation via Evolutionary Algorithms","date":"2024-06-20","arxiv_id":"2406.14228","repositories_listed":1,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":6,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":12,"phrase":"6 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; 4 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/evoagent-towards-automatic-multi-agent#ran","syntology_url":"https://syntology.ai/paper/2406.14228","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14228"}},"official":{"repos":["siyuyuan/evoagent"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-fusion-by-evolving-weights-of","slug":"knowledge-fusion-by-evolving-weights-of","title":"Knowledge Fusion By Evolving Weights of Language Models","date":"2024-06-18","arxiv_id":"2406.12208","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":2,"n_instrument":7,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"9 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; 7 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/knowledge-fusion-by-evolving-weights-of#ran","syntology_url":"https://syntology.ai/paper/2406.12208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12208"}},"official":{"repos":["duguodong7/model-evolution"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/large-language-models-as-surrogate-models-in","slug":"large-language-models-as-surrogate-models-in","title":"Large Language Models as Surrogate Models in Evolutionary Algorithms: A Preliminary Study","date":"2024-06-15","arxiv_id":"2406.10675","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-an-evolvable-developmental","slug":"meta-learning-an-evolvable-developmental","title":"Meta-Learning an Evolvable Developmental Encoding","date":"2024-06-13","arxiv_id":"2406.09020","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-solve-multiresolution-matrix","slug":"learning-to-solve-multiresolution-matrix","title":"Learning to Solve Multiresolution Matrix Factorization by Manifold Optimization and Evolutionary Metaheuristics","date":"2024-06-01","arxiv_id":"2406.00469","repositories_listed":1,"syntology":null},{"url":"/paper/evolutionary-algorithms-for-optimizing","slug":"evolutionary-algorithms-for-optimizing","title":"Evolutionary Algorithms for Optimizing Emergency Exit Placement in Indoor Environments","date":"2024-05-28","arxiv_id":"2405.18352","repositories_listed":1,"syntology":null},{"url":"/paper/a-first-look-at-kolmogorov-arnold-networks-in","slug":"a-first-look-at-kolmogorov-arnold-networks-in","title":"A First Look at Kolmogorov-Arnold Networks in Surrogate-assisted Evolutionary Algorithms","date":"2024-05-26","arxiv_id":"2405.16494","repositories_listed":1,"syntology":null},{"url":"/paper/evolutionary-large-language-model-for","slug":"evolutionary-large-language-model-for","title":"Evolutionary Large Language Model for Automated Feature Transformation","date":"2024-05-25","arxiv_id":"2405.16203","repositories_listed":1,"syntology":null},{"url":"/paper/influence-maximization-in-hypergraphs-using","slug":"influence-maximization-in-hypergraphs-using","title":"Influence Maximization in Hypergraphs using Multi-Objective Evolutionary Algorithms","date":"2024-05-16","arxiv_id":"2405.10187","repositories_listed":1,"syntology":null},{"url":"/paper/a-newton-method-for-hausdorff-approximations","slug":"a-newton-method-for-hausdorff-approximations","title":"A Newton Method for Hausdorff Approximations of the Pareto Front within Multi-objective Evolutionary Algorithms","date":"2024-05-09","arxiv_id":"2405.05721","repositories_listed":1,"syntology":null},{"url":"/paper/glhf-general-learned-evolutionary-algorithm","slug":"glhf-general-learned-evolutionary-algorithm","title":"Pretrained Optimization Model for Zero-Shot Black Box Optimization","date":"2024-05-06","arxiv_id":"2405.03728","repositories_listed":1,"syntology":{"n":14,"n_ran":7,"n_constructed":0,"n_ran_checked":2,"n_instrument":5,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":14,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 5 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/glhf-general-learned-evolutionary-algorithm#ran","syntology_url":"https://syntology.ai/paper/2405.03728","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.03728"}},"official":{"repos":["ninja-wm/pom"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/geevo-game-economy-generation-and-balancing","slug":"geevo-game-economy-generation-and-balancing","title":"GEEvo: Game Economy Generation and Balancing with Evolutionary Algorithms","date":"2024-04-29","arxiv_id":"2404.18574","repositories_listed":1,"syntology":null},{"url":"/paper/a-multi-objective-optimization-benchmark-test","slug":"a-multi-objective-optimization-benchmark-test","title":"A Multi-objective Optimization Benchmark Test Suite for Real-time Semantic Segmentation","date":"2024-04-25","arxiv_id":"2404.16266","repositories_listed":1,"syntology":null},{"url":"/paper/lvns-rave-diversified-audio-generation-with","slug":"lvns-rave-diversified-audio-generation-with","title":"LVNS-RAVE: Diversified audio generation with RAVE and Latent Vector Novelty Search","date":"2024-04-22","arxiv_id":"2404.14063","repositories_listed":1,"syntology":null},{"url":"/paper/self-adjusting-evolutionary-algorithms-are","slug":"self-adjusting-evolutionary-algorithms-are","title":"Self-Adjusting Evolutionary Algorithms Are Slow on Multimodal Landscapes","date":"2024-04-18","arxiv_id":"2404.12047","repositories_listed":1,"syntology":null},{"url":"/paper/evolutionary-preference-sampling-for-pareto","slug":"evolutionary-preference-sampling-for-pareto","title":"Evolutionary Preference Sampling for Pareto Set Learning","date":"2024-04-12","arxiv_id":"2404.08414","repositories_listed":1,"syntology":null},{"url":"/paper/minimum-variance-threshold-for-epsilon","slug":"minimum-variance-threshold-for-epsilon","title":"Minimum variance threshold for epsilon-lexicase selection","date":"2024-04-08","arxiv_id":"2404.05909","repositories_listed":1,"syntology":null},{"url":"/paper/evolving-benchmark-functions-to-compare","slug":"evolving-benchmark-functions-to-compare","title":"Evolving Benchmark Functions to Compare Evolutionary Algorithms via Genetic Programming","date":"2024-03-21","arxiv_id":"2403.14146","repositories_listed":1,"syntology":null},{"url":"/paper/evolutionary-optimization-of-model-merging","slug":"evolutionary-optimization-of-model-merging","title":"Evolutionary Optimization of Model Merging Recipes","date":"2024-03-19","arxiv_id":"2403.13187","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":5,"n_instrument":5,"n_unverified":2,"n_honours":2,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 1 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/evolutionary-optimization-of-model-merging#ran","syntology_url":"https://syntology.ai/paper/2403.13187","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.13187"}},"official":{"repos":["sakanaai/evolutionary-model-merge"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/llm-guided-evolution-the-automation-of-models","slug":"llm-guided-evolution-the-automation-of-models","title":"LLM Guided Evolution - The Automation of Models Advancing Models","date":"2024-03-18","arxiv_id":"2403.11446","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/llm-guided-evolution-the-automation-of-models#ran","syntology_url":"https://syntology.ai/paper/2403.11446","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.11446"}},"official":{"repos":["clint-kristopher-morris/llm-guided-evolution"],"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/can-tree-based-approaches-surpass-deep","slug":"can-tree-based-approaches-surpass-deep","title":"Can Tree Based Approaches Surpass Deep Learning in Anomaly Detection? A Benchmarking Study","date":"2024-02-11","arxiv_id":"2402.07281","repositories_listed":1,"syntology":null},{"url":"/paper/sais-a-novel-bio-inspired-artificial-immune","slug":"sais-a-novel-bio-inspired-artificial-immune","title":"SAIS: A Novel Bio-Inspired Artificial Immune System Based on Symbiotic Paradigm","date":"2024-02-11","arxiv_id":"2402.07244","repositories_listed":1,"syntology":null},{"url":"/paper/evoseed-unveiling-the-threat-on-deep-neural","slug":"evoseed-unveiling-the-threat-on-deep-neural","title":"Breaking Free: How to Hack Safety Guardrails in Black-Box Diffusion Models!","date":"2024-02-07","arxiv_id":"2402.04699","repositories_listed":1,"syntology":null},{"url":"/paper/explainable-benchmarking-for-iterative","slug":"explainable-benchmarking-for-iterative","title":"Explainable Benchmarking for Iterative Optimization Heuristics","date":"2024-01-31","arxiv_id":"2401.17842","repositories_listed":1,"syntology":null},{"url":"/paper/scape-searching-conceptual-architecture","slug":"scape-searching-conceptual-architecture","title":"SCAPE: Searching Conceptual Architecture Prompts using Evolution","date":"2024-01-31","arxiv_id":"2402.00089","repositories_listed":1,"syntology":null},{"url":"/paper/bridging-evolutionary-algorithms-and","slug":"bridging-evolutionary-algorithms-and","title":"Bridging Evolutionary Algorithms and Reinforcement Learning: A Comprehensive Survey on Hybrid Algorithms","date":"2024-01-22","arxiv_id":"2401.11963","repositories_listed":1,"syntology":null},{"url":"/paper/evolutionary-computation-in-the-era-of-large","slug":"evolutionary-computation-in-the-era-of-large","title":"Evolutionary Computation in the Era of Large Language Model: Survey and Roadmap","date":"2024-01-18","arxiv_id":"2401.10034","repositories_listed":1,"syntology":null},{"url":"/paper/a-tool-for-the-procedural-generation-of","slug":"a-tool-for-the-procedural-generation-of","title":"A Tool for the Procedural Generation of Shaders using Interactive Evolutionary Algorithms","date":"2023-12-29","arxiv_id":"2312.17587","repositories_listed":1,"syntology":null},{"url":"/paper/mtop-a-matlab-optimization-platform-for","slug":"mtop-a-matlab-optimization-platform-for","title":"MToP: A MATLAB Optimization Platform for Evolutionary Multitasking","date":"2023-12-13","arxiv_id":"2312.08134","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-and-analysis-of-evolutionary","slug":"a-survey-and-analysis-of-evolutionary","title":"A Survey and Analysis of Evolutionary Operators for Permutations","date":"2023-11-24","arxiv_id":"2311.14595","repositories_listed":1,"syntology":null},{"url":"/paper/hardest-monotone-functions-for-evolutionary","slug":"hardest-monotone-functions-for-evolutionary","title":"Hardest Monotone Functions for Evolutionary Algorithms","date":"2023-11-13","arxiv_id":"2311.07438","repositories_listed":1,"syntology":null},{"url":"/paper/ever-evolving-evaluator-ev3-towards-flexible","slug":"ever-evolving-evaluator-ev3-towards-flexible","title":"Ever Evolving Evaluator (EV3): Towards Flexible and Reliable Meta-Optimization for Knowledge Distillation","date":"2023-10-29","arxiv_id":"2310.18893","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/ever-evolving-evaluator-ev3-towards-flexible#ran","syntology_url":"https://syntology.ai/paper/2310.18893","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18893"}},"official":{"repos":["google-research/google-research"],"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/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"]}}}],"syntology_records":25,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":36,"papers_where_code_ran_first_page":"/task/evolutionary-algorithms/papers/ran/1","papers_where_code_ran_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.","pages":[{"order":"archive","page":2,"of":12,"url":"/task/evolutionary-algorithms/papers/2","json":"/task/evolutionary-algorithms/papers/2.json","rows":100},{"order":"archive","page":3,"of":12,"url":"/task/evolutionary-algorithms/papers/3","json":"/task/evolutionary-algorithms/papers/3.json","rows":100},{"order":"archive","page":4,"of":12,"url":"/task/evolutionary-algorithms/papers/4","json":"/task/evolutionary-algorithms/papers/4.json","rows":100},{"order":"archive","page":5,"of":12,"url":"/task/evolutionary-algorithms/papers/5","json":"/task/evolutionary-algorithms/papers/5.json","rows":100},{"order":"archive","page":6,"of":12,"url":"/task/evolutionary-algorithms/papers/6","json":"/task/evolutionary-algorithms/papers/6.json","rows":100},{"order":"archive","page":7,"of":12,"url":"/task/evolutionary-algorithms/papers/7","json":"/task/evolutionary-algorithms/papers/7.json","rows":100},{"order":"archive","page":8,"of":12,"url":"/task/evolutionary-algorithms/papers/8","json":"/task/evolutionary-algorithms/papers/8.json","rows":100},{"order":"archive","page":9,"of":12,"url":"/task/evolutionary-algorithms/papers/9","json":"/task/evolutionary-algorithms/papers/9.json","rows":100},{"order":"archive","page":10,"of":12,"url":"/task/evolutionary-algorithms/papers/10","json":"/task/evolutionary-algorithms/papers/10.json","rows":100},{"order":"archive","page":11,"of":12,"url":"/task/evolutionary-algorithms/papers/11","json":"/task/evolutionary-algorithms/papers/11.json","rows":100},{"order":"archive","page":12,"of":12,"url":"/task/evolutionary-algorithms/papers/12","json":"/task/evolutionary-algorithms/papers/12.json","rows":7},{"order":"ran","page":1,"of":1,"url":"/task/evolutionary-algorithms/papers/ran/1","json":"/task/evolutionary-algorithms/papers/ran/1.json","rows":36}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"d5f026f0b0714c579bb8b160cf101e9dd429ce54f44706fc398d8450b3fa8e04","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}