Cited by 76Evolutionary Algorithms and ApplicationsTopic ModelingMetaheuristic Optimization Algorithms Research

Language Model Crossover: Variation through Few-Shot Prompting

Open access
Meyerson, Elliot, Nelson, Mark J., Bradley, Herbie, Gaier, Adam, Moradi, Arash, Hoover, Amy K., Lehman, Joel·2024·ACM Transactions on Evolutionary Learning and Optimization

Published 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

Crossref · 10.1145/3694791

Cites

122 of 122 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

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
  • 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 data

    Experiments 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 claim
  • May combine two claims.

    Findingown data

    LMX 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 claim
  • May combine two claims.

    Findingown data

    Offspring 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 claim
  • May combine two claims.

    Findingown data

    In 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 claim
  • May combine two claims.

    Findingown data

    LMX 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 claim
  • May combine two claims.

    Findingown data

    The 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 claim
  • May combine two claims. The quote only partly states this claim.

    Findingown data

    In 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 claim
  • May combine two claims.

    Findingnone given

    LMX 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 claim
  • May combine two claims.

    Findingown data

    LMX produces competitive results and generates fit, parsimonious expressions.

    “LMX produces competitive results, generating fit and parsimonous expressions.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingown data

    Both 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 claim
  • May combine two claims.

    Findingown data

    LMX 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 data

    One-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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingnone given

    At 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 claim
  • May combine two claims.

    Findingown data

    Beginning 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 claim
  • May combine two claims.

    Findingown data

    There 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 claim
  • May combine two claims.

    Findingreasoning

    When 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 claim
  • May combine two claims.

    Findingown data

    LMX 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 claim
  • The quote only partly states this claim.

    Findingown data

    When 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingnone given

    The 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingnone given

    All 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.

    Findingcitation

    LMX 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 data

    As 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 claim
  • May combine two claims.

    Findingown data

    The 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 claim
  • May combine two claims.

    Findingnone given

    The 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingown data

    Preliminary 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 claim
  • May combine two claims.

    Findingown data

    In 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingown data

    The 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 claim
  • May combine two claims.

    Findingown data

    LMX 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 claim
  • May combine two claims.

    Findingown data

    For 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 claim
  • May combine two claims.

    Findingown data

    When 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 claim
  • May combine two claims.

    Findingnone given

    The 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 claim
  • May combine two claims.

    Findingown data

    LMX 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 claim
  • May combine two claims.

    Findingown data

    In 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).

    Findingnone given

    The 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingown data

    Running 5000 generations took around 100 hours.

    “Running 5000 generations took around 100hrs.”
    Quote in the paperNot a substantial claim
  • May combine two claims. The quote only partly states this claim.

    Findingown data

    The 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 claim
  • May combine two claims.

    Findingown data

    For 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 claim
  • May combine two claims.

    Findingown data

    One-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 claim
  • May combine two claims.

    Interpretationown data

    The 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 claim
  • May combine two claims.

    Interpretationreasoning

    LMX 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    LLMs 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.

    Premisecitation

    Performance 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.

    Premisecitation

    Variation 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).

    Interpretationreasoning

    The 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 claim
  • Probably not a substantial claim: may not pass S4 (based).

    Interpretationreasoning

    Few-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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).

    Interpretationnone given

    Such 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

    Premisecitation

    Autoencoders 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).

    Premisecitation

    Estimation 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.

    Premisereasoning

    Advanced 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).

    Interpretationnone given

    In 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 checked
    • cites [23]

      Not checked in the free run.

    • cites [29] source

      Not checked in the free run.

    • cites [1] source

      Not checked in the free run.

    • cites [5] source

      Not checked in the free run.

    • cites [121]

      Not checked in the free run.

  • May combine two claims.

    Interpretationnone given

    For 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).

    Interpretationnone given

    LMX 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

    Premisecitation

    The '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).

    Interpretationreasoning

    One 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 claim
  • May combine two claims.

    Interpretationown data

    LMX 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 claim
  • Classified as probably not a substantial claim.

    Study design and conductnone given

    Stable 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 claim
  • Probably not a substantial claim: may not pass S2 (checkable), S3 (load-bearing).

    Interpretationreasoning

    The 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.

    Premisecitation

    Stable 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.

    Premisecitation

    The 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.

    Premisecitation

    Sodarace 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 given

    Randomizing 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 claim
  • Probably not a substantial claim: may not pass S4 (based).

    Interpretationnone given

    By 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisenone given

    A 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 claim
  • Probably not a substantial claim: may not pass S4 (based).

    Interpretationreasoning

    The 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).

    Premisecitation

    An 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.

    Interpretationreasoning

    As 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Study design and conductreasoning

    Because 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 claim
  • May combine two claims.

    Interpretationreasoning

    As 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 claim
  • Probably not a substantial claim: may not pass S2 (checkable).

    Interpretationreasoning

    D_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 claim
  • May combine two claims.

    Interpretationreasoning

    LMX 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 claim
  • The quote only partly states this claim.

    Interpretationreasoning

    Theorem 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 claim
  • May combine two claims.

    Interpretationreasoning

    The 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 claim
  • May combine two claims.

    Interpretationreasoning

    The 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 claim
  • Probably not a substantial claim: may not pass S2 (checkable), S3 (load-bearing).

    Interpretationreasoning

    The 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 claim
  • May combine two claims.

    Interpretationcitation

    LMX 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 claim
  • May combine two claims.

    Premisecitation

    Existing 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.

    Interpretationreasoning

    EDAs 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Interpretationreasoning

    For 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).

    Interpretationreasoning

    LLM 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    Later 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).

    Premisecitation

    EAs 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.

    Interpretationcitation

    These 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    Subsequent 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 given

    Autoregressive 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 claim
  • May combine two claims.

    Interpretationreasoning

    An 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 claim
  • May combine two claims.

    Interpretationnone given

    The 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 given

    For 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Interpretationreasoning

    For 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).

    Interpretationreasoning

    LMX'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 claim
  • Probably not a substantial claim: may not pass S4 (based).

    Interpretationnone given

    LMX 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 claim
  • Classified as probably not a substantial claim.

    Interpretationreasoning

    If 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Interpretationown data

    LMX 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 claim
  • Probably not a substantial claim: may not pass S2 (checkable).

    Interpretationnone given

    LMX 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).

    Interpretationnone given

    The 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Interpretationreasoning

    The 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 claim
  • Classified as probably not a substantial claim.

    Interpretationnone given

    LMX 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Interpretationreasoning

    This 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 given

    Evolution 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Interpretationcitation

    Adding 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    Prior 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 conductreasoning

    In 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 claim
  • Classified as probably not a substantial claim. May combine two claims.

    Study design and conductown data

    To 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 claim
  • Classified as probably not a substantial claim. May combine two claims.

    Study design and conductreasoning

    The 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Interpretationreasoning

    For 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    The 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.

105 of 105
  • 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.”
12 of 12

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

    Minor

    Table 3 is labeled as a Homer Simpson result, but its starting sentence is the quote the paper attributes to Woody Allen.

  • Figure 10 is given incompatible normalization rules

    Minor

    The 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.

2 of 2

Cites

1 retracted

Flagged first, then by citations

Research works printed but not linked: 28

  1. 10.5555/865123 · DOI
  2. 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.
  3. 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.
  4. 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.
  5. 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.
  6. 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.
  7. 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.
  8. 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
  9. 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.
  10. 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.
  11. 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
  12. 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.
  13. 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.
  14. Samir W. Mahfoud. 1995. Niching Methods for Genetic Algorithms. Ph.D. Dissertation. University of Illinois at Urbana-Champaign.
  15. 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.
  16. 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
  17. 10.5555/645823.670694 · DOI
  18. Jonas Oppenlaender. 2023. A taxonomy of prompt modifiers for text-to-image generation. Behaviour & Information Technology (2023).
  19. 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.
  20. 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.
  21. 10.5555/3455716.3455794 · DOI
  22. 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.
  23. 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.
  24. 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.
  25. 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.
  26. 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.
  27. 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.
  28. 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

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
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
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