Language Model Crossover: Variation through Few-Shot Prompting
Open accessPublished version of a preprint
Abstract
This article pursues the insight that language models naturally enable an intelligent variation operator similar in spirit to evolutionary crossover. In particular, language models of sufficient scale demonstrate in-context learning, i.e., they can learn from associations between a small number of input patterns to generate outputs incorporating such associations (also called few-shot prompting). This ability can be leveraged to form a simple but powerful variation operator, i.e., to prompt a language model with a few text-based genotypes (such as code, plain-text sentences, or equations), and to parse its corresponding output as those genotypes’ offspring. The promise of such language model crossover (which is simple to implement and can leverage many different open source language models) is that it enables a simple mechanism to evolve semantically rich text representations (with few domain-specific tweaks), and naturally benefits from current progress in language models. Experiments in this article highlight the versatility of language-model crossover, through evolving binary bit-strings, sentences, equations, text-to-image prompts, and Python code. The conclusion is that language model crossover is a flexible and effective method for evolving genomes representable as text.
AI snapshot
Written from the paper’s full text.
TL;DR
The paper introduces language model crossover (LMX), a variation operator that prompts an LLM with a few text-encoded parents and treats its continuation as offspring. Across binary strings, equations, sentences, image prompts, and Python code, LMX can drive evolutionary search without domain-specific operators, though it inherits LLM-related costs and limitations.
Key findings
- In binary OneMax, LMX generated valid novel offspring from as few as three parent strings, and valid/novel rates rose with Pythia model scale. Against one-point crossover, LMX reached optima in 16/20 runs versus 20/20, but had higher mean fitness (Mann-Whitney p=0.002); a heritability test was significant at p<0.001.
- Symbolic regression on the SRBench “banana” problem: GALACTICA-1.3B LMX matched or exceeded gplearn in fitness and expression size and landed on the Pareto front versus published methods; a Pythia-1.4B ablation underperformed. The run used 5000 generations and took roughly 100 hours.
- Sentiment style transfer: LMX and LMX-Near beat the control on QD score for all three quotes (p<1e-5); LMX-Near was significantly better than LMX only for the Gore Vidal quote (p<0.05).
- Image prompts: LMX substantially outperformed one-point crossover, zero-shot generation, and random human prompts; one-point crossover was statistically similar to a no-header LMX ablation. In Sodarace Python code, more parents generally increased diversity and QD score, about 30% of offspring were valid with CodeGen-6B, and larger models trended better.
Methods
- LMX concatenates k selected text genotypes into a prompt, samples LLM output, and parses valid child genotypes; it was used as the variation operator in simple genetic algorithms, MAP-Elites quality-diversity search, and a symbolic-regression loop.
- Five domains were tested: binary strings/OneMax (Pythia 70M–6.9B), symbolic regression (SRBench banana, 5300 samples, GALACTICA-1.3B and Pythia-1.4B, 113 benchmark seeds, population 50, 5000 generations), sentiment modification (three quotes, Pythia-1.4B, MAP-Elites with 30 niches, 2500 evaluations), Stable Diffusion prompts (80k lexica.art prompts, Pythia-2.8B, population 50, 100 generations), and Sodarace Python (CodeGen 350M/2B/6B, 10,000 iterations).
- Main analyses compared fitness, QD score, validity, and diversity against baselines such as one-point crossover, gplearn, zero-shot prompting, random human prompts, and a control; Mann-Whitney tests were used, and LMX token probabilities were compared with EDA distributions as parent count increased.
Limitations
- The paper states that LMX requires GPU access, can produce invalid outputs, depends on how close the domain is to LLM training data, is bounded by the LLM context window, is opaque and hard to debug, may carry hidden biases, and does not solve common EA issues such as premature convergence or diversity maintenance.
- The paper notes that experiments emphasize breadth over depth and do not claim state-of-the-art results; performance depends on LLM training data and model choice, with the Pythia-versus-GALACTICA discrepancy as evidence.
- Evident from the text: most comparisons are proof-of-concept or limited runs, no convergence guarantees are provided, and compute costs can be high (e.g., symbolic regression around 100 hours and Sodarace up to 30 hours at 6B scale).
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
0 of 73 cited sources checked · 0 supported · 0 flagged
- Findingown data
An experiment in Section 4.1 empirically demonstrates that LLMs enable crossover with binary strings.
“an experiment in Section 4.1 demonstrates empirically that LLMs enable this with binary strings.”
Quote in the paperSubstantial claim - Findingown data
In OneMax, LMX leads to fewer solutions converging on the optima than classical recombination, with 16 out of 20 versus 20 out of 20.
“Though fewer solutions converge on the optima using LMX the classical recombination (16/20 vs. 20/20), mean values are higher (Mann-Whitney 𝑝 = 0.002).”
Quote in the paperNot a substantial claim - Findingown data
For length-9 binary strings, LMX improves when larger LLMs are used.
“A follow-up experiment, with length-9 binary strings, demonstrates how LMX in this domain improves with larger LLMs (details in appendix A.1; results shown in Figure 2b).”
Quote in the paperNot a substantial claim - Findingown data
LMX is able to reliably produce novel and valid offspring when given as few as three examples.
“The conclusion is that indeed, LMX can reliably generate novel, valid offspring (from as few as three examples).”
Quote in the paperSubstantial claim - Findingown data
In terms of number of fitness evaluations, LMX converges similarly to gplearn when Galactica is the underlying LLM.
“In terms of number of fitness evaluations, LMX converges in a similar manner to gplearn, when Galactica is the underlying LLM.”
- Also stated in: § E PYTHON SODARACERS EXPERIMENTAL DETAILS · plain
“In terms of number of fitness evaluations, LMX converges in a similar manner to gplearn, when Galactica is the underlying LLM.”
Quote in the paperNot a substantial claim - Also stated in: § E PYTHON SODARACERS EXPERIMENTAL DETAILS · plain
- Findingown data
When Pythia is the LLM, LMX performance is not as strong in an ablation.
“As an ablation, when Pythia is the LLM, performance is not as strong.”
Quote in the paperSubstantial claim - Findingown data
A customized version of gplearn initialized in the same way as LMX does not improve over standard gplearn.
“Figure 6 also shows that the customized version of gplearn initialized in the same way as LMX does not improve over the standard gplearn.”
Quote in the paperSubstantial claim - Findingreasoning
LMX finds parsimonious expressions even though the algorithm has no explicit drive toward parsimony.
“Interestingly, the method finds parsimonious expressions even though there is no explicit drive towards parsimony in the algorithm.”
Quote in the paperNot a substantial claim - Findingown data
The final expressions returned by LMX are of comparable quality to those of gplearn.
“(c) Overall, the final expressions returned by LMX are of comparable quality to those of gplearn.”
- Also stated in: § E PYTHON SODARACERS EXPERIMENTAL DETAILS · plain
“Overall, the final expressions returned by LMX are of comparable quality to those of gplearn.”
Quote in the paperSubstantial claim - Also stated in: § E PYTHON SODARACERS EXPERIMENTAL DETAILS · plain
- Findingown data
LMX tunes constants to a surprising degree.
“Beyond discovering a useful algebraic scaffolding for the problem, LMX tunes constants to a surprising degree, indicating that the method is capable of continuous optimization, even though LLMs operate in a space of discrete tokens; this is an interesting ability that could also be further explored in future work (Section 7).”
Quote in the paperNot a substantial claim - Findingown data
Evolution is generally able to find intuitive trade-offs between sentiment and distance from the original sentence.
“Qualitatively, evolution is generally able to find intuitive trade-offs between sentiment and distance from the original sentence.”
Quote in the paperNot a substantial claim - Findingown data
LMX substantially outperforms the alternatives in evolving Stable Diffusion prompts.
“Figure 10a shows performance aggregated over nine runs (three seeds for each color for each method; normalized to [0, 1] based on the min and max fitness for each each seed; mean and std.err.shown) shows that LMX substantially outperforms the alternatives.”
Quote in the paperSubstantial claim - Findingreasoning
Randomly-selected human prompts eventually outperform the zero-shot baseline because they have greater diversity.
“The zero-shot baseline quickly stagnates, as it is unable to iteratively refine it's initial solutions; even randomly-selected human prompts eventually outperform it, as they have greater diversity; both these baselines far underperform the evolutionary methods.”
Quote in the paperNot a substantial claim - Findingown data
The method sometimes produces incoherent or grammatically flawed sentences.
“Also, sometimes the method produces incoherent or grammaticallyflawed sentences, e.g.”
Quote in the paperNot a substantial claim - Findingown data
LMX-Near and LMX performed significantly differently only for the Gore Vidal quote, with LMX-Near producing higher final QD-scores (Mann-Whitney U-test; p < 0.05).
“Interestingly, LMX-Near and LMX performed significantly differently only for the Gore Vidal quote (LMX-Near produced higher final QD-scores; Mann-Whitney U-test; 𝑝 < 0.05).”
Quote in the paperSubstantial claim - Findingreasoning
The zero-shot baseline quickly stagnates because it cannot iteratively refine its initial solutions.
“The zero-shot baseline quickly stagnates, as it is unable to iteratively refine it's initial solutions; even randomly-selected human prompts eventually outperform it, as they have greater diversity; both these baselines far underperform the evolutionary methods.”
Quote in the paperSubstantial claim - Findingown data
All three highest-fitness LMX images clearly optimized for the target color.
“All three images have clearly optimized for the target color.”
Quote in the paperNot a substantial claim - Findingown data
Both LMX-Near and LMX achieved higher QD scores than the control for all three quotes (Mann-Whitney U-test; p < 1e-5).
“Quantitatively, both LMX-Near and LMX achieved higher QD scores (sum of the fitnesses of all niches in the map) than the control for all three quotes (Mann-Whiteny U-test; 𝑝 < 1𝑒 -5), and were always able to discover”
Quote in the paperSubstantial claim - Findingown data
LMX-Near and LMX were always able to discover high-sentiment sentences.
“and were always able to discover high-sentiment sentences.”
Quote in the paperNot a substantial claim - Findingown data
A significant proportion of generated offspring are valid Sodaracers, roughly 30% with the 6B model.
“Furthermore, a significant proportion of generated offspring are valid Sodaracers (roughly 30% with the 6B model), highlighting the potential for evolution.”
Quote in the paperSubstantial claim - Findingown data
As the number of parents in the prompt increases, the diversity of offspring generally increases, as measured by number of niches filled and QD score.
“The results from these experiments are shown in Figure 11, showing that as the number of parents in the prompt increases, the diversity of offspring generally increases, as measured by the number of niches filled and the QD score”
Quote in the paperSubstantial claim - Findingnone given
With a larger number of parents, both LMX and EDA approaches converge toward the same distribution.
“Despite this confounding factor, it is clear that with a larger number of parents both approaches converge toward the same distribution -and this connection to EDAs may help to explain why LMX is effective as an off-the-shelf genetic operator across a wide range of domains.”
Quote in the paperSubstantial claim - Findingown data
In experiments where the LLM prompt did not end with the function signature, a single parent yields no valid offspring.
“(This effect is even more dramatic in the experiments where the LLM prompt did not end with the function signature-A single parent yields no valid offspring (see Appendix Figure 17)).”
Quote in the paperSubstantial claim - Findingown data
The disparity between LMX and EDA probability distributions diminishes as the number of parents increases, i.e., LMX becomes more similar to the EDA.
“When we examine the difference between the EDA and LMX distributions with an increasing number of parents (Figure 12), we find that indeed the disparity between the two distributions diminishes as the number of parents increases, i.e., LMX becomes more similar to the EDA.”
Quote in the paperSubstantial claim - Findingnone given
Ordering based on the number of leading ones yields a different bias consistent with the ordering.
“Ordering based on the number of leading ones yields a different bias consistent with the ordering (right).”
Quote in the paperNot a substantial claim - Findingreasoning
LMX in its current form is limited by the LLM context window, so it cannot generate solutions larger than the context window.
“LMX in its current form is also limited by the size of the LLM context window, which, for the LLMs used in this paper, is on the order of thousands, meaning it will not be able to generate solutions larger than this.”
Quote in the paperNot a substantial claim - Findingown data
As the number of parent genotypes input into the LLM increases, the percent of valid offspring approaches 100%.
“As the number of parent genotypes input into the LLM is increased, the percent of valid offspring approaches 100%.”
Quote in the paperSubstantial claim - Findingown data
Results in Section 5.3 indicate that different ways of feeding parents into the LLM can substantially impact the generative process.
“The results in Section 5.3 indicate that different ways of feeding the parents into the LLM can have a substantial impact on the generative process, giving yet another knob to control the nuance of variation.”
Quote in the paperSubstantial claim - Findingnone given
In all cases shown, children exhibit meaningful variations of parents.
“In all cases, children exhibit meaningful variations of parents.”
Quote in the paperNot a substantial claim - Findingown data
The offspring distribution patterns mirror the parental sorting order, underscoring the influence of parent order on the LMX operator's output.
“The offspring distribution patterns mirror the parental sorting order, underscoring the influence of parent order on the LMX operator's output.”
Quote in the paperSubstantial claim - Findingown data
The average difference in gene probabilities predicted by LMX and EDA approaches 0 across various parent set sizes in a population of bit strings.
“The average difference in gene probabilities predicted by LMX and EDA approaches 0 across various parent set sizes in a population of bit strings.”
Quote in the paperNot a substantial claim - Findingown data
LMX substantially outperforms the alternatives in image generation performance aggregated over nine runs.
“Performance aggregated (mean and std.err.) over nine runs (three seeds for each color for each method; normalized to [0, 1] based on the min and max fitness for each each seed) shows that LMX substantially outperforms the alternatives.”
Quote in the paperSubstantial claim - Findingown data
The discrepancy between LMX and EDA probability predictions decreases with the number of parents.
“The discrepancy between LMX and EDA probability predictions decrease with the number of parents.”
Quote in the paperNot a substantial claim - Findingown data
LMX is able to successfully evolve modifications to quotes that achieve high negativity.
“As in the experiments in the paper, LMX is able to successfully evolve modifications to quotes that achieve high negativity.”
Quote in the paperNot a substantial claim - Findingown data
In the Homer Simpson quote sentiment task, the control struggles to fill many niches, especially those nearest to the start sentence.
“The control struggles to fill many niches, especially those nearest to the start sentence.”
Quote in the paperNot a substantial claim - Findingown data
For LMX with two or three parents, removing the appended function signature reduced the validation rate by 15% compared with the main prompt.
“For single-seed prompt mutation, all generations failed to validate, while for LMX with two or three parents the validation rate fell by 15% compared with the main prompt.”
Quote in the paperNot a substantial claim - Findingown data
For single-seed prompt mutation, all generations failed to validate when the appended function signature was removed.
“For single-seed prompt mutation, all generations failed to validate, while for LMX with two or three parents the validation rate fell by 15% compared with the main prompt.”
Quote in the paperNot a substantial claim - Findingown data
Removing the appended 'def make_walker():' signature from the end of the prompt produced slightly worse results, particularly in terms of validation rate.
“We also experimented with removing this signature from the end, which produces slightly worse results, particularly in terms of the validation rate.”
Quote in the paperNot a substantial claim - Findingown data
LMX often achieves high negativity by evoking vulgar language or dark situations.
“However, it often does so by evoking vulgar language or dark situations (e.g. the death of loved ones, or depressive thoughts about hate).”
Quote in the paperNot a substantial claim - Findingcitation
In the few-shot prompting experiments, the percentage of generations that produced valid Sodaracers varied substantially depending on how parent functions were ordered in the prompt, sometimes by more than 50%.
“As observed in prior work with few-shot prompting of language models [71], we noticed that success rates (the percentage of generations which resulted in valid Sodaracers) varied dramatically with the order of parent functions in the prompt, sometimes by over 50%.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [71]
Not checked in the free run.
- Interpretationreasoning
The in-context learning or pattern-completion ability of LLMs can be leveraged to create an intelligent evolutionary crossover or recombination operator.
“The central insight of this paper is is that the pattern-completion ability of few-shot prompting can be leveraged to create a form of intelligent evolutionary crossover.”
- Also stated in: § 2.1 Foundation Models · plain
“This paper highlights how the in-context learning capabilities of autoregressive LLMs (such as the popular GPT architecture) naturally enable a recombination operator.”
Quote in the paperSubstantial claim - Also stated in: § 2.1 Foundation Models · plain
- Premisecitation
Language models of sufficient scale exhibit in-context learning, learning from associations among a few input patterns to produce outputs that incorporate those associations.
“language models of sufficient scale demonstrate in-context learning, i.e. they can learn from associations between a small number of input patterns to generate outputs incorporating such associations (also called few-shot prompting).”
Quote in the paperSubstantial claim0 of 2 sources checked- cites [13] source
Not checked in the free run.
- cites [119]
Not checked in the free run.
- Interpretationreasoning
The in-context learning ability of language models can be used to build a simple but powerful variation operator that prompts the model with a few text-based genotypes and treats its output as their offspring.
“This ability can be leveraged to form a simple but powerful variation operator, i.e. to prompt a language model with a few text-based genotypes (such as code, plain-text sentences, or equations), and to parse its corresponding output as those genotypes' offspring.”
Quote in the paperSubstantial claim - Interpretationreasoning
When used in an optimization loop, LMX acts as a general and effective engine for evolving text representations.
“When integrated into an optimization loop, LMX serves as a general and effective engine of text-representation evolution.”
Quote in the paperSubstantial claim - Interpretationreasoning
LMX can be theoretically connected to estimation of distribution algorithms, where it acts as an implicit probabilistic model of parent genotypes from which a new offspring is sampled in a single forward pass of the LLM.
“Theoretically we also connect this form of LLM crossover (LMX) to estimation of distribution algorithms (EDAs; [3,60]), wherein LMX can be seen as building an implicit probabilistic model of the input parent genotypes from which to sample a new offspring, through a single forward pass of the LLM.”
Quote in the paperNot a substantial claim0 of 2 sources checked- cites [3]
Not checked in the free run.
- cites [60] source
Not checked in the free run.
- Interpretationcitation
LMX can leverage open-source domain-specific LLMs that match the target domain to increase performance, often by changing only a single line of code.
“furthermore, to increase performance the method can easily leverage the rise of open-source domain-specific LLMs that match a target domain (e.g.LLMs that focus on code, when the target domain is to evolve code), often with changing only a single line of code to rely on a different hosted model (e.g. through the HuggingFace model repository [128]).”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [128]
Not checked in the free run.
- Interpretationreasoning
The benefit of LMX is that evolution can easily and effectively use the semantically rich and generic representation of text without designing domain-specific variation operators.
“The benefit of LMX is that evolution can easily and effectively leverage the semantically-rich (and generic) representation of text, e.g.without having to design domain-specific variation operators.”
Quote in the paperSubstantial claim - Interpretationown data
Language model crossover is a flexible and effective method for evolving genomes that can be represented as text.
“The conclusion is that language model crossover is a flexible and effective method for evolving genomes representable as text.”
Quote in the paperSubstantial claim - Premisecitation
Foundation models have enabled an ecosystem of specialized models that can be combined in a plug-and-play manner.
“Foundation models have enabled a vibrant ecosystem of specialized models [120] that can be combined in a plug-and-play way”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [120]
Not checked in the free run.
- Premisecitation
Including input-output examples of a text classification task in a prompt improves an LLM's performance at that task.
“For example, including input-output examples of a text classification task in a prompt will improve an LLM's performance at that task.”
Quote in the paperSubstantial claim0 of 2 sources checked- cites [13] source
Not checked in the free run.
- cites [119]
Not checked in the free run.
- Interpretationreasoning
LMX can generate high-quality offspring across a broad range of domains.
“enables LMX to generate high-quality offspring across a broad range of domains.”
Quote in the paperSubstantial claim - Premisecitation
Traditional mutation and crossover operators do not explicitly model and exploit regularities among high-fitness individuals, which can make evolutionary algorithms relatively sample-inefficient in some situations compared with statistical methods.
“Traditional mutation and crossover operators (such as one-point crossover or bit-flip mutation) do not explicitly seek to model and exploit regularities among high-fitness individuals (or do so in an implicit way [47,76]), which can cause EAs to be relatively sample-inefficient in some situations when compared to statistical methods [116].”
Quote in the paperSubstantial claim0 of 3 sources checked - Premisecitation
LLMs have meta-learned to some extent how to learn a desired task from only a few natural-language examples.
“In this way, to some extent such LLMs have meta-learned how to learn a desired task given only a few natural-language examples [15,119].”
Quote in the paperSubstantial claim0 of 2 sources checked- cites [15]
Not checked in the free run.
- cites [119]
Not checked in the free run.
- Interpretationnone given
Foundation models have an inherent tendency to produce variation because they are probabilistic pattern-completion engines.
“However, even without instructed mutation, Foundation Models contain an innate propensity to generate variation, due to their fundamental capacities as probabilistic pattern completion engines.”
Quote in the paperNot a substantial claim - Interpretationreasoning
When the input context contains a few example genotypes, the ideal next-token anticipation is to continue the pattern by proposing a new genotype from the distribution implied by those examples.
“The reason is that such an objective entails anticipating what comes next from some limited input context, and if that input consists of a few example genotypes, then the ideal anticipation is to continue that pattern, i.e. through suggesting a new genotype from the distribution implied by those examples.”
Quote in the paperSubstantial claim - Interpretationreasoning
As LLMs with lower held-out prediction loss are developed, their ability to serve as engines of evolutionary variation should keep improving.
“From this lens, as higher-performing LLMs (i.e.those with lower prediction loss on a held-out set) are continually developed, their performance as engines of evolutionary variation should continue to improve.”
Quote in the paperSubstantial claim - Premisecitation
Foundation models, especially LLMs, possess nuanced grammatical and domain-specific knowledge that allows search in abstract spaces like narratives and high-level programming languages.
“Foundation Models, particularly LLMs, bring a nuanced understanding of grammar and domain-specific patterns, enabling search across more abstract spaces, such as narratives [11] and high level programming languages [96].”
Quote in the paperSubstantial claim0 of 2 sources checked- cites [11] source
Not checked in the free run.
- cites [96]
Not checked in the free run.
- Interpretationnone given
The LMX operator implicitly constructs a probabilistic model of the parent individuals during the LLM's forward pass via in-context learning.
“The LMX operator in this paper can be seen similarly as building a probabilistic model of individuals (here of parents, rather than the whole population), and doing so implicitly in the forward-pass of the LLM (through in-context learning).”
Quote in the paperNot a substantial claim - Interpretationreasoning
New solutions can be sampled from a distribution defined by top-performing population members by prompting the model with multiple solutions directly, without instructing modification and without retraining.
“The distribution from which new solutions are sampled can still be defined using top performing solutions from the population -but by providing multiple solutions directly to the model as a prompt, without explicit instruction that they be modified, and without retraining.”
Quote in the paperNot a substantial claim - Premisecitation
LLMs trained on large and diverse examples show an increasing capacity for in-context learning.
“Supporting this idea, when trained over a large amount of diverse examples, LLMs demonstrate an increasing capability for in-context learning (i.e.inferring novel associations within the input given at test-time when generating completions) [13,15,124].”
Quote in the paperSubstantial claim0 of 3 sources checked - Interpretationreasoning
LLMs trained by next-token prediction can be regarded as learning to become general pattern-completion engines.
“In other words, LLMs trained by next-token prediction can be seen as learning to become general pattern-completion engines.”
Quote in the paperSubstantial claim - Interpretationreasoning
The next-token prediction objective used to train many self-supervised LLMs naturally supports constructing an evolutionary variation operator for algorithms whose genomes are text.
“The approach in this paper builds from the insight that the objective function used to train many self-supervised LLMs, i.e. next-token prediction [13], naturally lends itself to creating an evolutionary variation operator, from which evolutionary algorithms that represent genomes as text can be derived.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [13] source
Not checked in the free run.
- Interpretationreasoning
The resulting genetic operator is intelligent because it uses in-context learning and the LLM's encoded knowledge to model high-quality solutions rather than searching directly in low-level genotype space.
“The resulting genetic operator is intelligent in the sense that, given a set of parents, it uses in-context learning (powered by the knowledge encoded in the LLM) to build a model of high-quality solutions, instead of directly searching in low-level genotype space.”
Quote in the paperSubstantial claim - Interpretationreasoning
Prompting an LLM with examples from a distribution can condition it to generate further high-probability examples from that distribution.
“Formally, the approach is grounded in a direct generalization of Eq. 3, namely, that providing a prompt of examples from a distribution can condition the LLM to generate further high-probability examples from that distribution.”
Quote in the paperNot a substantial claim - Interpretationreasoning
The variation operator suggested by LMX is relatively domain-independent, in theory generating meaningful variation for any text representation with moderate support in the training set.
“(2) relatively domain-independent (i.e. in theory it should be capable of generating meaningful variation for any text representation that has moderate support in the training set, which often encompasses an enormous crawl of the internet)”
Quote in the paperNot a substantial claim - Interpretationreasoning
The variation operator suggested by LMX should produce increasingly semantically sophisticated variation as LLMs become more capable.
“(3) should suggest increasingly semantically-sophisticated variation with more capable LLMs (i.e. an LLM that is generally better at predicting the next token in text will generate outputs in a manner that implies that it has a deeper semantic understanding of the input text).”
Quote in the paperSubstantial claim - Interpretationown data
The experiments collectively demonstrate that LMX is a generic method for generating variation in evolution.
“Taken together, the experiments demonstrate that LMX is a generic method of generating variation for evolution.”
Quote in the paperSubstantial claim - Interpretationreasoning
The connection to k-shot prompting implies that, at least for a pre-trained LLM, recombination or crossover with more than one parent will outperform mutation with one parent or random sampling with no parents.
“This connection to 𝑘-shot prompting suggests that, at least in the case of a pre-trained LLM, recombination or crossover (i.e., 𝑘 > 1) will be more effective than mutation (𝑘 = 1) or random sampling (𝑘 = 0).”
Quote in the paperNot a substantial claim - Interpretationown data
LMX generates heritable variation.
“The conclusion is that LMX indeed produces heritable variation.”
Quote in the paperSubstantial claim- Rests on an assumption: Evolution depends on meaningful information being passed from parents to offspring.
- Interpretationreasoning
For symbolic regression, LMX sidesteps the difficulties of hand-designed operators by simply providing parent expressions to the language model.
“With LMX, these challenges can be avoided by simply feeding parent expressions into the language model.”
Quote in the paperSubstantial claim- Rests on an assumption: Hand-designed operators struggle with symbolic regression because the space of expressions is non-local and discontinuous.
- Premisecitation
The 'banana' problem exhibits a clear Pareto front among existing methods, which facilitates comparison with LMX.
“The 'banana' problem was chosen because there is a clear Pareto front across existing methods, making it easy to see how LMX compares.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [58]
Not checked in the free run.
- Interpretationown data
The general LMX approach can yield high-quality solutions even in highly specialized domains like SR.
“The conclusion is that the general LMX approach can yield high-quality solutions even in highly specialized domains like SR.”
Quote in the paperSubstantial claim - Interpretationreasoning
If the true expression is known, it may already be present in the LLM's training data, posing a contamination risk.
“When the ground truth expression for symbolic regression is known, we run the risk that the expression is already in the dataset used to train the LLM.”
Quote in the paperSubstantial claim - Interpretationown data
LMX is able to evolve string-based representations without relying on domain-specific operators.
“Overall, these experiments highlight basic properties of LMX, showing how it can evolve string-based representations without domain-specific operators.”
Quote in the paperSubstantial claim - Interpretationown data
In classical GP methods, the kinds of expressions that are easy to evolve may not be the kinds humans are most interested in.
“This result reinforces the idea that in classical GP methods the kinds of expressions that are easy to evolve may not be the kinds humans are most interested in, while LMX thrives in this space since the LLM is naturally familiar with human-designed expressions due to its training data.”
Quote in the paperSubstantial claim - Interpretationreasoning
LMX thrives in the space of expressions humans are interested in.
“This result reinforces the idea that in classical GP methods the kinds of expressions that are easy to evolve may not be the kinds humans are most interested in, while LMX thrives in this space since the LLM is naturally familiar with human-designed expressions due to its training data.”
Quote in the paperSubstantial claim- Rests on an assumption: The LLM is naturally familiar with human-designed expressions because of its training data.
- Interpretationown data
This late improvement demonstrates the LLM's capacity to generate interesting and valuable hypotheses in mathematical and numerical domains.
“This late boost highlights the ability of the LLM to be an engine of interesting and valuable hypotheses in mathematical/numerical spaces.”
Quote in the paperSubstantial claim - Interpretationreasoning
An implicit drive toward parsimony in LMX is enforced by the maximum text size the model processes, which was 500 tokens in this experiment, because longer prompts cannot produce offspring.
“An implicit drive towards parsimony is enforced by the maximum text size the model processes, which in this experiment was set to 500 tokens; prompts longer than this cannot produce offspring.”
Quote in the paperSubstantial claim - Interpretationown data
LMX is capable of driving an evolutionary process.
“Though not as efficient as a domain-specific operator, it is clear that LMX can indeed drive an evolutionary process.”
Quote in the paperSubstantial claim - Interpretationown data
LMX is capable of continuous optimization even though LLMs operate in a discrete token space.
“Beyond discovering a useful algebraic scaffolding for the problem, LMX tunes constants to a surprising degree, indicating that the method is capable of continuous optimization, even though LLMs operate in a space of discrete tokens; this is an interesting ability that could also be further explored in future work (Section 7).”
Quote in the paperNot a substantial claim - Interpretationown data
The results show LMX can optimize symbolic expressions in an intuitive and desirable way with little domain-specific tuning and an unsophisticated optimization loop.
“That said, the results clearly show the ability of LMX, with little domain-specific tuning and an unsophisticated optimization loop, to nonetheless optimize symbolic expressions in an intuitive and desirable way.”
Quote in the paperSubstantial claim - Interpretationown data
LMX can be used to discover solutions for natural language tasks like text style transfer.
“The conclusion is that LMX can be used to discover solutions for natural language tasks like text style transfer; beyond sentiment other styles could be explored by using different NLP models as fitness functions, e.g.emotion-recognition NLP models [81].”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [81]
Not checked in the free run.
- Interpretationown data
LMX can enable sensible evolution of images.
“The conclusion is that LMX can enable sensible evolution of images.”
Quote in the paperSubstantial claim - Interpretationown data
The ability to naturally incorporate natural language problem specifications is a key advantage of LMX over classical EAs.
“One-point crossover is a strong baseline, with performance statistically similar to the 'no header' ablation, supporting the idea that the ability to naturally incorporate natural language problem specifications is a key advantage of LMX over classical EAs.”
Quote in the paperSubstantial claim - Interpretationreasoning
The combination of evolution with the native linguistic capacity of LLMs makes LMX excel.
“So, overall, it is the combination of evolution with the native linguistic capacity of LLMs that makes LMX excel.”
Quote in the paperSubstantial claim - Interpretationown data
These results demonstrate the promise of LMX for evolving non-trivial Python code.
“These results therefore demonstrate the promise of LMX for evolving non-trivial Python code.”
Quote in the paperSubstantial claim - Interpretationcitation
Due to in-context learning capabilities, the LLM can be seen as attempting to infer the underlying distribution of parents in the prompt and generate continuations accordingly.
“Due to its in-context learning capabilities [97,129], the LLM can be seen as attempting to infer underlying distribution of parents in the prompt, and to generate continuations accordingly.”
Quote in the paperSubstantial claim0 of 2 sources checked - Interpretationreasoning
LMX acts like an EDA in that it builds a probabilistic model of parents, from which children are then sampled.
“Whatever the level of explicitness, LMX acts like an EDA in that it builds a probabilistic model of parents, from which children are then sampled.”
Quote in the paperNot a substantial claim - Interpretationnone given
LMX and a selection operator S_n are sufficient operators to define an EDA.
“Theorem 5.1 (eda representation).LMX and 𝑆 𝑛 are sufficient operators to define an EDA.”
Quote in the paperNot a substantial claim - Interpretationcitation
If modification of LLM weights is permitted, weight-based universality follows from the universal approximation ability of neural networks.
“If modification (e.g., fine-tuning) of LLM weights is permitted, this result follows naturally from the universal approximation ability of NNs [26,48,54]”
Quote in the paperSubstantial claim0 of 3 sources checked- cites [26]
Not checked in the free run.
- cites [48] source
Not checked in the free run.
- cites [54]
Not checked in the free run.
- Interpretationreasoning
The power of LMX is not limited to randomly-ordered-parent-concatenation-based crossover; it could be used to produce crossover behavior optimized for specific tasks, e.g., through prompt engineering.
“This property suggests that the power of LMX is not limited to the randomly-ordered-parent-concatenation-based crossover demonstrated in this paper, but could be used to produce (manually or automatically) crossover behavior optimized for specific tasks, e.g., through prompt-engineering.”
Quote in the paperNot a substantial claim - Interpretationreasoning
Theorem 5.3: For any genetic operator g on candidate space X and epsilon > 0, if the LLM is a UTM and psi is surjective, then there exists phi such that for all parent sets X of g and children x, the probability difference between g and LMX is less than epsilon.
“Theorem 5.3 (prompt-based universality).For any genetic operator 𝑔 on candidate space X and 𝜖 > 0, if the LLM is a UTM and 𝜓 is surjective, then ∃ 𝜙 s.t. for all parent sets 𝑋 of 𝑔 and children 𝑥”
Quote in the paperSubstantial claim - Interpretationreasoning
LMX achieves theoretical universal approximation via large neural networks by feeding parents directly into the LLM instead of crossing over weights.
“LMX also achieves theoretical universal approximation via large neural networks, but by feeding parents directly into the LLM, instead of crossing-over weights.”
Quote in the paperSubstantial claim - Premisecitation
Recent theoretical work has shown how crossover of large neural networks can yield universal approximation of reproduction distributions.
“Recent theoretical work has shown how crossover of large neural networks can yield universal approximation of reproduction distributions [76].”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [76] source
Not checked in the free run.
- Premisecitation
With a sufficiently expressive class of model such as Bayesian networks, EDAs can approximate any candidate distribution as the size of the parent set increases.
“With a sufficiently expressive class of model, such as Bayesian networks [86,87], EDAs can approximate any candidate distribution as the size of the parent set increases [134].”
Quote in the paperSubstantial claim0 of 3 sources checked- cites [86] source
Not checked in the free run.
- cites [87]
Not checked in the free run.
- cites [134]
Not checked in the free run.
- Interpretationcitation
LMX can be used to construct expressive encodings, placing it on a common theoretical footing with genetic programming and neuroevolution.
“Finally, LMX can be used to construct expressive encodings, which places it on a common theoretical footing alongside other popular and powerful evolutionary substrates including genetic programming and neuroevolution [76].”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [76] source
Not checked in the free run.
- Interpretationcitation
The existence of such an LLM follows from the universal approximation capability of transformers.
“The existence of such an LLM exists follows from the universal approximation capability of transformers [133].”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [133]
Not checked in the free run.
- Interpretationreasoning
LMX will not be effective in search spaces with millions or billions of variables unless the problem can be broken into appropriately sized subproblems.
“LMX will not be effective in such spaces unless it is possible to break the problem down into appropriately-sized subproblems, possibly relying on a traditonal EA to discover this modularization.”
Quote in the paperNot a substantial claim - Interpretationreasoning
Theorem 5.4: E_LMX((x, LLM, phi, psi)) = E(x) is an expressive encoding.
“Theorem 5.4 (lmx-based expressive encoding).𝐸 LMX ((𝑥, LLM, 𝜙,𝜓 )) = 𝐸 (𝑥) is an expressive encoding.”
Quote in the paperSubstantial claim - Interpretationreasoning
LMX in its current form requires GPU compute, which may make it less accessible to users without such resources.
“The experiments in this paper each made use of GPU compute to perform LMX.Although there is a fast-progressing effort to enable efficient LLM inference on CPU [108,135], there is still a benefit to GPU access, which may make LMX less accessible to users without such resources.”
Quote in the paperNot a substantial claim0 of 2 sources checked- cites [108] source
Not checked in the free run.
- cites [135]
Not checked in the free run.
- Interpretationreasoning
A high proportion of invalid outputs for a domain increases the computational cost of creating the next generation.
“If there is a high proportion of invalid outputs for a certain domain, e.g., due to its complexity or distance from the LLMs training data, then the computational cost of creating the next generation will increase.”
Quote in the paperNot a substantial claim - Interpretationown data
The general LMX approach can yield high-quality solutions even in highly specialized domains like symbolic regression.
“The conclusion is that the general LMX approach can yield high-quality solutions even in highly specialized domains like SR.”
Quote in the paperSubstantial claim - Interpretationreasoning
The discrepancy between Pythia and Galactica in Section 4.2 is evidence for the trade-off between generic and specialized models.
“The discrepancy between Pythia and Galactica in Section 4.2 is evidence for this trade-off, though more would need to be done to see how widespread it is in other domains.”
Quote in the paperSubstantial claim - Interpretationown data
The ability to swap in different LLMs depending on the domain is valuable.
“This result highlights the value of being able to swap in different LLMs depending on the domain.”
Quote in the paperNot a substantial claim - Interpretationown data
In the length-9 binary string domain, LMX becomes more effective with larger LLMs.
“The conclusion is that in this domain LMX becomes more effective with larger LLMs.”
Quote in the paperSubstantial claim - Interpretationown data
LMX effectively generates variation from as few as three input genotypes.
“The conclusion is that LMX effectively generates variation from as few as three input genotypes.”
Quote in the paperSubstantial claim - Interpretationown data
Using a different classification label or a different model that recognizes different properties of text makes it possible to use LMX for style-transfer of many other styles.
“While the results are not always pleasant, these preliminary experiments highlight that by using a different classification label (or potentially a different model that recognizes different properties of text altogether), it is possible to use LMX for style-transfer of possibly many other styles.”
Quote in the paperSubstantial claim
- May combine two claims. 55
- The quote only partly states this claim. 4
- Classified as probably not a substantial claim. 56
May combine two claims.
Findingown dataExperiments in the paper highlight LMX's versatility in binary strings, style transfer of plain-text sentences, symbolic regression of mathematical expressions, generating images through text-to-image prompts, and generating Python code.
“LMX's versatility is highlighted in experiments with binary strings, style transfer of plain-text sentences, symbolic regression of mathematical expressions, generating images through prompts for a text-to-image model, and generating Python code.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataLMX performance improves as LLM capabilities increase, as validated by experiments in the paper.
“this operator should naturally improve as LLMs increase in capabilities (which experiments here validate)”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataOffspring from the all-ones neighborhood had a significantly greater Hamming distance from the all-zeros string than from the all-ones string, and the reverse also held, with p<0.001.
“Indeed, offspring generated from the neighborhood of the all-ones string had significantly higher (Mann-Whitney U-test; 𝑝 < 0.001) hamming distance from the all-zeros string than the all-ones string (and vice-versa; see Figure 3a).”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataIn OneMax, LMX achieves higher mean fitness values than one-point crossover, with a Mann-Whitney p-value of 0.002.
“Though fewer solutions converge on the optima using LMX the classical recombination (16/20 vs. 20/20), mean values are higher (Mann-Whitney 𝑝 = 0.002).”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataLMX using the GALACTICA LLM achieves overall higher fitness and lower expression size than gplearn.
“Figure 6 shows that LMX (using the GALACTICA LLM) achieves overall higher fitness and lower expression size than gplearn, and the choice of LLM appears to have a substantial impact, with the Pythia runs falling short of the others.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataThe choice of LLM has a substantial impact on LMX performance, with Pythia runs falling short of the others.
“Figure 6 shows that LMX (using the GALACTICA LLM) achieves overall higher fitness and lower expression size than gplearn, and the choice of LLM appears to have a substantial impact, with the Pythia runs falling short of the others.”
Quote in the paperSubstantial claimMay combine two claims. The quote only partly states this claim.
Findingown dataIn one LMX run on the banana problem, the process quickly finds a core functional skeleton, then refines constants, and around generation 3000 makes further substantial improvements.
“Even after the process appears to have converged, around generation 3000 it discovers innovations leading to further substantial improvements.”
Quote in the paperSubstantial claimMay combine two claims.
Findingnone givenLMX avoids model bloat as it incrementally improves fitness, satisfying a key desirable property for SR.
“(b) LMX avoids model bloat as it incrementally improves fitness, thereby satisfying a key desirable property for SR.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataLMX produces competitive results and generates fit, parsimonious expressions.
“LMX produces competitive results, generating fit and parsimonous expressions.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataBoth zero-shot and random human prompt baselines far underperform the evolutionary methods.
“The zero-shot baseline quickly stagnates, as it is unable to iteratively refine it's initial solutions; even randomly-selected human prompts eventually outperform it, as they have greater diversity; both these baselines far underperform the evolutionary methods.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataLMX performance on the SR problem is competitive with state-of-the-art methods, settling at an intermediate point along the Pareto front.
“Figure 7 shows that the performance of LMX on this problem is competitive with state-of-the-art methods [58], settling at an intermediate point along the Pareto front.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [58]
Not checked in the free run.
May combine two claims.
Findingown dataOne-point crossover is a strong baseline, with performance statistically similar to the no-header ablation.
“One-point crossover is a strong baseline, with performance statistically similar to the 'no header' ablation, supporting the idea that the ability to naturally incorporate natural language problem specifications is a key advantage of LMX over classical EAs.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Findingnone givenAt sufficient distance from the original sentence, evolution often produces repetitive, unrelated text.
“At sufficient distance from the original sentence, evolution often produces repetitive, unrelated text: e.g.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataBeginning each completion with the make_walker() function signature improves performance; experiments where the prompt did not end with the function signature performed worse.
“Note that we begin each completion with this function signature to improve performance (experiments where the LLM prompt did not end with the function signature performed worse; see appendix E).”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataThere is a clear trend in model size: the 6B model can create higher fitness and more diverse Sodaracers, with a slight trend toward improved proportion of valid programs with model scale.
“There is a clear trend in model size, showing that the 6B model can create higher fitness and more diverse Sodaracers, along with a slight trend towards an improved proportion of valid programs with model scale.”
Quote in the paperSubstantial claimMay combine two claims.
FindingreasoningWhen randomly generated parents are arranged in ascending order of the 'ones' count, the resulting offspring distribution exhibits a clear skew towards higher fitness, and vice versa.
“When randomly generated parents are arranged in ascending order of the 'ones' count, the resulting offspring distribution exhibits a clear skew towards higher fitness (left) and vice versa.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataLMX avoids model bloat as it incrementally improves fitness, satisfying a key desirable property for symbolic regression.
“LMX avoids model bloat as it incrementally improves fitness, thereby satisfying a key desirable property for SR.”
Quote in the paperSubstantial claimThe quote only partly states this claim.
Findingown dataWhen Pythia is the LLM, performance is not as strong as with Galactica.
“As an ablation, when Pythia is the LLM, performance is not as strong.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Findingnone givenThe experiments focused on breadth rather than depth.
“The experiments focused on breadth rather than depth, and it is possible that with further effort LMX could enable state-of-the-art results, e.g., in symbolic regression.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Findingnone givenAll experiments in this paper except the Python Sodaracer experiment were conducted through Google Colab notebooks or on a single GPU.
“While LLMs are computationally expensive, all of the experiments in this paper (with exception of the Python Sodaracer experiment) were conducted either through Google Colab notebooks or on a single GPU; the code to run experiments is surprisingly compact, as the LMX method consists mainly of a simple LLM prompting strategy, and”
Quote in the paperNot a substantial claim- Rests on an assumption: LLMs are computationally expensive.
May combine two claims.
FindingcitationLMX performs comparably to previously published state-of-the-art symbolic regression methods, falling on the Pareto front for the 'banana' problem.
“LMX performs comparably to previously published results from state-of-the-art SR methods[58], falling on the Pareto front for the 'banana' problem, suggesting that it is a promising approach to symbolic regression.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [58]
Not checked in the free run.
May combine two claims.
Findingown dataAs the parameter count of the LLM increases in the length-9 binary string domain, the percent of valid offspring and number of novel offspring also increase.
“As the parameter count (i.e., number of weights trained with SGD) of the LLM is increased in the length-9 binary string domain, the percent of valid offspring and number of novel offspring (out of at most 60) also increase.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataThe number of novel genotypes generated on average from 20 applications of LMX reaches its maximum at four parents, while five parents tends to more often produce offspring that duplicate one of the parents exactly.
“The number of novel genotypes generated on average from 20 applications of LMX (which at 3 offspring per application can result in at most 60 offspring) to a random set of parents reaches its maximum at four parents (while five parents tends to more often produce offspring that duplicate one of the parents exactly).”
Quote in the paperSubstantial claimMay combine two claims.
Findingnone givenThe experiments in this paper cover a broad range of applications including equations, plain-text sentences, images, and code, using open-source neural networks for variation, crossing modalities, and measuring fitness and diversity.
“The experiments in this paper tackle a broad range of potential applications, across equations, plain-text sentences, images, and code, leveraging the burgeoning ecosystem of open-source neural networks as means of generating variation, crossing modalities, and measuring both fitness and diversity.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Findingown dataPreliminary experiments showed some qualitative effect from applying LMX on individuals with similar embeddings.
“Another interesting question is whether examples fed into LMX could be chosen more deliberately (e.g.only crossingover similar individuals to get more nuanced variation); preliminary experiments showed some qualitative effect from applying LMX on individuals with similar embeddings (Section 4.3), but require further experimentation to validate.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataIn the Homer Simpson quote sentiment task, LMX-Near performs better than LMX, filling a few extra niches nearer to the start sentence.
“LMX-Near performs better than LMX in this case, filling a few extra niches nearer to the start sentence.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Findingown dataThe sampling temperature of 0.8 noticeably improved consistency of generated output compared to the default of 1.0 in initial tests.
“The sampling temperature was set to 0.8, which in initial tests was found to noticeably improve consistency of generated output compared to the default of 1.0.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataLMX generally benefits from more examples in its prompt, is able to produce reasonable variation, and often creates valid Sodarace mutations.
“LMX generally benefits from more examples in its prompt, is able to produce reasonable variation, and often creates valid Sodarace mutations, highlighting its promise for evolving code.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataFor the Gore Vidal quote, LMX-Near outperforms LMX significantly, and both significantly outperform the control.
“LMX-Near outperforms LMX significantly, and both significantly outperform the control.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataWhen averaged over 15 randomly-generated parent sets, both the percent of valid offspring and number of novel offspring generally increase with model size.
“When averaged over 15 randomly-generated parent sets, both the percent of valid offspring and number of novel offspring generally increase with model size (Figure 2b).”
Quote in the paperNot a substantial claimMay combine two claims.
Findingnone givenThe zero-shot baseline quickly stagnates because it cannot iteratively refine its initial solutions; even Human Random solutions eventually outperform it due to greater diversity.
“The zero-shot baseline quickly stagnates, as it is unable to iteratively refine it's initial solutions; even Human Random solutions eventually outperform it, as they have greater diversity.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataLMX and LMX-Near do not perform significantly differently in increasing positive sentiment of the Simpsons quote, but both significantly outperform the control.
“LMX and LMX-Near do not perform significantly differently, but both significantly outperform the control.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataIn the initial Sodaracers experiments, higher numbers of parents nearly always increases performance, and the 2B model performs the best, while the 6B model underperforms.
“Higher numbers of parents nearly always increases performance in this setting, and the 2B model performs the best (interestingly, the 6B model underperforms; the reason is unclear, but suggests follow-up work to better understand what LLMs best fit a given task).”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based).
Findingnone givenThe vast majority of wall-clock time is spent in the forward pass of the LLM.
“The vast majority of wall-clock time is spent in the forward pass of the LLM.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Findingown dataRunning 5000 generations took around 100 hours.
“Running 5000 generations took around 100hrs.”
Quote in the paperNot a substantial claimMay combine two claims. The quote only partly states this claim.
Findingown dataThe highest-fitness prompts and corresponding images of LMX for each color all include the word 'background' but vary in length and detailed content, highlighting LMX's ability to discover diverse, non-obvious solutions.
“The highest-fitness prompts and corresponding images of LMX for each color all include the word”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataFor the Woody Allen quote, LMX and LMX-Near do not perform significantly differently, but both significantly outperform the control.
“LMX and LMX-Near do not perform significantly differently, but both significantly outperform the control.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataOne-point crossover is a strong baseline, with performance statistically similar to the LMX-No Header ablation.
“One-point crossover is a strong baseline, with performance statistically similar to the LMX -No Header ablation.”
Quote in the paperNot a substantial claimMay combine two claims.
Interpretationown dataThe results indicate that LMX can produce quality results across domains, often by leveraging the ecosystem of pretrained models to quantify fitness or diversity or to cross modalities.
“The results highlight the potential of the method to produce quality results across domains, often by leveraging the broad ecosystem of pretrained models that can be easily combined in many ways to quantify fitness or diversity, or to cross modalities (i.e. from text to image).”
Quote in the paperSubstantial claimMay combine two claims.
InterpretationreasoningLMX provides a simple mechanism to evolve semantically rich text representations with few domain-specific tweaks and benefits from progress in language models.
“The promise of such language model crossover (which is simple to implement and can leverage many different open-source language models) is that it enables a simple mechanism to evolve semantically-rich text representations (with few domain-specific tweaks), and naturally benefits from current progress in language models.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
PremisecitationLLMs are behind many approaches achieving state-of-the-art results in NLP domains such as question answering, code generation, and few-shot classification.
“Large language models (LLMs; [9,13]) are behind many of the approaches achieving state-of-the-art results in natural language processing domains, such as question-answering [19,33,70], code-generation [17,66], and few-shot classification [13,99].”
Quote in the paperNot a substantial claim0 of 7 sources checked- cites [9] source
Not checked in the free run.
- cites [13] source
Not checked in the free run.
- cites [19] source
Not checked in the free run.
- cites [33] source
Not checked in the free run.
- cites [70]
Not checked in the free run.
- cites [17]
Not checked in the free run.
- cites [66] source
Not checked in the free run.
May combine two claims.
PremisecitationPerformance at in-context learning improves with model scale, implying that methods relying on this capability will benefit from continuing progress in LLM training.
“Importantly, performance at in-context learning improves with model scale [15,124], implying that methods relying upon this capability will benefit from continuing progress in LLM training.”
Quote in the paperSubstantial claim0 of 2 sources checked- cites [15]
Not checked in the free run.
- cites [124] source
Not checked in the free run.
Classified as probably not a substantial claim.
PremisecitationVariation is critical as a primary driver of exploration and exploitation of the search space.
“Such variation is critical as a primary driver of both exploration and exploitation of the search space [27].”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [27]
Not checked in the free run.
Probably not a substantial claim: may not pass S3 (load-bearing).
InterpretationreasoningThe variation operator suggested by LMX is simple to implement.
“What is intriguing about this insight is that the variation operator it suggests is (1) simple to implement (i.e.concatenate a few text-based genotypes into a prompt, run it through an LLM, and extract a new genotype from its output; we release code implementing it accompanying this paper)”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S4 (based).
InterpretationreasoningFew-shot prompting works because the LLM can guess the pattern behind a few input/output pairs and generalize to a new target input at the end of the prompt.
“Few-shot prompting works because the LLM can”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based).
Interpretationnone givenSuch an operator can be created through very few lines of code.
“Such an operator can be created through very few lines of code.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
PremisecitationAutoencoders serve either to encode solutions into phenotypes matching a learned distribution or to generate new solutions sampled from that distribution.
“Autoencoders are used either as solution encodings which convert raw genotypes into phenotypes that align with the learned distribution; or as a mechanism for solution generation, with new solutions drawn directly from the established distribution.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [46] source
Not checked in the free run.
Probably not a substantial claim: may not pass S3 (load-bearing).
PremisecitationEstimation of distribution approaches have employed autoencoders to define distributions over high-performing solutions found during search.
“EDA approaches have leveraged autoencoders [46] to define distributions based on high-performing solutions identified during the search process.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [46] source
Not checked in the free run.
May combine two claims.
PremisereasoningAdvanced foundation models can be used directly, with distributions defined through strategic prompting, unlike traditional approaches that require training on solutions generated during search.
“Unlike traditional approaches that necessitate training models on solutions generated during the search, these advanced models can be directly leveraged, with distributions defined via strategic prompting.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based).
Interpretationnone givenIn theory, LMX can be generically applied to most evolutionary algorithms by swapping it in as the genetic variation operator.
“In theory, however, LMX can be generically applied to most EAs, e.g.multi-objective EAs [23,29], evolutionary strategies [1,5], or in support of open-ended evolution [121], but simply swapping it in as the genetic variation operator.”
Quote in the paperNot a substantial claim0 of 5 sources checkedMay combine two claims.
Interpretationnone givenFor examples drawn from a distribution, the probability of an LLM's output given multiple examples exceeds the probability given one example, which exceeds the probability given no examples.
“Pr 𝜓 LLM 𝜙 𝑥 1 , . . . , 𝑥 𝑘 X > Pr 𝜓 LLM 𝜙 𝑥 1 X > Pr 𝜓 LLM 𝜙 X .(5)”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based).
Interpretationnone givenLMX has a theoretical relationship to estimation of distribution algorithms.
“although LMX does bear a theoretical relationship to EDAs, as explored in Section 5.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
PremisecitationThe 'banana' problem consists of 5300 samples and two input features.
“This black-box problem was originally derived from a popular ML benchmark in the KEEL data set repository [31]; it has 5300 samples and two input features 𝑥 1 , 𝑥 2 .”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [31]
Not checked in the free run.
Probably not a substantial claim: may not pass S2 (checkable), S3 (load-bearing).
InterpretationreasoningOne can choose among various off-the-shelf LLMs for LMX according to the characteristics of the problem.
“This choice also highlights how different off-the-shelf LLMs can be selected for LMX based on properties of the problem.”
Quote in the paperNot a substantial claimMay combine two claims.
Interpretationown dataLMX is able to evolve reasonable solutions, though the paper does not claim it is better than existing methods.
“Note that the claim here is not that LMX is better than these existing methods, but simply that it is able to evolve reasonable solutions.”
Quote in the paperSubstantial claimClassified as probably not a substantial claim.
Study design and conductnone givenStable Diffusion was made deterministic by reseeding with a fixed PRNG seed before each image generation, so a given prompt always produces the same image.
“We make Stable Diffusion deterministic by reseeding with a fixed PRNG seed before each image is generated, so a given prompt always produces the same image.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S2 (checkable), S3 (load-bearing).
InterpretationreasoningThe bias toward human-designed expressions is also a natural bias against model bloat.
“This bias towards human-designed expressions is also a natural bias against model bloat, since humans strive to design compact expressions.”
Quote in the paperNot a substantial claim- Rests on an assumption: Humans strive to design compact expressions.
Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
PremisecitationStable Diffusion is a publicly available latent diffusion model that supports CLIP-guided text-to-image synthesis.
“Stable Diffusionfoot_3 is a publicly available latent diffusion model [95] that supports CLIP-guided [91] text-to-image synthesis.”
Quote in the paperNot a substantial claim0 of 2 sources checked- cites [95] source
Not checked in the free run.
- cites [91]
Not checked in the free run.
Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
PremisecitationThe excess color fitness functions correspond roughly to perceived image color and are well studied in agricultural image processing.
“These functions are easy to calculate, correspond roughly to perceived image color (e.g., they are well studied in agricultural image processing [75]), and provide a proof-of-concept where performance can be visually verified at a glance.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [75]
Not checked in the free run.
Classified as probably not a substantial claim.
PremisecitationSodarace is a 2D simulation of robots with arbitrary morphology constructed from Python functions that output a dictionary specifying joints and muscles and their connections.
“Sodarace is a 2D simulation of robots with arbitrary morphology constructed from Python functions (the genotype) which output a dictionary specifying joints and muscles, and how they are connected.”
Quote in the paperSubstantial claim0 of 2 sources checked- cites [63]
Not checked in the free run.
- cites [12]
Not checked in the free run.
Probably not a substantial claim: may not pass S4 (based).
Study design and conductnone givenRandomizing the order of seeds for each LMX application controls for variance from the order of programs in the prompt.
“We randomize the order of seeds for each application of LMX, to control for variance in results from the order of programs in the prompt.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S4 (based).
Interpretationnone givenBy concatenating parents in random order, the implicit signal to the LLM is that the list is unordered.
“By concatenating parents in a random order, the implicit signal to the LLM is that the list is unordered.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Premisenone givenA standard GA generates children by sampling from an implicit conditional probability distribution induced by randomly sampling parents and applying a stochastic reproduction operator.
“In contrast, a standard GA generates children by sampling from an implicit conditional probability distribution 𝑝 𝑔 (𝑥 | [𝑥 1 , . . ., 𝑥 𝑀 ]) induced by the process of randomly sampling parents and applying a stochastic reproduction operator 𝑔 (e.g., a crossover operator; Eq. 4).”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S4 (based).
InterpretationreasoningThe LLM's highest-probability action is to keep sampling objects from D* as it generates output.
“These parents are text-based objects that must have been sampled from some ground truth distribution 𝐷 * , and thus the LLM's highest-probability action is to keep sampling objects from 𝐷 * as it generates output.”
Quote in the paperNot a substantial claim- Rests on an assumption: Parents are text-based objects that must have been sampled from some ground truth distribution D*.
Probably not a substantial claim: may not pass S3 (load-bearing).
PremisecitationAn EDA constructs an explicit probabilistic distribution fit to the parent set and samples child solutions from it.
“An EDA constructs an explicit probabilistic distribution 𝐷 fit to the parent set {𝑥 1 , . . ., 𝑥 𝑀 }, and samples child solutions 𝑥 from 𝐷 [45,61].”
Quote in the paperNot a substantial claim0 of 2 sources checked- cites [45] source
Not checked in the free run.
- cites [61]
Not checked in the free run.
May combine two claims.
InterpretationreasoningAs the number of parents increases, the significance of accidental order patterns diminishes and a well-trained LLM is more likely to perceive the order as random.
“The LLM may notice some accidental patterns in the order, but, as the number of parents increases, e.g., when LMX processes the full population as in the EDA above, the significance of such spurious patterns diminishes and a well-trained LLM is more likely to perceive the order as random.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Study design and conductreasoningBecause a causal LLM is used, probabilities of each bit are not technically independent but conditional on previously generated bits and parent order.
“Note that, as we are using a causal LLM, probabilities of each bit are not technically independent, but rather conditional on the previously generated bits in the genome as well as on the order of the parents.”
Quote in the paperNot a substantial claimMay combine two claims.
InterpretationreasoningAs the LLM becomes a better in-context learner, it becomes better able to detect subtler patterns in randomly-ordered concatenated parents, and thus LMX approximates the ideal EDA distribution D*_EDA.
“As the LLM becomes a better and better in-context learner, it becomes better able to detect subtler patterns within a prompt of randomly-ordered concatenated parents, and thus LMX(𝑥 1 , . . . , 𝑥 𝑘 ) ≈ 𝐷 * EDA .(13)”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S2 (checkable).
InterpretationreasoningD_LM consists of distributions of objects found in sets that might appear in the universe of data from which the LLM's training dataset was drawn.
“In other words D LM consists of distributions of objects that are found in sets that might appear in the universe of data from which the dataset used to train the LLM was drawn.”
Quote in the paperNot a substantial claimMay combine two claims.
InterpretationreasoningLMX occupies an intermediate level of explicitness: its conditional distribution is explicit in yielding token probability distributions and computable output sequence probabilities, but implicit because the internal workings are encoded opaquely in LLM parameters and activations.
“LMX occupies an intermediate level of explicitness: The conditional distribution induced by feeding the parent prompt into the LLM is explicit in that it yields a series of probability distributions over tokens, and the probability of any output sequence can be directly computed, but is Manuscript submitted to ACM implicit in the sense that the internal workings of the distribution are encoded opa”
Quote in the paperSubstantial claimThe quote only partly states this claim.
InterpretationreasoningTheorem 5.2: For any genetic operator g on candidate space X and epsilon > 0, if phi is injective and psi is surjective, then there exists an LLM such that for all parent sets X of g and children x, the probability difference between g and LMX is less than epsilon.
“Theorem 5.2 (weight-based universality).For any genetic operator 𝑔 on candidate space X and 𝜖 > 0, if 𝜙 : 2 X → 𝑉 * is injective, and 𝜓 : 𝑉 * → X is surjective, then ∃ an LLM s.t. for all parent sets 𝑋 of 𝑔 and”
Quote in the paperSubstantial claimMay combine two claims.
InterpretationreasoningThe generative distributions in the experiments are limited to ones induced by simple concatenation of parents, but the underlying universality of LMX provides further explanation for its effectiveness as a generic operator across domains.
“The generative distributions in the experiments in this paper are limited to ones induced by simple concatenation of parents, but the underlying universality of the LMX method in general provides further explanation for how it can be an effective generic operator across such a wide range of domains, as was demonstrated in Section 4.”
Quote in the paperSubstantial claimMay combine two claims.
InterpretationreasoningThe ability to achieve arbitrarily complex and diverse reproductive behavior within a single framework gives LMX a potential advantage over hand-designed genetic operators; in theory, LMX can represent all such operators.
“This ability to achieve arbitrarily complex and diverse reproductive behavior within a single framework gives LMX a potential advantage over genetic operators that are hand-designed for different tasks: In theory, LMX can represent all such operators (especially if they appear in the dataset used to train the LLM).”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S2 (checkable), S3 (load-bearing).
InterpretationreasoningThe connection to EDAs may help explain why LMX is effective as an off-the-shelf genetic operator across a wide range of domains.
“Despite this confounding factor, it is clear that with a larger number of parents both approaches converge toward the same distribution -and this connection to EDAs may help to explain why LMX is effective as an off-the-shelf genetic operator across a wide range of domains.”
Quote in the paperNot a substantial claimMay combine two claims.
InterpretationcitationLMX can in principle sample from any conditional probability distribution, making it universal in the space of genetic operators, even with small parent sets.
“making it universal in the space of genetic operators, even with small parent sets.”
Quote in the paperNot a substantial claimMay combine two claims.
PremisecitationExisting fixed pre-trained LLMs with external memory, e.g., Flan-U-PaLM 540B, have been shown to implement universal Turing machines, implying universality can be achieved through effective prompting without altering LLM weights.
“However, when coupled with external memory, existing fixed pre-trained LLMs today, e.g., Flan-U-PaLM 540B [21], have been shown to implement universal Turing machines (UTMs) [38,104], implying that universality can be achieved through effective prompting schemes, without altering LLM weights:”
Quote in the paperSubstantial claim0 of 3 sources checked- cites [21]
Not checked in the free run.
- cites [38]
Not checked in the free run.
- cites [104] source
Not checked in the free run.
May combine two claims.
InterpretationreasoningEDAs typically assume an unordered distribution, but the inherent input ordering in autoregressive models creates an opportunity for directing the operator's output.
“EDAs typically assume an unordered distribution, yet the inherent input ordering in autoregressive models creates a unique opportunity for directing the operator's output.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
InterpretationreasoningFor relatively small search spaces, if LMX behaves unexpectedly, it may be difficult to diagnose the cause due to LLM opacity, whereas traditional EAs allow straightforward reasoning about genetic operator variation.
“However, even for relatively small search spaces, if LMX is not behaving as expected on a particular problem, it may be difficult to find the precise cause of the issue, due to the opacity of LLMs, whereas in traditional EAs it could be straightforward to reason about the kinds of variation a genetic operator is likely to produce.”
Quote in the paperNot a substantial claim- Rests on an assumption: The opacity of LLMs makes it difficult to diagnose unexpected behavior.
Probably not a substantial claim: may not pass S3 (load-bearing).
InterpretationreasoningLLM opacity can obscure undesirable biases in the model, which is especially concerning for applications with societal implications.
“This opacity could also obscure undesirable biases hidden in the model, which could be especially concerning if the application has societal implications.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
PremisecitationLater work using an LMX-like approach to discover new solutions to mathematical problems also sorted parents by fitness before recombination.
“Later work, which used an LMX-like approach to discover new solutions to mathematical problems [96] also sorted parents by fitness before recombination.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [96]
Not checked in the free run.
Probably not a substantial claim: may not pass S3 (load-bearing).
PremisecitationEAs have been shown to be effective in search spaces with millions and even billions of variables.
“EAs have been shown to be effective in search spaces with millions and even billions of variables [20,28].”
Quote in the paperNot a substantial claim0 of 2 sources checked- cites [20]
Not checked in the free run.
- cites [28] source
Not checked in the free run.
Probably not a substantial claim: may not pass S2 (checkable), S3 (load-bearing). May combine two claims.
InterpretationcitationThese results are suggestive of the versatility of this biasing technique; a variety of sorting strategies could be employed to cater to specific objectives.
“These results are suggestive of the versatility of this biasing technique; a variety of sorting strategies could be employed to cater to specific objectives.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
PremisecitationSubsequent work following the arxiv release of the LMX paper performed extensive experimentation with different orderings of parents in more complex natural language domains and came to similar conclusions about the importance of ordering.
“Subsequent work following the arxiv release of the LMX paper [34,131] performed extensive experimentation with different orderings of parents in more complex natural language domains, and came to similar conclusions about the importance of ordering.”
Quote in the paperNot a substantial claim0 of 2 sources checked- cites [34]
Not checked in the free run.
- cites [131]
Not checked in the free run.
May combine two claims.
Interpretationnone givenAutoregressive models act as pattern completion engines and provide a pathway to guide sampling through directional cues.
“Acting as pattern completion engines, these models provide a pathway to guide the sampling process through directional cues.”
Quote in the paperSubstantial claimMay combine two claims.
InterpretationreasoningAn ascending input prompt produces ascending output; consequently, an input arranged in ascending fitness order prompts the model to generate output following an ascending fitness trend.
“An ascending input prompt produces ascending output.Consequently, an input arranged in ascending fitness order prompts the model to generate output that follows an ascending fitness trend.”
Quote in the paperSubstantial claimMay combine two claims.
Interpretationnone givenThe LLM can generate invalid outputs that cannot be parsed as solutions, whereas traditional EAs can formally guarantee validity through carefully designed genetic operators.
“There is also the issue that the LLM can generate”
Quote in the paperNot a substantial claim- Rests on an assumption: Traditional EAs can formally guarantee validity through carefully designed genetic operators.
Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).
Interpretationnone givenFor application domains far from the LLM's training set, the method of population initialization becomes particularly important.
“Relatedly, if an application domain is especially far from the LLM's training set, e.g., far from any kind of text found on the internet, then choosing a method of population initialization becomes particularly important.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
InterpretationreasoningFor a given model size, there may be a trade-off between more generic models, which likely perform decently in most domains, and more specialized ones.
“If larger models are infeasible to run, for any given model size there may be a trade-off between more generic models, which are likely to perform decently in most domains, and more specialized ones.”
Quote in the paperNot a substantial claim- Rests on an assumption: Larger LLMs generally have been trained on larger and broader data sets.
Probably not a substantial claim: may not pass S3 (load-bearing).
InterpretationreasoningLMX's ability to suggest relevant variation in a domain is likely dependent on the LLM's training data, size, and training quality.
“One important direction is Manuscript submitted to ACM to explore the dependence of LMX's performance on qualities of the underlying LLM; the ability of LMX to suggest relevant variation in a particular domain is likely dependent on the LLM's training data (along with its size and how well it was trained).”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S4 (based).
Interpretationnone givenLMX alone does not address common population dynamics concerns of traditional EAs such as premature convergence, diversity maintenance, and exploration/exploitation pitfalls.
“Finally, LMX alone does not allow us to escape common population dynamics concerns that plague traditional EAs, such as premature convergence, diversity maintenance, and other exploration/exploitation pitfalls.”
Quote in the paperNot a substantial claimClassified as probably not a substantial claim.
InterpretationreasoningIf the type of text being evolved is not well-represented in the LLM's training distribution, LMX relying on that LLM will likely perform poorly.
“For example, the expectation is that if the type of text chosen for evolution (e.g.code in a very new programming language) is not well-represented in the training distribution of a particular LLM, then LMX that relies on that LLM will likely perform poorly.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Interpretationown dataLMX could be used for continuous optimization, as suggested by its tuning of floating-point constants.
“LMX could even be used for continuous optimization, as suggested by how it tunes floating-point constants (Figure 5).”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S2 (checkable).
Interpretationnone givenLMX is a flexible and easy-to-use genetic operator that lets EA practitioners take advantage of recent large language models.
“As a flexible and easy-to-use genetic operator, LMX provides a way for EA practitioners to take advantage of the recent revolution in large language models.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based).
Interpretationnone givenThe level of stochasticity in LMX can be controlled by the softmax temperature parameter, analogous to a mutation rate parameter in a traditional EA.
“For example, the level of stochasticity in LMX can be controlled by the softmax temperature parameter, which can be seen as analogous to a mutation rate parameter in a traditional EA.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
InterpretationreasoningThe code to run experiments is surprisingly compact because LMX consists mainly of a simple LLM prompting strategy.
“While LLMs are computationally expensive, all of the experiments in this paper (with exception of the Python Sodaracer experiment) were conducted either through Google Colab notebooks or on a single GPU; the code to run experiments is surprisingly compact, as the LMX method consists mainly of a simple LLM prompting strategy, and”
Quote in the paperNot a substantial claimClassified as probably not a substantial claim.
Interpretationnone givenLMX provides a generic genetic operator that allows practitioners to quickly set up algorithms to search diverse spaces in a manner aligned with the generative nature of LLMs.
“LMX does not solve these grand challenges of EAs, rather it provides a generic genetic operator that allows practitioners to quickly set up algorithms to search diverse spaces in a manner aligned with the generative nature of LLMs, i.e. aligned with the way humans produce text.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
InterpretationreasoningThis time could be reduced considerably through batching offspring generation, which is naturally parallelized.
“This could be reduced considerably through batching offspring generation, which is naturally parallelized.”
Quote in the paperNot a substantial claim- Rests on an assumption: Batching offspring generation is naturally parallelized.
Probably not a substantial claim: may not pass S2 (checkable), S3 (load-bearing), S4 (based). May combine two claims.
Interpretationnone givenEvolution in general is a powerful and easy-to-implement way to quickly explore possibilities, and LMX is a promising and simple way of instantiating them.
“In conclusion, there are likely many creative ways to beneficially combine various models together that this paper leaves unexplored; evolution in general is a powerful and easy-to-implement way to quickly explore such possibilities, and LMX in particular is a promising and simple way of instantiating them.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
InterpretationcitationAdding an instruction to the end of the LMX prompt that asks the model to combine the starting programs into a new program provides a minimal form of domain customisation for the language model.
“This provides some minimal domain customisation to the language model, and is reminiscent of prior work demonstrating that fine-tuning language models on tasks described as instructions can dramatically improve performance on unseen tasks [98,123].”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
PremisecitationPrior work indicates that instruction-based fine-tuning of language models can greatly enhance their performance on tasks they have not seen.
“This provides some minimal domain customisation to the language model, and is reminiscent of prior work demonstrating that fine-tuning language models on tasks described as instructions can dramatically improve performance on unseen tasks [98,123].”
Quote in the paperNot a substantial claim0 of 2 sources checked- cites [98]
Not checked in the free run.
- cites [123]
Not checked in the free run.
Classified as probably not a substantial claim.
Study design and conductreasoningIn the binary string experiments, genomes were pre- and post-processed with '_' characters separating each bit to ensure each bit is a single token, avoiding unintended tokenizer effects.
“In the binary string experiments to avoid unintended effects from the tokenizer, rather than evolving strings like 0011 all genomes were pre and post processed and given to the language model with”
Quote in the paperSubstantial claimClassified as probably not a substantial claim. May combine two claims.
Study design and conductown dataTo control for parent-order effects, the study either averaged results over every possible permutation of parents or, in long evolution runs, randomly selected a permutation for each sample.
“To control for this we either averaged our results over every possible permutation of parents or (in long evolution runs) randomly selected from the set of permutations for each sample.”
Quote in the paperSubstantial claimClassified as probably not a substantial claim. May combine two claims.
Study design and conductreasoningThe 1-second simulation time used to evaluate Sodaracers is sufficient to show meaningful locomotion and was selected to allow meaningful evolution under the study's computational limits.
“The fitness function was measured as the horizontal distance travelled by an instantiated robot after 1 second of simulation time; this abbreviated evaluation time is enough to show meaningful locomotion and was chosen to demonstrate meaningful evolution within our computational constraints.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
InterpretationreasoningFor the excess-red, excess-blue, and excess-green fitness functions computed on 8-bit integer RGB images at 512×512 resolution, the maximum possible fitness is 66,846,720, the value for a monochromatic image of the target color.
“Image fitness functions were computed using 8-bit integer RGB images; the maximum fitness for the excess-red, excess-blue, and excess-green fitness functions is therefore 512 • 512 • 255 = 66,846,720, which would be the fitness of a monochromatic image of the target color.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
PremisecitationThe Pythia models used are trained by EleutherAI for ongoing research.
“These Pythia models are trained by EleutherAI for ongoing research [7].”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [7]
Not checked in the free run.
The paper relies on this without support.
Evolution depends on meaningful information being passed from parents to offspring.
“Evolution requires there to be meaningful information transmitted from parents to offspring.”
The paper relies on this without support.
Hand-designed operators struggle with symbolic regression because the space of expressions is non-local and discontinuous.
“Symbolic regression is challenging to tackle with hand-designed operators, due to non-locality and discontinuities in the space of expressions.”
The paper relies on this without support.
The 113 benchmark expressions represent the distribution of expressions that humans aim to discover with symbolic regression.
“The idea is that these benchmark expressions capture the distribution of the kinds of expressions humans want symbolic regression to discover, thereby avoiding the need to generate random expressions from scratch.”
The paper relies on this without support.
Text-to-image models tend to be robust to grammatical errors and nonsense, so a one-point crossover producing a mangled bag-of-words is a strong baseline.
“In contrast to other domains in this paper, even though the genotype is text, text-to-image models tend to be quite robust to grammatical errors and nonsense, so a one-point crossover that produces a mangled bag-of-words is a strong baseline.”
The paper relies on this without support.
Humans strive to design compact expressions.
“This bias towards human-designed expressions is also a natural bias against model bloat, since humans strive to design compact expressions.”
The paper relies on this without support.
Parents are text-based objects that must have been sampled from some ground truth distribution D*.
“These parents are text-based objects that must have been sampled from some ground truth distribution 𝐷 * , and thus the LLM's highest-probability action is to keep sampling objects from 𝐷 * as it generates output.”
The paper relies on this without support.
The LLM is naturally familiar with human-designed expressions because of its training data.
“while LMX thrives in this space since the LLM is naturally familiar with human-designed expressions due to its training data.”
The paper relies on this without support.
Larger LLMs generally have been trained on larger and broader data sets.
“Larger LLMs generally have been trained on larger and broader data sets, so are more likely to be comfortable processing data from a given domain.”
The paper relies on this without support.
LLMs are computationally expensive.
“While LLMs are computationally expensive, all of the experiments in this paper (with exception of the Python Sodaracer experiment) were conducted either through Google Colab notebooks or on a single GPU;”
The paper relies on this without support.
Traditional EAs can formally guarantee validity through carefully designed genetic operators.
“while in traditional EAs validity can be formally guaranteed by carefully-designed genetic operators.”
The paper relies on this without support.
The opacity of LLMs makes it difficult to diagnose unexpected behavior.
“due to the opacity of LLMs, whereas in traditional EAs it could be straightforward to reason about the kinds of variation a genetic operator is likely to produce.”
The paper relies on this without support.
Batching offspring generation is naturally parallelized.
“This could be reduced considerably through batching offspring generation, which is naturally parallelized.”
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Table 3 assigns the Woody Allen quote to Homer Simpson
MinorTable 3 is labeled as a Homer Simpson result, but its starting sentence is the quote the paper attributes to Woody Allen.
“Table: 3 Table 3 . Full pareto front of a representative run of sentiment modification for the Homer Simpson quote. | Distance Positivity Sentence | | | | --- | --- | --- | | 0.00 | 0.013 | Life is divided into the horrible and the |”
“Woody Allen's "Life is divided into the horrible and the miserable."”
Figure 10 is given incompatible normalization rules
MinorThe results are described as normalized using each seed's observed minimum and maximum, while the experimental details say that 1.0 represents the theoretical maximum image fitness. Those are different normalization rules.
“normalized to [0, 1] based on the min and max fitness for each each seed”
“The plot in Figure 10 is normalized with 1.0 set to this maximum fitness.”
Cites
1 retracted
Johnson, A. J., Meyerson, E., de la Parra, J., Savas, T. A., Miikkulainen, R. P., & Harper, C. (2019) · PLoS ONE · doi:10.1371/journal.pone.0213918 · Cited by 41 · see citing works
Self-citationRetractedVaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A. N., Kaiser, L., & Polosukhin, I. (2017) · arXiv · doi:10.48550/arxiv.1706.03762 · Cited by 120,404 · see citing works
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053 · see citing works
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 49,574 · see citing works
A mathematical theory of communication
Hockett, C. F., Shannon, C., & Weaver, W. (1948) · MOCO · doi:10.1145/584091.584093 · Cited by 30,529
Multilayer feedforward networks are universal approximators
Hornik, K., Stinchcombe, M., & White, H. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90020-8 · Cited by 21,728 · see citing works
Reducing the dimensionality of data with neural networks
Hinton, G. E., & Salakhutdinov, R. R. (2006) · Science · doi:10.1126/science.1127647 · Cited by 20,928 · see citing works
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1989) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf02551274 · Cited by 13,883 · see citing works
Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks
Reimers, N., & Gurevych, I. (2019) · Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP) · doi:10.18653/v1/d19-1410 · Cited by 12,778 · see citing works
Transformers: State-of-the-Art Natural Language Processing
Wolf, T., Debut, L., Sanh, V., Chaumond, J., Delangue, C., Moi, A., Cistac, P., Rault, T., Louf, R., Funtowicz, M., et al. (2020) · Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations · doi:10.18653/v1/2020.emnlp-demos.6 · Cited by 8,741 · see citing works
Holland, J. H. (1992) · Scientific American · doi:10.1038/scientificamerican0792-66 · Cited by 5,764 · see citing works
Proceedings of the 25th international conference on Machine learning
Cohen, W. W., McCallum, A., & Roweis, S. T. (2008) · Cited by 5,691 · see citing works
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397 · see citing works
HuggingFace's Transformers: State-of-the-art Natural Language Processing
Wolf, T., Debut, L., Sanh, V., Chaumond, J., Delangue, C., Moi, A., Cistac, P., Rault, T., Louf, R., Funtowicz, M., et al. (2019) · arXiv · doi:10.48550/arxiv.1910.03771 · Cited by 3,347 · see citing works
Distilling Free-Form Natural Laws from Experimental Data
Schmidt, M., & Lipson, H. (2009) · Science · doi:10.1126/science.1165893 · Cited by 3,327 · see citing works
Generating Sequences With Recurrent Neural Networks
Graves, A. (2013) · arXiv · doi:10.48550/arxiv.1308.0850 · Cited by 2,894 · see citing works
Evolution strategies – A comprehensive introduction
Beyer, H.-G., & Schwefel, H. (2002) · Natural Computing · doi:10.1023/a:1015059928466 · Cited by 2,810 · see citing works
Learn to Explain: Multimodal Reasoning via Thought Chains for Science Question AnsweringPreprint
Lu, P., Mishra, S., Xia, T., et al. (2022) · Neural Information Processing Systems · doi:10.48550/arxiv.2209.09513 · Cited by 2,754 · see citing works
On the Opportunities and Risks of Foundation Models
Bommasani, R., Hudson, D. A., Adeli, E., Altman, R., Arora, S., von Arx, S., Bernstein, M. S., Bohg, J., Bosselut, A., Brunskill, E., et al. (2021) · arXiv · doi:10.48550/arxiv.2108.07258 · Cited by 2,676 · see citing works
Alcalá‐Fdez, J., Fernández, A., Luengo, J., Derrac, J., García, S., Sánchez, L., & Herrera, F. (2011) · Cited by 2,337 · see citing works
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Larraanaga, P., & Lozano, J. A. (2001) · Kluwer Academic Publishers eBooks · Cited by 1,908 · see citing works
CoCa: Contrastive Captioners are Image-Text Foundation ModelsPreprint
Yu, J.-H., Wang, Z., Vasudevan, V., Yeung, L., Seyedhosseini, M., & Wu, Y.-H. (2022) · Trans. Mach. Learn. Res. · doi:10.48550/arxiv.2205.01917 · Cited by 1,899 · see citing works
Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019
Auger, A., & Stützle, T. (2019) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 1,726 · see citing works
Lost in the Middle: How Language Models Use Long Contexts
Liu, N. F., Lin, K., Hewitt, J., Paranjape, A., Bevilacqua, M., Petroni, F., & Liang, P. (2024) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00638 · Cited by 1,612 · cited 1× · see citing works
“Figure 4 shows the heritability of LMX in the binary strings domain, and Figure 5 shows how fitness evolves in OneMax using LMX.”
AI Feynman: A physics-inspired method for symbolic regression
Udrescu, S., & Tegmark, M. (2019) · Science Advances · doi:10.1126/sciadv.aay2631 · Cited by 1,470 · see citing works
Scaling Instruction-Finetuned Language Models
Chung, H. W., Hou, L., Longpre, S., Zoph, B., Tay, Y., Fedus, W., Li, Y., Wang, X., Dehghani, M., Brahma, S., et al. (2022) · arXiv · doi:10.48550/arxiv.2210.11416 · Cited by 1,441 · see citing works
Evaluating Large Language Models Trained on Code
Chen, M., Tworek, J., Jun, H., Yuan, Q., Pinto, H. P. D. O., Kaplan, J., Edwards, H., Burda, Y., Joseph, N., Brockman, G., et al. (2021) · arXiv · doi:10.48550/arxiv.2107.03374 · Cited by 1,436 · see citing works
WizardLM: Empowering Large Pre-Trained Language Models to Follow Complex InstructionsPreprint
Xu, C., Sun, Q., Zheng, K., Geng, X.-B., Zhao, P., Feng, J., Tao, C., Lin, Q.-W., & Jiang, D. (2023) · International Conference on Learning Representations · doi:10.48550/arxiv.2304.12244 · Cited by 1,362 · see citing works
Exploiting Cloze-Questions for Few-Shot Text Classification and Natural Language Inference
Schick, T., & Schütze, H. (2021) · Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume · doi:10.18653/v1/2021.eacl-main.20 · Cited by 1,305 · see citing works
Emergent Abilities of Large Language Models
Wei, J., Tay, Y., Bommasani, R., Raffel, C., Zoph, B., Borgeaud, S., Yogatama, D., Bosma, M., Zhou, D., Metzler, D., et al. (2022) · arXiv · doi:10.48550/arxiv.2206.07682 · Cited by 1,264 · see citing works
Abandoning Objectives: Evolution Through the Search for Novelty Alone
Lehman, J., & Stanley, K. O. (2011) · Evolutionary Computation · doi:10.1162/evco_a_00025 · Cited by 1,216 · see citing works
Self-citationThe CMA Evolution Strategy: A TutorialPreprint
Hansen, N. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1604.00772 · Cited by 1,121 · see citing works
Finetuned Language Models Are Zero-Shot Learners
Wei, J., Bosma, M., Zhao, V. Y., Guu, K., Yu, A. W., Lester, B., Du, N., Dai, A. M., & Le, Q. V. (2021) · arXiv · doi:10.48550/arxiv.2109.01652 · Cited by 1,101 · see citing works
GenProg: A Generic Method for Automatic Software Repair
Goues, C. L., Nguyen, T. H., Forrest, S., & Weimer, W. R. (2011) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2011.104 · Cited by 1,084 · see citing works
Competition-level code generation with AlphaCode
Li, Y., Choi, D., Chung, J., Kushman, N., Schrittwieser, J., Leblond, R., Eccles, T., Keeling, J., Gimeno, F., Dal Lago, A., et al. (2022) · Science · doi:10.1126/science.abq1158 · Cited by 1,043 · see citing works
Harik, G. R., Lobo, F. G., & Goldberg, D. E. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.797971 · Cited by 986 · see citing works
Foundations of Genetic Programming
Langdon, W. B., & Poli, R. (2002) · Springer Berlin Heidelberg · doi:10.1007/978-3-662-04726-2 · Cited by 894 · see citing works
A review on sentiment analysis and emotion detection from text
Nandwani, P., & Verma, R. (2021) · Social Network Analysis and Mining · doi:10.1007/s13278-021-00776-6 · Cited by 869 · see citing works
Compositional pattern producing networks: A novel abstraction of development
Stanley, K. O. (2007) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-007-9028-8 · Cited by 714 · see citing works
Fantastically Ordered Prompts and Where to Find Them: Overcoming Few-Shot Prompt Order Sensitivity
Lu, Y., Bartolo, M., Moore, A., Riedel, S., & Stenetorp, P. (2021) · arXiv · doi:10.48550/arxiv.2104.08786 · Cited by 615 · see citing works
Multitask Prompted Training Enables Zero-Shot Task Generalization
Sanh, V., Webson, A., Raffel, C., Bach, S. H., Sutawika, L., Alyafeai, Z., Chaffin, A., Stiegler, A., Scao, T. L., Raja, A., et al. (2021) · arXiv · doi:10.48550/arxiv.2110.08207 · Cited by 612 · see citing works
Fantastically Ordered Prompts and Where to Find Them: Overcoming Few-Shot Prompt Order Sensitivity
Lu, Y., Bartolo, M., Moore, A., Riedel, S., & Stenetorp, P. (2022) · Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/2022.acl-long.556 · Cited by 610 · cited 1× · see citing works
“85, and with a maximum generation Manuscript submitted to ACM”
Galactica: A Large Language Model for Science
Taylor, R., Kardas, M., Cucurull, G., Scialom, T., Hartshorn, A., Saravia, E., Poulton, A., Kerkez, V., & Stojnic, R. (2022) · arXiv · doi:10.48550/arxiv.2211.09085 · Cited by 605 · see citing works
Learning to summarize from human feedback
Stiennon, N., Ouyang, L., Wu, J., Ziegler, D. M., Lowe, R., Voss, C., Radford, A., Amodei, D., & Christiano, P. (2020) · arXiv · doi:10.48550/arxiv.2009.01325 · Cited by 550 · see citing works
Mathematical discoveries from program search with large language models
Romera-Paredes, B., Barekatain, M., Novikov, A., Balog, M., Kumar, M. P., Dupont, E., Ruiz, F. J. R., Ellenberg, J. S., Wang, P., Fawzi, O., et al. (2024) · Nature · doi:10.1038/s41586-023-06924-6 · Cited by 544 · see citing works
Photo Aesthetics Ranking Network with Attributes and Content Adaptation
Kong, S., Shen, X., Lin, Z., Měch, R., & Fowlkes, C. C. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-46448-0_40 · Cited by 509 · see citing works
An introduction and survey of estimation of distribution algorithms
Hauschild, M., & Pelikan, M. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.08.003 · Cited by 478 · see citing works
Kolmogorov, A. N. (1963) · Translations - American Mathematical Society/Translations · doi:10.1090/trans2/028/04 · Cited by 459 · see citing works
Proceedings of the Genetic and Evolutionary Computation Conference
(2018) · doi:10.1145/3205455 · Cited by 427 · see citing works
Learn to Explain: Multimodal Reasoning Via Thought Chains for Science Question Answering
Lu, P., Mishra, S. R., Xia, T., Qiu, L., Chang, K.-W., Zhu, S. C., Tafjord, O., Clark, P., & Kalyan, A. (2022) · neural information processing systems · doi:10.52202/068431-0182 · Cited by 420 · see citing works
Illuminating search spaces by mapping elitesPreprint
Mouret, J.-B., & Clune, J. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1504.04909 · Cited by 407 · see citing works
Evolutionary computation: a unified approach
(2006) · Choice Reviews Online · doi:10.5860/choice.44-2154 · Cited by 370 · see citing works
CodeGen: An Open Large Language Model for Code with Multi-Turn Program Synthesis
Nijkamp, E., Pang, B., Hayashi, H., Tu, L., Wang, H., Zhou, Y., Savarese, S., & Xiong, C. (2022) · arXiv · doi:10.48550/arxiv.2203.13474 · Cited by 330 · see citing works
Symbolic regression in materials science
Wang, Y., Wagner, N., & Rondinelli, J. M. (2019) · MRS Communications · doi:10.1557/mrc.2019.85 · Cited by 322 · see citing works
Image Aesthetic Assessment: An experimental survey
Deng, Y., Loy, C. C., & Tang, X. (2017) · IEEE Signal Processing Magazine · doi:10.1109/msp.2017.2696576 · Cited by 306 · cited 1× · see citing works
“One contribution of this paper is to demonstrate how evolutionary methods can easily leverage this growing eco-system to evolve high-quality artifacts in diverse applications.”
TweetNLP: Cutting-Edge Natural Language Processing for Social MediaPreprint
Camacho-Collados, J., Rezaee, K., Riahi, T., Ushio, A., Loureiro, D., Antypas, D., Boisson, J., Anke, L., Liu, F., Martínez-Cámara, E., et al. (2022) · Conference on Empirical Methods in Natural Language Processing · doi:10.48550/arxiv.2206.14774 · Cited by 272 · see citing works
WierstraDaan, SchaulTom, GlasmachersTobias, SUNYi, PetersJan, & SchmidhuberJürgen (2014) · Journal of Machine Learning Research · doi:10.5555/2627435.2638566 · Cited by 261 · see citing works
Quality and Diversity Optimization: A Unifying Modular Framework
Cully, A., & Demiris, Y. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2704781 · Cited by 258 · see citing works
Hierarchical Bayesian Optimization Algorithm
Pelikán, M. (2005) · Studies in fuzziness and soft computing · doi:10.1007/b10910 · Cited by 225 · see citing works
On the convergence of a class of estimation of distribution algorithms
Zhang, Q., & Mühlenbein, H. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.820663 · Cited by 224 · see citing works
Picbreeder: evolving pictures collaboratively online
Secretan, J., Beato, N., D Ambrosio, D. B., Rodriguez, A., Campbell, A., & Stanley, K. O. (2008) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1357054.1357328 · Cited by 192 · see citing works
Deep Learning for Text Style Transfer: A Survey
Jin, D., Jin, Z., Hu, Z., Vechtomova, O., & Mihalcea, R. F. (2021) · Computational Linguistics · doi:10.1162/coli_a_00426 · Cited by 192 · see citing works
<title>Machine vision detection parameters for plant species identification</title>
Meyer, G. E., Hindman, T. W., & Laksmi, K. (1999) · SPIE Proceedings · doi:10.1117/12.336896 · Cited by 187 · see citing works
Evolutionary multiobjective optimization: open research areas and some challenges lying ahead
Coello, C. A. C., González-Brambila, S. B., Gamboa, J. F., Tapia, M. G. C., & Gómez, R. H. (2019) · Complex & Intelligent Systems · doi:10.1007/s40747-019-0113-4 · Cited by 174 · see citing works
Turner, R., Eriksson, D., McCourt, M., Kiili, J., Laaksonen, E., Xu, Z., & Guyon, I. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.10201 · Cited by 158 · see citing works
Large Language Models as Optimizers
Yang, C., Wang, X., Lu, Y., Liu, H., Le, Q. V., Zhou, D., & Chen, X. (2023) · arXiv · doi:10.48550/arxiv.2309.03409 · Cited by 151 · see citing works
Helper-Objectives: Using Multi-Objective Evolutionary Algorithms for Single-Objective Optimisation
Jensen, M. T. (2004) · Journal of Mathematical Modelling and Algorithms · doi:10.1023/b:jmma.0000049378.57591.c6 · Cited by 145 · see citing works
Orzechowski, P., Cava, W. L., & Moore, J. H. (2018) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/3205455.3205539 · Cited by 142 · see citing works
TweetNLP: Cutting-Edge Natural Language Processing for Social Media
Camacho-collados, J., Rezaee, K., Riahi, T., Ushio, A., Loureiro, D., Antypas, D., Boisson, J., Espinosa Anke, L., Liu, F., & Martínez Cámara, E. (2022) · Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing: System Demonstrations · doi:10.18653/v1/2022.emnlp-demos.5 · Cited by 142 · see citing works
Novelty-Based Multiobjectivization
Mouret, J.-B. (2011) · Studies in computational intelligence · doi:10.1007/978-3-642-18272-3_10 · Cited by 139 · see citing works
Hierarchical Bayesian Optimization Algorithm
Pelikán, M. (2005) · Studies in fuzziness and soft computing · doi:10.1007/978-3-540-32373-0_6 · Cited by 137 · see citing works
Theory of evolutionary computation : recent developments in discrete optimization
Doerr, B., & Neumann, F. (2020) · Cited by 125 · see citing works
Parameter identification for symbolic regression using nonlinear least squares
Kommenda, M., Burlacu, B., Kronberger, G., & Affenzeller, M. (2019) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-019-09371-3 · Cited by 123 · see citing works
Age-fitness pareto optimization
Schmidt, M. D., & Lipson, H. (2010) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1830483.1830584 · Cited by 108 · see citing works
Towards Automated Circuit Discovery for Mechanistic Interpretability
Conmy, A., Mavor-Parker, A. N., Lynch, A., Heimersheim, S., & Garriga-Alonso, A. (2023) · neural information processing systems · doi:10.52202/075280-0719 · Cited by 105 · see citing works
A Review on Estimation of Distribution Algorithms
Larrañaga, P. (2002) · Genetic Algorithms and Evolutionary Computation · doi:10.1007/978-1-4615-1539-5_3 · Cited by 100 · see citing works
Age-Fitness Pareto Optimization
Schmidt, M., & Lipson, H. (2011) · Genetic and Evolutionary Computation · doi:10.1007/978-1-4419-7747-2_8 · Cited by 99 · see citing works
Transformers learn in-context by gradient descent
von Oswald, J., Niklasson, E., Randazzo, E., Sacramento, J., Mordvintsev, A., Zhmoginov, A., & Vladymyrov, M. (2022) · arXiv · doi:10.48550/arxiv.2212.07677 · Cited by 87 · see citing works
Towards Automated Circuit Discovery for Mechanistic Interpretability
Conmy, A., Mavor-Parker, A. N., Lynch, A., Heimersheim, S., & Garriga-Alonso, A. (2023) · arXiv · doi:10.48550/arxiv.2304.14997 · Cited by 72 · see citing works
Error Thresholds in Genetic Algorithms
Ochoa, G. (2006) · Evolutionary Computation · doi:10.1162/evco.2006.14.2.157 · Cited by 71 · see citing works
Bontrager, P., Lin, W., Togelius, J., & Risi, S. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-77583-8_18 · Cited by 71 · see citing works
Eureka: Human-Level Reward Design via Coding Large Language ModelsPreprint
Ma, Y. J., Liang, W., Wang, G., Huang, D.-A., Bastani, O., Jayaraman, D., Zhu, Y., Fan, L., & Anandkumar, A. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2310.12931 · Cited by 71 · see citing works
Memory Augmented Large Language Models are Computationally UniversalPreprint
Schuurmans, D. (2023) · arXiv.org · doi:10.48550/arxiv.2301.04589 · Cited by 64 · see citing works
POET: open-ended coevolution of environments and their optimized solutions
Wang, R., Lehman, J., Clune, J., & Stanley, K. O. (2019) · Proceedings of the Genetic and Evolutionary Computation Conference · doi:10.1145/3321707.3321799 · Cited by 61 · see citing works
Self-citationChicano, F., Whitley, D., Ochoa, G., & Tinós, R. (2017) · Proceedings of the Genetic and Evolutionary Computation Conference · doi:10.1145/3071178.3071285 · Cited by 52 · see citing works
LLMatic: Neural Architecture Search Via Large Language Models And Quality Diversity Optimization
Nasir, M. U., Earle, S., Togelius, J., James, S., & Cleghorn, C. (2024) · Proceedings of the Genetic and Evolutionary Computation Conference · doi:10.1145/3638529.3654017 · Cited by 52 · see citing works
New Horizons in Evolutionary Robotics
Doncieux, S., Bredèche, N., & Mouret, J.-B. (2011) · Studies in computational intelligence · doi:10.1007/978-3-642-18272-3 · Cited by 52 · see citing works
Rethinking Interpretability in the Era of Large Language Models
Singh, C., Inala, J. P., Galley, M., Caruana, R., & Gao, J. (2024) · arXiv · doi:10.48550/arxiv.2402.01761 · Cited by 50 · see citing works
EvoPrompt: Connecting LLMs with Evolutionary Algorithms Yields Powerful Prompt Optimizers
Guo, Q., Wang, R., Guo, J., Li, B., Song, K., Tan, X., Liu, G., Bian, J., & Yang, Y. (2023) · arXiv · doi:10.48550/arxiv.2309.08532 · Cited by 50 · see citing works
MarioGPT: Open-Ended Text2Level Generation through Large Language Models
Sudhakaran, S., González-Duque, M., Freiberger, M., Glanois, C., Najarro, E., & Risi, S. (2023) · neural information processing systems · doi:10.52202/075280-2361 · Cited by 49 · see citing works
EvoPrompting: Language Models for Code-Level Neural Architecture Search
Chen, A., Dohan, D. M., & So, D. R. (2023) · arXiv · doi:10.48550/arxiv.2302.14838 · Cited by 45 · see citing works
EvoPrompting: Language Models for Code-Level Neural Architecture Search
Chen, A., Dohan, D., & So, D. (2023) · neural information processing systems · doi:10.52202/075280-0342 · Cited by 45 · see citing works
Theory of Evolution Strategies: A New Perspective
Auger, A., & Hansen, N. (2011) · Series on Theoretical Computer Science · doi:10.1142/9789814282673_0010 · Cited by 42 · see citing works
Theory of Estimation-of-Distribution Algorithms
Krejca, M. S., & Witt, C. (2019) · Natural computing series · doi:10.1007/978-3-030-29414-4_9 · Cited by 39 · see citing works
Markov Networks in Evolutionary Computation
Shakya, S. K., & Santana, R. (2012) · Adaptation, learning, and optimization · doi:10.1007/978-3-642-28900-2 · Cited by 38 · see citing works
Evaluate & Evaluation on the Hub: Better Best Practices for Data and Model MeasurementsPreprint
von Werra, L., Tunstall, L., Thakur, A., et al. (2022) · Conference on Empirical Methods in Natural Language Processing · doi:10.48550/arxiv.2210.01970 · Cited by 38 · see citing works
R2-D2: A Modular Baseline for Open-Domain Question Answering
Fajcik, M., Docekal, M., Ondrej, K., & Smrz, P. (2021) · Findings of the Association for Computational Linguistics: EMNLP 2021 · doi:10.18653/v1/2021.findings-emnlp.73 · Cited by 36 · see citing works
Differentiable Quality DiversityPreprint
Fontaine, M. C., & Nikolaidis, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.03894 · Cited by 34 · see citing works
Handbook of Evolutionary Machine Learning
Banzhaf, W., Machado, P., & Zhang, M. (2023) · Genetic and evolutionary computation · doi:10.1007/978-981-99-3814-8 · Cited by 34 · see citing works
Policy manifold search: exploring the manifold hypothesis for diversity-based neuroevolution
Rakicevic, N., Cully, A., & Kormushev, P. (2021) · Proceedings of the Genetic and Evolutionary Computation Conference · doi:10.1145/3449639.3459320 · Cited by 32 · see citing works
Promptbreeder: Self-Referential Self-Improvement via Prompt Evolution
Fernando, C., Banarse, D., Michalewski, H., Osindero, S., & Rocktäschel, T. (2023) · arXiv · doi:10.48550/arxiv.2309.16797 · Cited by 31 · see citing works
NoMAD-Attention: Efficient LLM Inference on CPUs Through Multiply-add-free AttentionPreprint
Zhang, T.-Y., Yi, J., Yao, B., Xu, Z., & Shrivastava, A. (2024) · Neural Information Processing Systems · doi:10.48550/arxiv.2403.01273 · Cited by 26 · see citing works
MarioGPT: Open-Ended Text2Level Generation through Large Language ModelsPreprint
Sudhakaran, S., González-Duque, M., Glanois, C., et al. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2302.05981 · Cited by 25 · see citing works
Large Language Model for Multi-objective Evolutionary OptimizationPreprint
Liu, F., Lin, X., Wang, Z., et al. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2310.12541 · Cited by 21 · see citing works
The OpenELM Library: Leveraging Progress in Language Models for Novel Evolutionary Algorithms
Bradley, H., Fan, H., Galanos, T., Zhou, R., Scott, D., & Lehman, J. (2024) · Genetic and Evolutionary Computation · doi:10.1007/978-981-99-8413-8_10 · Cited by 19 · see citing works
Self-citationA Review of Estimation of Distribution Algorithms and Markov Networks
Shakya, S. K., & Santana, R. (2012) · Adaptation, learning, and optimization · doi:10.1007/978-3-642-28900-2_2 · Cited by 17 · see citing works
Garciarena, U., Santana, R., & Mendiburu, A. (2018) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/3205455.3205645 · Cited by 16 · see citing works
Algorithm Evolution Using Large Language ModelPreprint
Liu, F., Tong, X., Yuan, M., et al. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2311.15249 · Cited by 15 · see citing works
Learning an evolvable genotype-phenotype mapping
Moreno, M. A., Banzhaf, W., & Ofria, C. (2018) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/3205455.3205597 · Cited by 14 · see citing works
Mutation Models: Learning to Generate Levels by Imitating Evolution
Khalifa, A., Togelius, J., & Green, M. C. (2022) · International Conference on the Foundations of Digital Games (FDG) · doi:10.1145/3555858.3563267 · Cited by 13 · see citing works
Learning To Retrieve Prompts for In-Context LearningPreprint
Rubin, O., Herzig, J., & Berant, J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2112.08633 · Cited by 11 · see citing works
Efficient LLM Inference on CPUsPreprint
Shen, H., Chang, H., Dong, B., et al. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2311.00502 · Cited by 11 · see citing works
Denoising Autoencoders for Fast Combinatorial Black Box Optimization
Probst, M. (2015) · doi:10.1145/2739482.2764691 · Cited by 10 · see citing works
Estimation of Distribution using Population Queue based Variational Autoencoders
Bhattacharjee, S., & Gras, R. (2019) · 2019 IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2019.8790077 · Cited by 7 · see citing works
Using Denoising Autoencoder Genetic Programming to Control Exploration and Exploitation in Search
Wittenberg, D. (2022) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-02056-8_7 · Cited by 7 · see citing works
A Denoising Autoencoder that Guides Stochastic SearchPreprint
Churchill, A. W., Sigtia, S., & Fernando, C. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1404.1614 · Cited by 6 · see citing works
GSR: A Generalized Symbolic Regression ApproachPreprint
Tohme, T., Liu, D., & Youcef‐Toumi, K. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2205.15569 · Cited by 6 · see citing works
Looped Transformers as Programmable ComputersPreprint
Giannou, A., Rajput, S., Sohn, J.-Y., Lee, K., Lee, J. D., & Papailiopoulos, D. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2301.13196 · Cited by 5 · see citing works
Meyerson, E., Qiu, X., & Miikkulainen, R. P. (2022) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/3512290.3528746 · Cited by 4 · see citing works
Self-citationBERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2018) · arXiv · doi:10.48550/arxiv.1810.04805
Flagged first, then by citations
Research works printed but not linked: 28
- 10.5555/865123 · DOI
- Peter J. Bentley, Soo Ling Lim, Adam Gaier, and Linh Tran. 2022. Evolving through the looking glass: Learning improved search spaces with variational autoencoders. In Proceedings of the International Conference on Parallel Problem Solving from Nature. Springer, 371–384.
- Stella Biderman, Hailey Schoelkopf, Quentin Gregory Anthony, Herbie Bradley, Kyle O’Brien, Eric Hallahan, Mohammad Aflah Khan, Shivanshu Purohit, U. S. V. S. N. Sai Prashanth, Edward Raff, Aviya Skowron, Lintang Sutawika, and Oskar van der Wal. 2023. Pythia: A suite for analyzing large language models across training and scaling. In Proceedings of the International Conference on Machine Learning. PMLR, 2397–2430.
- Herbie Bradley, Andrew Dai, Hannah Benita Teufel, Jenny Zhang, Koen Oostermeijer, Marco Bellagente, Jeff Clune, Kenneth Stanley, Gregory Schott, and Joel Lehman. 2024a. Quality-diversity through AI feedback. In Proceedings of the the 12th International Conference on Learning Representations. ICLR.
- Tom Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared D. Kaplan, Prafulla Dhariwal, Arvind Neelakantan, Pranav Shyam, Girish Sastry, Amanda Askell, et al. 2020. Language models are few-shot learners. Advances in Neural Information Processing Systems 33 (2020), 1877–1901.
- Stephanie C. Y. Chan, Adam Santoro, Andrew K. Lampinen, Jane X. Wang, Aaditya Singh, Pierre H. Richemond, Jay McClelland, and Felix Hill. 2022. Data distributional properties drive emergent few-shot learning in transformers. In Proceedings of the Conference on Neural Information Processing Systems (NeurIPS), 18878–18891.
- Qi Chen, Bing Xue, and Mengjie Zhang. 2015. Generalisation and domain adaptation in GP with gradient descent for symbolic regression. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC). IEEE, 1137–1144.
- Benjamin Doerr and Anne Auger. 2011. Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific Singapore. DOI: https://cds.cern.ch/record/1413962
- David E. Goldberg andJon Richardson. 1987. Genetic algorithms with sharing for multimodal function optimization. In Genetic Algorithms and Their Applications: Proceedings of the Second International Conference on Genetic Algorithms. Hillsdale, NJ: Lawrence Erlbaum, 41–49.
- Pierre-Alexandre Kamienny, Stéphane d’Ascoli, Guillaume Lample, and Francois Charton. 2022. End-to-end symbolic regression with transformers. In Proceedings of the Advances in Neural Information Processing Systems, 10269–10281.
- William La Cava Patryk Orzechowski Bogdan Burlacu Fabricio Olivetti de Franca Marco Virgolin Ying Jin Michael Kommenda and Jason H. Moore. 2021. Contemporary symbolic regression methods and their relative performance. In Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks. J. Vanschoren and S. Yeung (Eds.). Retrieved from https://datasets-benchmarks-proceedings.neurips.cc/paper_files/paper/2021/file/c0c7c76d30bd3dcaefc96f40275bdc0a-Paper-round1.pdf
- Joel Lehman and Kenneth O. Stanley. 2011b. Evolving a diversity of virtual creatures through novelty search and local competition. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), 211–218.
- Vadim Liventsev, Anastasiia Grishina, Aki Härmä, and Leon Moonen. 2023. Fully autonomous programming with large language models. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), ACM.
- Samir W. Mahfoud. 1995. Niching Methods for Genetic Algorithms. Ph.D. Dissertation. University of Illinois at Urbana-Champaign.
- James McDermott, David R. White, Sean Luke, Luca Manzoni, Mauro Castelli, Leonardo Vanneschi, Wojciech Jaskowski, Krzysztof Krawiec, Robin Harper, Kenneth De Jong, et al. 2012. Genetic programming needs better benchmarks. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), 791–798.
- Elliot Meyerson Mark J. Nelson Herbie Bradley Adam Gaier Arash Moradi Amy K. Hoover and Joel Lehman. 2023. Language model crossover: Variation through few-shot prompting. arXiv:2302.12170. Retrieved from https://arxiv.org/abs/2302.12170 · arXiv
- 10.5555/645823.670694 · DOI
- Jonas Oppenlaender. 2023. A taxonomy of prompt modifiers for text-to-image generation. Behaviour & Information Technology (2023).
- Martin Pelikan, David E. Goldberg, and Erick Cantú-Paz. 1999. BOA: The Bayesian optimization algorithm. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), Vol. 1, 525–532.
- Brenden K. Petersen, Mikel Landajuela Larma, Terrell N. Mundhenk, Claudio Prata Santiago, Soo Kyung Kim, and Joanne Taery Kim. 2021. Deep symbolic regression: Recovering mathematical expressions from data via risk-seeking policy gradients. In Proceedings of the International Conference on Learning Representations. ICLR.
- 10.5555/3455716.3455794 · DOI
- Alec Radford, Jong Wook Kim, Chris Hallacy, Aditya Ramesh, Gabriel Goh, Sandhini Agarwal, Girish Sastry, Amanda Askell, Pamela Mishkin, Jack Clark, Gretchen Krueger, and Ilya Sutskever. 2021. Learning transferable visual models from natural language supervision. In Proceedings of the 38th International Conference on Machine Learning, 8748–8763.
- Aditya Ramesh, Mikhail Pavlov, Gabriel Goh, Scott Gray, Chelsea Voss, Alec Radford, Mark Chen, and Ilya Sutskever. 2021. Zero-shot text-to-image generation. In Proceedings of the International Conference on Machine Learning. PMLR, 8821–8831.
- Robin Rombach, Andreas Blattmann, Dominik Lorenz, Patrick Esser, and Björn Ommer. 2022. High-resolution image synthesis with latent diffusion models. In Proceedings of the Computer Vision and Pattern Recognition Conference, 10684–10695.
- Paul Szerlip and Kenneth Stanley. 2013. Indirectly encoded sodarace for artificial life. In Proceedings of the 12th European Conference on Artificial Life (ECAL ’13). MIT Press, 218–225.
- David Wittenberg, Franz Rothlauf, and Dirk Schweim. 2020. DAE-GP: Denoising autoencoder LSTM networks as probabilistic models in estimation of distribution genetic programming. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), 1037–1045.
- Sang Michael Xie, Aditi Raghunathan, Percy Liang, and Tengyu Ma. 2022. An explanation of in-context learning as implicit Bayesian inference. In Proceedings of the International Conference on Learning Representations (ICLR). ICLR.
- Chulhee Yun, Srinadh Bhojanapalli, Ankit Singh Rawat, Sashank Reddi, and Sanjiv Kumar. 2019. Are Transformers universal approximators of sequence-to-sequence functions? In Proceedings of the International Conference on Learning Representations (ICLR). ICLR.
Cited by
Sorted by citations
Mathematical discoveries from program search with large language models
Romera-Paredes, B., Barekatain, M., Novikov, A., Balog, M., Kumar, M. P., Dupont, E., Ruiz, F. J. R., Ellenberg, J. S., Wang, P., Fawzi, O., et al. (2024) · Nature · doi:10.1038/s41586-023-06924-6 · Cited by 544 · see citing works
“To surpass the ‘nominal’ capabilities of LLMs, recent studies 3 have combined them with evolutionary algorithms 14,15 , leading to important improvements on diverse synthetic problems 16 , searching for neural network architectures 17–19 and solving puzzles 20 .”
BackgroundKorzynski, P., Mazurek, G., Krzypkowska, P., & Kurasinski, A. (2023) · Entrepreneurial Business and Economics Review · doi:10.15678/eber.2023.110302 · Cited by 235 · see citing works
Evolutionary Computation in the Era of Large Language Model: Survey and Roadmap
Wu, X., Wu, S.-H., Wu, J., Feng, L., & Tan, K. C. (2024) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2024.3506731 · Cited by 177 · see citing works
When large language model meets optimization
Huang, S., Yang, K., Qi, S., & Wang, R. (2024) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2024.101663 · Cited by 75 · see citing works
Evolving code with a large language model
Hemberg, E., Moskal, S., & O’Reilly, U.-M. (2024) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-024-09494-2 · Cited by 57 · see citing works
Large Language Models As Evolution Strategies
Lange, R. T., Tian, Y., & Tang, Y. (2024) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3638530.3654238 · Cited by 52 · see citing works
Large language models as surrogate models in evolutionary algorithms: A preliminary study
Hao, H., Zhang, X., & Zhou, A. (2024) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2024.101741 · Cited by 45 · see citing works
Large Language Model for Multiobjective Evolutionary Optimization
Liu, F., Lin, X., Yao, S., Wang, Z., Tong, X., Yuan, M., & Zhang, Q. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-3538-2_13 · Cited by 35 · see citing works
Tailoring Education with GenAI: A New Horizon in Lesson Planning
Karpouzis, K. C., Pantazatos, D., Taouki, J., & Meli, K. (2024) · IEEE Global Engineering Education Conference (EDUCON) · doi:10.1109/educon60312.2024.10578690 · Cited by 31 · see citing works
When Large Language Models Meet Evolutionary Algorithms: Potential Enhancements and Challenges
Wang, C., Zhao, J., Jiao, L., Li, L., Liu, F., & Yang, S. (2025) · Research · doi:10.34133/research.0646 · Cited by 38 · see citing works
Suzuki, R., & Arita, T. (2024) · Scientific Reports · doi:10.1038/s41598-024-55903-y · Cited by 26 · see citing works
Lü, J., Song, Z., Zhao, Q., Du, Y., Cao, Y., Jia, H., & Duan, C. (2025) · Journal of the American Chemical Society · doi:10.1021/jacs.5c02097 · Cited by 36 · see citing works
Huang, Y., Zhang, W., Feng, L., Wu, X., & Tan, K. C. (2025) · doi:10.1109/mcii64973.2025.11032980 · Cited by 22 · see citing works
Evolutionary Multi-objective Optimization of Large Language Model Prompts for Balancing Sentiments
Baumann, J., & Krämer, O. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-56855-8_13 · Cited by 25 · see citing works
Evaluation of Large Language Models as Solution Generators in Complex Optimization
Huang, B., Wu, X., Zhou, Y. F., Wu, J., Feng, L., Cheng, R., & Tan, K. C. (2025) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2025.3580520 · Cited by 28 · see citing works
Zhang, R., Liu, F., Lin, X., Wang, Z., Lu, Z., & Zhang, Q. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-70068-2_12 · Cited by 15 · see citing works
Zhao, J., Wen, T., & Cheong, K. H. (2025) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2025.3592367 · Cited by 13 · see citing works
Tailoring Education with GenAI: A New Horizon in Lesson PlanningPreprint
Karpouzis, K. C., Pantazatos, D., Taouki, J., & Meli, K. (2024) · doi:10.31219/osf.io/9b4su · Cited by 13 · see citing works
The First ChatGPT4PCG Competition
Abdullah, F., Taveekitworachai, P., Dewantoro, M. F., Thawonmas, R., Togelius, J., & Renz, J. (2024) · IEEE Transactions on Games · doi:10.1109/tg.2024.3376429 · Cited by 9 · see citing works
Automated Design of Agentic Systems
Hu, S., Lu, C., & Clune, J. (2024) · arXiv · doi:10.48550/arxiv.2408.08435 · Cited by 10 · see citing works
“We compared against five state-of-the-art hand-designed agents: (1) Chain-of-Thought (COT, Wei et al. (2022)), which instructs the agent to output the reasoning before answering to improve complex problem-solving through intermediate steps; (2) Self-Consistency with Chain-of-Thought (COT-SC, Wang et al. (2023b)), whic…”
Large Language Model Aided Multi-objective Evolutionary Algorithm: A Low-cost Adaptive Approach
Liu, W., Chen, L., & Tang, Z. (2026) · ACM Transactions on Evolutionary Learning and Optimization · doi:10.1145/3787965 · Cited by 7 · see citing works
Toxic Text Classification in Portuguese: Is LLaMA 3.1 8B All You Need?
de Oliveira, A. S., Silva, P., dos Santos, V. S., Moreira, G. J. P., Freitas, V. L. S., & Luz, E. J. D. S. (2024) · Simpósio Brasileiro de Tecnologia da Informação e da Linguagem Humana (STIL) · doi:10.5753/stil.2024.245416 · Cited by 7 · see citing works
BERT Mutation: Deep Transformer Model for Masked Uniform Mutation in Genetic Programming
Tov, E. S., Sipper, M., & Elyasaf, A. (2025) · Mathematics · doi:10.3390/math13050779 · Cited by 7 · see citing works
CoCoEvo: Co-Evolution of Programs and Test Cases to Enhance Code Generation
Li, K., Yuan, Y., Yu, H., Guo, T., & Cao, S. (2025) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2025.3593272 · Cited by 6 · see citing works
Large Language Model-Based Optimization for System-Level Test Program Generation
Schwachhofer, D., Domanski, P., Becker, S., Wagner, S., Sauer, M., Pflüger, D., & Polian, I. (2024) · Proceedings · doi:10.1109/dft63277.2024.10753556 · Cited by 6 · see citing works
STEP: A structured prompt optimization method for SCADA system tag generation using LLMs
Ma, F.-Y., Li, D., Liu, Y., Lan, D., & Pang, Z.-B. (2025) · Journal of Industrial Information Integration · doi:10.1016/j.jii.2025.100832 · Cited by 9 · see citing works
LAOS: Large Language Model-Driven Adaptive Operator Selection for Evolutionary Algorithms
Zhang, Y., & Yi, G. (2025) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/3712256.3726450 · Cited by 5 · see citing works
SCAPE: Searching Conceptual Architecture Prompts using Evolution
Lim, S. L., Bentley, P. J., & Ishikawa, F. (2024) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec60901.2024.10612168 · Cited by 5 · see citing works
From Manual to Automated Prompt Engineering: Evolving LLM Prompts with Genetic Algorithms
Loss, L. A., & Dhuvad, P. (2025) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec65147.2025.11043059 · Cited by 5 · see citing works
Generative Calibration for In-context Learning
Jiang, Z., Zhang, Y., Cao, L., Zhao, J., & Liu, K. (2023) · Findings of the Association for Computational Linguistics: EMNLP (Findings of EMNLP) · doi:10.18653/v1/2023.findings-emnlp.152 · Cited by 7 · see citing works
Survey of Genetic Programming and Large Language Models
Hemberg, E., Jorgensen, S., & O’Reilly, U.-M. (2025) · Genetic and evolutionary computation · doi:10.1007/978-981-96-0077-9_4 · Cited by 4 · see citing works
A Review of Surrogate-Assisted Evolutionary Multi-Objective Optimization
Wang, Q., Zhang, Y., Gong, D., Song, X., He, C., Ji, X., & Chu, F. (2026) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2026.3670690 · Cited by 3 · see citing works
Xie, L., Zhang, Y., Tang, Z., Chung, E., Li, G., & Wang, Z. (2025) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3711896.3736882 · Cited by 2 · see citing works
LEAR: LLM-Driven Evolution of Agent-Based Rules
Gurkan, C., Jwalapuram, N. K., Wang, K., Danda, R., Rasmussen, L., Chen, J., & Wilensky, U. J. (2025) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3712255.3734368 · Cited by 2 · see citing works
Large Language Model Driven Evolutionary Optimization Benchmark Generation Algorithm
Ono, Y., Harada, T., & Miura, Y. (2025) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3712255.3726663 · Cited by 2 · see citing works
LLM2TEA: An Agentic AI Designer for Discovery With Generative Evolutionary Multitasking
Wong, M., Liu, J., Rios, T., Menzel, S., & Ong, Y.-S. (2025) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2025.3592142 · Cited by 2 · see citing works
Exploring Large Language Models in Gamified Environments: A Systematic Literature Review
Leslie, L. G., Jali, N. B., Yahia, S. B., Shiang, C. W., & Junaini, S. N. (2025) · International Conference on Information Technology in Asia (CITA) · doi:10.1109/cita66455.2025.11198821 · Cited by 2 · see citing works
Diverse and high-quality text generation assisted by large language models
Nguyen, T. H., & Luong, N. (2025) · Knowledge-Based Systems · doi:10.1016/j.knosys.2025.114954 · Cited by 4 · see citing works
Evaluating Large Language Models for Time Series Anomaly Detection in Aerospace Software
Liu, Y., Luo, Y., Li, X., Dong, X., Gu, B., & Jin, Z. J. (2025) · IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1109/ase63991.2025.00291 · Cited by 2 · see citing works
Language Model Evolutionary Algorithms for Recommender Systems: Benchmarks and Algorithm Comparisons
Liu, J., Sun, Z., Feng, S., Chen, C., & Ong, Y.-S. (2025) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2025.3609058 · Cited by 2 · see citing works
Large Language Models as Surrogate Models in Evolutionary Algorithms: A Preliminary StudyPreprint
Hao, H., Zhang, X., & Zhou, A. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4870226 · Cited by 2 · see citing works
Leveraging LLM in Genetic Programming Hyper-heuristics for Dynamic Microservice Deployment
Fang, Z., Ma, H., Chen, G., Hartmann, S., & Wang, C. (2024) · Lecture notes in computer science · doi:10.1007/978-981-96-0348-0_7 · Cited by 1 · see citing works
An LLM-Based Genetic Algorithm for Prompt Engineering
Loss, L. A., & Dhuvad, P. (2025) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3712255.3726633 · Cited by 1 · see citing works
Bayesian optimization, machine learning, and probabilistic numerics
Archetti, F., Ponti, A., Candelieri, A., & Sabbatella, A. (2025) · AIP conference proceedings · doi:10.1063/5.0287470 · Cited by 1 · see citing works
Large Language Models Are Multitask Chain-of-Thought Prompting Optimizers
Jin, F., & Tan, Y. (2025) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2025.3644134 · Cited by 2 · see citing works
A Hybrid LLM-Coevolution Framework to Generate Abusive Tax Strategies
Bhattacharya, J. S., Hemberg, E., & O’Reilly, U.-M. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-23005-8_8 · Cited by 1 · see citing works
Rao, H., & Jia, H. (2026) · Applied Soft Computing · doi:10.1016/j.asoc.2026.115403 · Cited by 1 · see citing works
Using Large Language Models for Evolutionary Search
O’Reilly, U.-M., & Hemberg, E. (2024) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3638530.3648432 · Cited by 1 · see citing works
Towards an Open NLI LLM-based System for KGs: A Case Study of Wikidata
Ongris, J. G., Tjitrahardja, E., Darari, F., & Ekaputra, F. J. (2024) · International Seminar on Research of Information Technology and Intelligent Systems (ISRITI) · doi:10.1109/isriti64779.2024.10963661 · Cited by 1 · see citing works
Teodorescu, L. (2023) · theses.fr (ABES) · doi:10.70675/08e0bf33z987fz4ff6zbdd7zbf6cf87e81f0 · Cited by 1 · see citing works
ALOBED, M. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.7291548
Collaborative Product Innovation Model with Large Language Models and Agentic Systems
Alabastro, Z. M., Mansueto, S. D., & Ilagan, J. B. (2025) · Lecture notes in networks and systems · doi:10.1007/978-981-96-6938-7_23
LAPC: Large Language Model-Powered Adaptive Parameter Control for Evolutionary Algorithms
Zhang, Y., Yi, G., Wang, H., Cheng, Y. Q., Chen, Y., & Wei, Z. (2025) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn64981.2025.11228569
FELA: A Multi-Agent Evolutionary System for Feature Engineering of Industrial Event Log Data
Ouyang, K., Wang, H., & Fang, D. (2026) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde65706.2026.00292
Evolutionary Hybrid Optimization for Multi-Robot Task Allocation with LLM Guidance
Zhang, H., Xia, Z., Chen, S. L., Yin, H., & Zhang, F. (2025) · IEEE International Conference on Robotics and Biomimetics (ROBIO) · doi:10.1109/robio66223.2025.11376276
Guo, C., Wang, S., & Jiao, R. (2026) · Lecture notes in computer science · doi:10.1007/978-981-95-7072-0_6
Xu, L., Wang, S., Casseau, E., & Xiao, C. (2026) · ACM Transactions on Design Automation of Electronic Systems · doi:10.1145/3805806
Reinforcement Learning-Enabled LLM Surrogates in Evolutionary AlgorithmsPreprint
Hao, H., Lu, Y., & Zhou, A. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.6539762
EvoGens: A Population-Based Heuristic Search Framework for Scientific Idea GenerationPreprint
Li, X., Tu, H., Li, X., Zhao, K., Han, X., & Liu, Z. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.6614744
Lu, Z., Wang, H., Song, J., Tian, X., & Lin, A. (2026) · Expert Systems with Applications · doi:10.1016/j.eswa.2026.132589 · Cited by 1 · see citing works
KrakQL: LLM-Guided Blind Introspection of GraphQL Schemas
Maugeri, M., Angamo, A., & Giampaolo Bella, A. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-24839-8_2
An interactive modeling and solving method for operations research based on large language models
Chen, M., Qiu, T., Ma, H., Ai, X., Pu, Z., & Bao, J. (2026) · Scientia Sinica Technologica · doi:10.1360/sst-2025-0313
Mutation Without Variation: Convergence Dynamics in LLM-Driven Program Evolution
Gurkan, C., Stonedahl, F., & Wilensky, U. J. (2026) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3795101.3814735
Lehmacher, C., Kamasoglu, E., & Paetzold-Byhain, K. (2026) · Procedia CIRP · doi:10.1016/j.procir.2026.05.262
Zhu, Y., Wang, Y., & Yang, Q. (2026) · Lecture notes in electrical engineering · doi:10.1007/978-981-95-9287-6_19
Hierarchical Cognitive Regulation for Prompt Evolution in Large Language Models
Jiang, T., Ma, P., Qin, R., & Jiang, J. (2026) · International Conference on Machine Intelligence Theory and Applications (MiTA) · doi:10.1109/mita69365.2026.11582622
Iba, H., Batista, J. E., & Xu, J. (2026) · Natural computing series · doi:10.1007/978-981-95-8597-7_1
LLMs for Evolutionary Optimization
Iba, H., Batista, J. E., & Xu, J. (2026) · Natural computing series · doi:10.1007/978-981-95-8597-7_3
DEAL: Dual-Pool Evolutionary Algorithm with LLM-Driven Adaptive Operator Selection
Qi, T., Liu, Y., Yang, C., & Deng, W. (2026) · IEEE China Conference on System Simulation Technology and its Applications (CCSSTA) · doi:10.1109/ccssta69471.2026.11635455
Gamification Meets Large Language Models: A Systematic Review of Applications and Challenges
Jali, N. B., Leslie, L. G., Shiang, C. W., Yahia, S. B., & Junaini, S. N. (2026) · Acta Informatica Pragensia · doi:10.18267/j.aip.311
BERT Mutation for Genetic Algorithms: A Deep Transformer Operator
Tov, E. S., & Elyasaf, A. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-36217-9_16
Xu, G., Zhang, L., & Zhang, K. (2026) · Pattern Recognition · doi:10.1016/j.patcog.2026.114975
Zheng, Z., 林希軒, Xie, S., & Ding, S. (2026) · International Conference on Computer Application and Computer Graphics · doi:10.1145/3844212.3844235
Onomura, K., Araki, Y., Ono, Y., & Harada, T. (2026) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec69861.2026.11727230
Generate, Verify and Select: Evolutionary Fitness Shaping for Safe Clinical Text Generation
Subrahmanyam, B., Rao, A. S. K., Tiwari, S., & Choudhary, N. (2026) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec69861.2026.11727414
Predicting When LLMs Enhance Evolutionary Optimization: A Landscape-Aware Framework
Guo, D., Wu, J., & Yiu, S. (2026) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec69861.2026.11727144
- Authors
- Meyerson, E., Nelson, M. J., Bradley, H., Gaier, A., Moradi, A., Hoover, A. K., & Lehman, J.
- Affiliations
- Cognizant (India) (IN)
- American University (US)
- University of Cambridge (GB)
- Autodesk (United States) (US)
- New Jersey Institute of Technology (US)
- CarperAI, Providence, RI, USA
- ORCID
- Venue
- ACM Transactions on Evolutionary Learning and Optimization
- Published
- 2024-11-28
- Volume
- 4
- Issue
- 4
- Pages
- 1-40
- ISSN
- 2688-299X (ISSN-L)
- 2688-3007
- OpenAlex
- W4402270921
- Cited by
- 75
- References
- 91
- Citations by year
- 2026: 26 · 2025: 26 · 2024: 19 · 2023: 4
- FWCI
- 10.48
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- ACM Transactions on Evolutionary Learning and Optimization (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Science Foundation (1948017)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Evolutionary Algorithms and Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Keywords
- few-shot prompting, in-context learning, variation operators, evolutionary computation, genetic algorithm, code evolution, text-to-image prompts
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-05.
Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-05.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review