Pith. sign in

REVIEW 4 major objections 4 minor 120 references

Heuristically Adaptive Diffusion-Model Evolutionary Strategy

T0 review · 4 major / 4 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A diffusion model retrained each generation adapts faster than CMA-ES in changing fitness landscapes.

desk verdict Novel online diffusion-based EA with useful conditioning; needs to prove the tilted-sampling mechanism and resolve an elitism contradiction before the empirical claims land. read the letter →

arxiv 2411.13420 v1 pith:3BGHV4PL submitted 2024-11-20 cs.NE cs.AIcs.LG

Benedikt Hartl , Yanbo Zhang , Hananel Hazan , Michael Levin This is my paper · ORCID
classification cs.NEcs.AIcs.LG MSC 68T0790C59
keywords diffusionmodelsevolutionaryalgorithmsblack-boxoptimizationclassifier-freeguidancepopulationdiversityonlinetrainingcart-polecontrolepigeneticmemory
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper argues that a denoising diffusion model, retrained online on each generation's fitness-weighted population history, can act as the reproductive operator inside an evolutionary algorithm. If true, evolutionary search gains a flexible memory of past elites and can sample offspring from high-fitness regions while keeping diversity. The authors also claim that classifier-free conditioning lets the same search be steered toward target genotypic or phenotypic traits without modifying the fitness function. They test this on alternating double-peak and Rastrigin landscapes and on evolving neural-network cart-pole controllers.

What carries the argument

The load-bearing mechanism is the fitness-weighted denoising objective, in which the standard diffusion training loss is multiplied by a fitness-derived weight so that high-fitness genomes dominate training and the sampler is claimed to draw from a tilted distribution over genomes. Around this sit the DDIM denoising trajectory used to generate offspring, the memory buffer of past elites that accumulates across generations, and classifier-free guidance, a conditioning scheme in which the network is trained with and without a condition so that sampling can be interpolated toward a target trait. Replacing the diffusion model with a multivariate Gaussian in the algorithm would recover CMA-ES, making the diffusion model the precise object that changes the search dynamics.

What would settle it

On a synthetic landscape with a known sampling distribution, train HADES for a few generations, draw a large batch of offspring, and compare the empirical offspring distribution against the fitness-tilted distribution using a two-sample or density-ratio test; if they diverge, or if setting the fitness weight to a constant produces the same gains, the central mechanism is not doing the work.

Watch

Extended reading notes

Core claim

The central claim is that diffusion models are not only pretrained samplers for optimization but can be trained online as reproductive engines inside an evolutionary loop. HADES, the Heuristically Adaptive Diffusion-Model Evolutionary Strategy, maintains a buffer of past genomes with fitness weights and retrains a diffusion model after every generation, so sampling the next population favours high-fitness regions while retaining explorative diversity. The conditional variant CHARLES-D, Conditional Heuristically-Adaptive ReguLarized Evolutionary Strategy through Diffusion, appends feature vectors such as parameter-space quadrant, fitness, diversity, or measured behavior to each genome during training and uses classifier-free guidance during sampling, which lets offspring be directed toward a target trait without altering the objective. The paper reports faster adaptation to alternating peaks than CMA-ES, reliable identification of multiple Rastrigin optima, and cart-pole agents that balance the pole at commanded resting positions.

Load-bearing premise

The weighted training really reshapes what the diffusion model generates, tilting it toward high-fitness regions in a way that generalizes beyond the stored elites rather than simply replaying them.

Editorial extensions

If this is right

  • If the claim holds, online diffusion reproduction gives evolutionary algorithms a way to track changing environments, following an oscillating double-peak objective instead of remaining stuck at a stale optimum.
  • Conditional sampling would make multi-objective or constrained search possible without reward shaping, since conditions are trained separately from the fitness score.
  • The memory buffer allows past good regions to be revisited quickly, producing near-instant migration between peaks when the target condition switches.
  • Novelty conditioning can maintain population diversity and discover multiple optima simultaneously; on the Rastrigin task about 75 percent of the target peaks were found on average.
  • On neural-network cart-pole controllers, conditionally evolved lineages produce agents whose resting position is steered by the condition while fitness stays high.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A direct test of the weighted-loss mechanism would separate the method's claimed tilt toward high-fitness regions from mere resampling of stored elites; if the tilt is real, smaller buffers should still produce the reported gains.
  • Because the condition function need not be differentiable, the same machinery could steer evolution by expensive or black-box phenotypic measurements in higher-dimensional control and design tasks.
  • Since the diffusion model is retrained each generation, a practical extension would be to update it incrementally, preserving the memory effect at lower computational cost than full retraining.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The paper proposes HADES, an evolutionary strategy that uses a diffusion model trained online on a fitness-weighted buffer of previously evaluated genotypes as a generative model for offspring, and CHARLES-D, an extension that adds classifier-free guidance to condition offspring sampling on desired traits. The method is evaluated on two-dimensional benchmark landscapes (double-peak, Rastrigin, twisted Rastrigin) and on a cart-pole reinforcement learning task, with comparisons against CMA-ES and a simple genetic algorithm. The central claim is that iteratively retraining a diffusion model on heuristically acquired, fitness-weighted data yields a reproductive operator with enhanced adaptability, memory, and conditional control relative to classical Gaussian-model EAs.

Significance. If the claimed mechanism holds, the paper offers a substantial conceptual and algorithmic contribution: it replaces the hand-designed generative model of classical evolution strategies with a trainable, memory-augmented diffusion model, and it demonstrates a form of multi-objective control via conditioning that does not modify the fitness function. The empirical demonstrations are in external simulators (double-peak, Rastrigin, cart-pole), the method is not pretrained on external data, and the simulation details are reported in sufficient detail to reproduce the experiments. However, the significance is currently tempered by two issues: the load-bearing distributional claim after Eq. (5) is stated without proof or direct test, and the contribution of the diffusion model versus auxiliary mutation, crossover, and buffer mechanisms is not disentangled. The conditional control results, especially the cart-pole experiments, are interesting and motivate further investigation, but they do not by themselves validate the proposed sampling mechanism.

major comments (4)
  1. [§2.2, Eq. (5)] The statement after Eq. (5) that minimizing L_evo makes sampled data follow x0 ~ h[f(x0)] p_g(x0) is only correct in the ideal limit of score matching on the empirical distribution of the current buffer. The paper does not establish or empirically test that the learned score extrapolates to place probability mass on genuinely new, higher-fitness regions outside the buffer's support. Since the reported fitness improvements are attributed to this tilted-sampling mechanism, the authors should either provide a theoretical argument for why extrapolation occurs, or directly test it, e.g., by comparing the DM's output distribution to h[f]p_g on a known landscape, or by measuring the fraction of offspring whose fitness exceeds the current buffer maximum and are not near any buffer point. Without such evidence, the observed gains could be explained by fitness-weighted resampling of existing elites combined with the explicit mutation and crossover operations in Algorithm 1, which would reduce the diffusion model to a stochastic resampler and weaken the paper's central claim.
  2. [§3.7 vs. Appendix A.2] There is a direct contradiction about the use of elitism. Section 3.7 states 'Notably, every implementation utilizes elitism,' while Appendix A.2 states 'Notably, we do not use elitism in our approach, but use elite solutions to sharpen different selection criteria.' This contradiction must be resolved because it affects the interpretation of the convergence curves in Fig. 7 and the comparisons with CMA-ES and SimpleGA. If elitism is used, the contribution of the diffusion model to the reported performance is unclear; if it is not used, the statement in §3.7 is simply wrong. The authors should clarify the exact selection procedure and, if elitism is present, perform an ablation to show that the benefit is not solely due to elite retention.
  3. [Appendix B, Table 2] The hyperparameters are tuned separately for each experiment (population size Np, buffer size ratio NB/Np, elite ratio Ne/Np, crossover ratio Nc/Np, mutation ratio N_mu/N_p, mutation scale t_mu/T, selection pressure s, weighting mode w, network sizes, learning rate, and epochs all differ across figures). No sensitivity analysis is provided, so it is unclear whether the reported improvements are robust to these choices or whether they arise from per-experiment tuning. At minimum, the authors should report a sensitivity analysis for the most critical parameters (selection pressure s, buffer size ratio, mutation ratio, and diffusion training budget), or state explicitly how the values were chosen and argue that the method is not overly sensitive.
  4. [§3.4 and Algorithm 1] The 'epigenetic memory' experiment in §3.4 uses a buffer of the past 5 generations while the conditioning alternates every 8 generations. Because the buffer retains older samples, the observed 'instantaneous repopulation' of the previously visited peak when the condition switches back may be due to direct retrieval of stored elite solutions from the buffer rather than to a generative memory encoded in the diffusion model. The authors should control for this by testing the same switching protocol with a buffer that contains only the current generation, and by ablating the buffer entirely (training the DM only on the latest population) to determine whether the rapid switching effect persists.
minor comments (4)
  1. [Abstract and Introduction] The paper contains extensive philosophical and biological framing (e.g., 'gene expressions rather than genomic parameters', the 'paradigm shift' paragraph in the Discussion) that is not directly supported by the experiments. This material lengthens the paper considerably and may distract from the algorithmic contributions; the authors should consider condensing it or moving it to a clearly marked speculative discussion.
  2. [Figure 6] Figure 6 is very dense, with eight panels, multiple solver configurations, insets, and color coding. It is difficult to read in a preprint format; the authors should consider splitting it into separate figures or increasing font sizes and clarifying the legend.
  3. [§2.2] The notation in Eq. (5) and the surrounding text conflates the weighting function h as a loss weight and as a probability density. The statement 'x0 ∼ h[f (x0)] pg(x0)' is an approximation; the precise statement is that the learned score approximates the score of the tilted empirical distribution q(x) ∝ h[f(x)] p_emp(x). Clarifying this would help readers understand the limits of the claim.
  4. [General] The text contains several typos and awkward phrasings, e.g., 'not all tasks crated equal' in §2.1, and inconsistent reference formatting such as 'Ref. 120' for the companion paper [Zhang et al., 2024]. A careful proofreading pass is recommended.

Circularity Check

1 steps flagged · score 2.0 of 10

No significant circularity: the benchmark results are external and self-contained; the only mild issue is a non-load-bearing self-citation of the authors' complementary 'diffusion models are evolutionary algorithms' preprint.

  1. other [Section 2.3, first paragraph (also echoed in Section 4 Discussion)]
    "In our complementary contribution [Zhang et al., 2024], we formally connect DMs to EAs and particularly demonstrate that the backward process in DMs can be viewed as an iterative evolutionary process across generations."

    This formal equivalence is imported from a preprint by the same four authors (Zhang, Hartl, Hazan, Levin), so the paper's framing premise is self-referential. However, the premise is motivational rather than computational: HADES/CHARLES-D performance is measured against external baselines (CMA-ES, SimpleGA, cart-pole) and against the actual fitness functions, and none of those comparisons requires the cited equivalence to be true. Thus this is a minor, non-load-bearing self-citation rather than a reduction of the paper's results to its own prior claim.

full rationale

The paper's central derivation is the fitness-weighted denoising loss (Eq. 5), which by construction makes the diffusion model sample from the tilted empirical distribution h[f]p_g of the current buffer. This is a definitional property of the method, not a separate prediction, and the paper does not present it as an independently derived result. All reported improvements are fitness trajectories measured on external benchmark environments (alternating double-peak, Rastrigin and twisted-Rastrigin, and the cart-pole simulator), so the core claims are self-contained against outside data rather than forced by a fitted parameter or by a cited uniqueness theorem. The only mild self-referential element is the repeated citation of the authors' own complementary preprint [Zhang et al., 2024] for the conceptual claim that diffusion models are evolutionary algorithms; this framing is used to motivate the approach but is not load-bearing for the empirical comparisons. The novelty-conditioning experiment also uses a diversity metric as the condition and reports diversity as an outcome, but the reported diversity is a different grid-entropy measure and the fitness results remain externally benchmarked, so this does not constitute a prediction that reduces by construction. Overall circularity is low.

Assumptions & free parameters 6 free parameters · 4 assumptions · 1 invented entities

The central claim is an empirical algorithm demonstration, so the free parameters are the hand-tuned hyperparameters in Table 2 and the design choices for fitness conditioning and novelty conditioning. The main unproved axiom is the weighted-sampling property of the diffusion loss. The only invented entity is the speculative DM-as-genome interpretation, which carries no independent evidence.

free parameters (6)
  • selection pressure s in fitness weighting h[fi;w] = s=5 (figs.4,5), s=10 (fig.3), s=12 (fig.6), s=18 (fig.7B,C)
    Controls how sharply high-fitness samples are up-weighted in the diffusion training loss (Eq. 8); central to the convergence-exploration balance and tuned per benchmark.
  • weight normalization choice w in h[fi;w] = wN=1 for figs.3-5 and 7B,C; wf for figs.6 and 7D
    Chooses between normalized and absolute fitness weights, changing the effective training distribution; hand-set per experiment.
  • buffer size ratio NB/Np = 1 (fig.3), 3 (figs.4,5), 10 (fig.6), 4 (fig.7B,C), 16 (fig.7D)
    Number of past generations cached for DM training; determines memory capacity and is tuned per task.
  • target fitness distribution for fitness conditioning = Fisher: c(TF) ~ mu_f + |N(0, sigma_f)|; Greedy: c(TG) ~ N(fmax, sigma_f)
    Heuristic rule for setting the fitness condition each generation (Section 3.5); not derived from the objective.
  • novelty Boltzmann inverse temperature beta = beta=10 (fig.6)
    Scales the energy in the Boltzmann distribution over diversity targets (Appendix C); hand-chosen.
  • mutation scale t_mu/T and mutation ratio N_mu/N_p = t_mu/T=0.05-0.2, N_mu/N_p=0.1-1 depending on experiment (Table 2)
    Controls the diffusion-time mutation strength and fraction of offspring mutated; standard EA knobs tuned per benchmark.
assumptions (4)
  • standard math The DDPM/DDIM forward and reverse processes (Eqs. 1-4) are valid generative models for the buffer distribution.
    Background from Ho et al. (2020) and Song et al. (2020), cited in Section 2.2 and used throughout.
  • ad hoc to paper Minimizing the fitness-weighted denoising loss (Eq. 5) makes the DM sample from the tilted distribution h[f(x)] p_g(x).
    Stated after Eq. (5) without proof; this is the paper's core mechanism and is not a standard theorem. It is a heuristic assumption about weighted diffusion training.
  • standard math ANNs are universal function approximators, so the diffusion network can represent the needed density.
    Invoked in Section 4 via Hornik et al. (1989); standard but unproved in the paper.
  • domain assumption The fitness function evaluation and the behavioral metric (e.g., resting position in cart-pole) are reliable, noise-limited measures that the DM can learn from.
    The RL fitness is an average over 16 episodes (Section 3.7), and the DM's conditional training assumes the recorded conditions c_i are informative. For fig. 7E, the resting position is measured over episodes and assumed to be a stable phenotype.
invented entities (1)
  • Diffusion model as the 'lineage's evolving genome' / DM samples 'gene expressions' rather than genomic parameters
    purpose: Conceptual framing in Section 4 to argue biological plausibility and position the method as a DNA-like generative model with associative memory.
    This is an interpretive analogy with no falsifiable handle separate from the algorithm's behavior; it does not yield new testable predictions outside the optimization results.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Heuristically Adaptive Diffusion-Model Evolutionary Strategy." pith.science (2026). https://pith.science/paper/3BGHV4PL

@misc{pith2026241113420,
  author       = {Pith},
  title        = {Pith review of: Heuristically Adaptive Diffusion-Model Evolutionary Strategy},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/3BGHV4PL}},
  note         = {Machine review of arXiv:2411.13420}
}
read the original abstract

Diffusion Models represent a significant advancement in generative modeling, employing a dual-phase process that first degrades domain-specific information via Gaussian noise and restores it through a trainable model. This framework enables pure noise-to-data generation and modular reconstruction of, images or videos. Concurrently, evolutionary algorithms employ optimization methods inspired by biological principles to refine sets of numerical parameters encoding potential solutions to rugged objective functions. Our research reveals a fundamental connection between diffusion models and evolutionary algorithms through their shared underlying generative mechanisms: both methods generate high-quality samples via iterative refinement on random initial distributions. By employing deep learning-based diffusion models as generative models across diverse evolutionary tasks and iteratively refining diffusion models with heuristically acquired databases, we can iteratively sample potentially better-adapted offspring parameters, integrating them into successive generations of the diffusion model. This approach achieves efficient convergence toward high-fitness parameters while maintaining explorative diversity. Diffusion models introduce enhanced memory capabilities into evolutionary algorithms, retaining historical information across generations and leveraging subtle data correlations to generate refined samples. We elevate evolutionary algorithms from procedures with shallow heuristics to frameworks with deep memory. By deploying classifier-free guidance for conditional sampling at the parameter level, we achieve precise control over evolutionary search dynamics to further specific genotypical, phenotypical, or population-wide traits. Our framework marks a major heuristic and algorithmic transition, offering increased flexibility, precision, and control in evolutionary optimization processes.

Figures

Figures reproduced from arXiv: 2411.13420 by the authors.

Figure 1
Figure 1. (A) A schematic flow-chart of a typical evolutionary algorithm (gray arrows and labels) contrasted with our diffusion model (DM)-based evolutionary optimization(golden arrows and symbols, see also algorithm 1), showing an evolutionary process either utilizing population-based (gray) or an ANN-based DM (golden) as heuristically re￾fined generative model for offspring-genotype sampling. The DM-based EA’s generative mo… view at source ↗
Figure 2
Figure 2. Workflow of the CHARLES-D algorithm. Starting with a randomly initialized population (red circles), their fitness and features (shown in rounded blue rectangles) are evaluated. Next, a generative model G (yellow rectangles) is trained on this population, weighted by their fitness, with features used as conditioning for generation. Following training, externaltarget conditions are provided to generate a new populatio… view at source ↗
Figure 3
Figure 3. HADES adapts to dynamic (oscillatory) environmental changes. (A) Dynamically alternating double-peak fitness landscape ranging from fmin = −1 (black) through f0 = 0] to fmax = 1 (white) as defined by eq. (7). (B) Population data for HADES (blue) and CMA-ES [Hansen and Ostermeier, 2001] (red) optimization in the dynamically changing environment illustrated in (A). The 2D data points gi = (xi , yi) are represented as … view at source ↗
Figures from the paper (5 more)
Figure 4
Figure 4. Figure 4: Conditional evolutionary optimization to explore selected target parameter regions in two-dimensional [PITH_FULL_IMAGE:figures/full_fig_p011_4.png]
Figure 5
Figure 5. Figure 5: Dynamically Conditioning Genetic Parameters. (A) A static double-peak fitness landscape, ranging from [PITH_FULL_IMAGE:figures/full_fig_p013_5.png]
Figure 6
Figure 6. Figure 6: Fitness- and Novelty-Conditional Benchmarks for the Rastrigin ( [PITH_FULL_IMAGE:figures/full_fig_p015_6.png]
Figure 7
Figure 7. Figure 7: (A) Sketch of an ANN-based RL-agent controlling the cart in a cart-pole environment. (B). Training per￾formance of HADES, Fisher-conditional CHARLES-D, CMA-ES, and SimpleGA on the cart-pole task with different ANN architectures. The solid lines emphasize the mean maxim…
Figure 8
Figure 8. Figure 8: Fitness- and Diversity Benchmarks for the Double-Peak Task. ( [PITH_FULL_IMAGE:figures/full_fig_p031_8.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

120 extracted references · 43 canonical work pages

  1. [1]

    An Introduction to Systems Biology: Design Principles of Biological Circuits

    Uri Alon. An Introduction to Systems Biology: Design Principles of Biological Circuits. Chapman and Hall/ CRC , 0 edition, a . ISBN 978-0-429-09279-4. doi:10.1201/9781420011432. URL https://www.taylorfrancis.com/books/9781420011432

    arXiv

  2. [2]

    Network motifs: theory and experimental approaches

    Uri Alon. Network motifs: theory and experimental approaches. 8 0 (6): 0 450--461, b . ISSN 1471-0056. doi:10.1038/nrg2102

    doi:10.1038/nrg2102

  3. [3]

    Diffusion for world modeling: Visual details matter in atari, 2024

    Eloi Alonso, Adam Jelley, Vincent Micheli, Anssi Kanervisto, Amos Storkey, Tim Pearce, and François Fleuret. Diffusion for world modeling: Visual details matter in atari, 2024. URL https://arxiv.org/abs/2405.12399

    arXiv 2024

  4. [4]

    In search of dispersed memories: Generative diffusion models are associative memory networks, 2023

    Luca Ambrogioni. In search of dispersed memories: Generative diffusion models are associative memory networks, 2023

    2023

  5. [5]

    A new factor in evolution

    James Mark Baldwin. A new factor in evolution. Diacronia, pages 1--13, 2018

    2018

  6. [6]

    Neuronlike adaptive elements that can solve difficult learning control problems

    Andrew G Barto, Richard S Sutton, and Charles W Anderson. Neuronlike adaptive elements that can solve difficult learning control problems. IEEE transactions on systems, man, and cybernetics, pages 834--846, 1983

    1983

  7. [7]

    Curriculum learning

    Yoshua Bengio, J\' e r\^ o me Louradour, Ronan Collobert, and Jason Weston. Curriculum learning. In Proceedings of the 26th Annual International Conference on Machine Learning, ICML '09, page 41–48, New York, NY, USA, 2009. Association for Computing Machinery. ISBN 9781605585161. doi:10.1145/1553374.1553380. URL https://doi.org/10.1145/1553374.1553380

    arXiv 2009

  8. [8]

    Evolving through the looking glass: Learning improved search spaces with variational autoencoders

    Peter J Bentley, Soo Ling Lim, Adam Gaier, and Linh Tran. Evolving through the looking glass: Learning improved search spaces with variational autoencoders. In International Conference on Parallel Problem Solving from Nature, pages 371--384. Springer, 2022

    2022

Show all 120 references
  1. [9]

    Existential risk prevention as global priority

    Nick Bostrom. Existential risk prevention as global priority. Global Policy, 4 0 (1): 0 15--31, 2013. doi:https://doi.org/10.1111/1758-5899.12002. URL https://onlinelibrary.wiley.com/doi/abs/10.1111/1758-5899.12002

    2013

  2. [10]

    Video generation models as world simulators, 2024

    Tim Brooks, Bill Peebles, Connor Holmes, Will DePue, Yufei Guo, Li Jing, David Schnurr, Joe Taylor, Troy Luhman, Eric Luhman, et al. Video generation models as world simulators, 2024

    2024

  3. [11]

    Buckley, Tim Lewens, Michael Levin, Beren Millidge, Alexander Tschantz, and Richard A

    Christopher L. Buckley, Tim Lewens, Michael Levin, Beren Millidge, Alexander Tschantz, and Richard A. Watson. Natural induction: Spontaneous adaptive organisation without natural selection. Entropy, 26 0 (9), 2024. ISSN 1099-4300. doi:10.3390/e26090765. URL https://www.mdpi.co...

    2024 doi

  4. [12]

    What does it take to evolve behaviorally complex organisms? Biosystems, 69 0 (2): 0 245--262, 2003

    Raffaele Calabretta, Andrea Di Ferdinando, Günter P Wagner, and Domenico Parisi. What does it take to evolve behaviorally complex organisms? Biosystems, 69 0 (2): 0 245--262, 2003. ISSN 0303-2647. doi:https://doi.org/10.1016/S0303-2647(02)00140-5. URL https://www.sciencedirect...

    2003 doi

  5. [13]

    Deep optimisation: Transitioning the scale of evolutionary search by inducing and searching in deep representations

    Jamie Caldwell, Joshua Knowles, Christoph Thies, Filip Kubacki, and Richard Watson. Deep optimisation: Transitioning the scale of evolutionary search by inducing and searching in deep representations. SN Computer Science, 3 0 (3), April 2022. ISSN 2661-8907. doi:10.1007/s42979...

    2022 doi

  6. [14]

    Callen and Theodore A

    Herbert B. Callen and Theodore A. Welton. Irreversibility and generalized noise. Phys. Rev., 83: 0 34--40, Jul 1951. doi:10.1103/PhysRev.83.34. URL https://link.aps.org/doi/10.1103/PhysRev.83.34

    1951 doi

  7. [15]

    Neural network quine

    Oscar Chang and Hod Lipson. Neural network quine. In Artificial life conference proceedings, pages 234--241. MIT Press One Rogers Street, Cambridge, MA 02142-1209, USA journals-info …, 2018

    2018

  8. [16]

    Bayesian theories of conditioning in a changing world

    Aaron C Courville, Nathaniel D Daw, and David S Touretzky. Bayesian theories of conditioning in a changing world. Trends in cognitive sciences, 10 0 (7): 0 294--300, 2006

    2006

  9. [17]

    The origin of species, 1859-1959

    Charles Darwin. The origin of species, 1859-1959. Bios, 30 0 (2): 0 67--72, 1959

    1959

  10. [18]

    Davidson and Douglas H

    Eric H. Davidson and Douglas H. Erwin. Gene regulatory networks and the evolution of animal body plans. 311 0 (5762): 0 796--800. ISSN 1095-9203. doi:10.1126/science.1113832

    doi

  11. [19]

    The selfish gene

    Richard Dawkins. The selfish gene. Oxford university press, 2016

    2016

  12. [20]

    Peter Dayan and L. F. Abbott. Theoretical neuroscience: computational and mathematical modeling of neural systems. Computational neuroscience. Massachusetts Institute of Technology Press, 2001. ISBN 978-0-262-04199-7

    2001

  13. [21]

    Diffusion models beat gans on image synthesis

    Prafulla Dhariwal and Alexander Nichol. Diffusion models beat gans on image synthesis. In M. Ranzato, A. Beygelzimer, Y. Dauphin, P.S. Liang, and J. Wortman Vaughan, editors, Advances in Neural Information Processing Systems, volume 34, pages 8780--8794. Curran Associates, Inc...

    2021

  14. [22]

    Regulative development as a model for origin of life and artificial life studies

    Chris Fields and Michael Levin. Regulative development as a model for origin of life and artificial life studies. Biosystems, 229: 0 104927, 2023. ISSN 0303-2647. doi:https://doi.org/10.1016/j.biosystems.2023.104927. URL https://www.sciencedirect.com/science/article/pii/S03032...

    2023

  15. [23]

    The genetical theory of natural selection

    Ronald Aylmer Fisher. The genetical theory of natural selection. Clarendon Press, 1930. doi:10.5962/bhl.title.27468. URL http://dx.doi.org/10.5962/bhl.title.27468

    1930 doi

  16. [24]

    S. A. Frank. The common patterns of nature . Journal of Evolutionary Biology, 22 0 (8): 0 1563--1585, 08 2009. ISSN 1010-061X. doi:10.1111/j.1420-9101.2009.01775.x. URL https://doi.org/10.1111/j.1420-9101.2009.01775.x

    2009

  17. [25]

    Steven A. Frank. Maladaptation and the paradox of robustness in evolution. PLoS ONE, 2 0 (10): 0 e1021, October 2007. ISSN 1932-6203. doi:10.1371/journal.pone.0001021. URL http://dx.doi.org/10.1371/journal.pone.0001021

    2007 doi

  18. [26]

    Steven A. Frank. Evolution of robustness and cellular stochasticity of gene expression. PLoS Biology, 11 0 (6): 0 e1001578, June 2013. ISSN 1545-7885. doi:10.1371/journal.pbio.1001578. URL http://dx.doi.org/10.1371/journal.pbio.1001578

    2013 doi

  19. [27]

    Steven A. Frank. Measurement invariance explains the universal law of generalization for psychological perception. Proceedings of the National Academy of Sciences, 115 0 (39): 0 9803--9806, 2018. doi:10.1073/pnas.1809787115. URL https://www.pnas.org/doi/abs/10.1073/pnas.1809787115

    2018 doi

  20. [28]

    Steven A. Frank. Evolutionary design of regulatory control. ii. robust error-correcting feedback increases genetic and phenotypic variability. Journal of Theoretical Biology, 468: 0 72–81, May 2019. ISSN 0022-5193. doi:10.1016/j.jtbi.2019.02.012. URL http://dx.doi.org/10.1016/...

    2019 doi

  21. [29]

    Friedman, Axel Constant, V

    Karl Friston, Daniel A. Friedman, Axel Constant, V. Bleu Knight, Chris Fields, Thomas Parr, and John O. Campbell. A variational synthesis of evolutionary and developmental dynamics. Entropy, 25 0 (7), 2023. ISSN 1099-4300. doi:10.3390/e25070964. URL https://www.mdpi.com/1099-4...

    2023 doi

  22. [30]

    Discovering representations for black-box optimization

    Adam Gaier, Alexander Asteroth, and Jean-Baptiste Mouret. Discovering representations for black-box optimization. In Proceedings of the 2020 Genetic and Evolutionary Computation Conference, pages 103--111, 2020

    2020

  23. [31]

    Diego Garcia Castillo, Nick Barton, Rui Faria, Jenny Larsson, Sean Stankowski, Roger Butlin, Kerstin Johannesson, and Anja M. Westram. Predicting rapid adaptation in time from adaptation in space: A 30-year field experiment in marine snails. Science Advances, 10 0 (41), Octobe...

    2024 doi

  24. [32]

    Genetic algorithms in search, optimization, and machine learning

    David E Golberg. Genetic algorithms in search, optimization, and machine learning. Addion wesley, 1989 0 (102): 0 36, 1989

    1989

  25. [33]

    The road towards understanding embodied decisions

    Jeremy Gordon, Antonella Maselli, Gian Luca Lancia, Thomas Thiery, Paul Cisek, and Giovanni Pezzulo. The road towards understanding embodied decisions. Neuroscience & Biobehavioral Reviews, 131: 0 722--736, 2021. ISSN 0149-7634. doi:https://doi.org/10.1016/j.neubiorev.2021.09....

    2021 doi

  26. [34]

    Genetic algorithms and machine learning

    John J Grefenstette. Genetic algorithms and machine learning. In Proceedings of the sixth annual conference on Computational learning theory, pages 3--4, 1993

    1993

  27. [35]

    Evolving stable strategies

    David Ha. Evolving stable strategies. blog.otoro.net, 2017. URL http://blog.otoro.net/2017/11/12/evolving-stable-strategies/

    2017

  28. [36]

    Completely derandomized self-adaptation in evolution strategies

    Nikolaus Hansen and Andreas Ostermeier. Completely derandomized self-adaptation in evolution strategies. Evolutionary computation, 9 0 (2): 0 159--195, 2001

    2001

  29. [37]

    u bl, Gerhard Kahl, and Andreas Z\

    Benedikt Hartl, Maximilian H\" u bl, Gerhard Kahl, and Andreas Z\" o ttl. Microswimmers learning chemotaxis with genetic algorithms. Proceedings of the National Academy of Sciences, 118 0 (19), May 2021. ISSN 1091-6490. doi:10.1073/pnas.2019683118. URL http://dx.doi.org/10.107...

    2021 doi

  30. [38]

    Neuroevolution of decentralized decision-making in n-bead swimmers leads to scalable and robust collective locomotion, 2024 a

    Benedikt Hartl, Michael Levin, and Andreas Zöttl. Neuroevolution of decentralized decision-making in n-bead swimmers leads to scalable and robust collective locomotion, 2024 a . URL https://arxiv.org/abs/2407.09438

    2024 arXiv

  31. [39]

    Evolutionary implications of self-assembling cybernetic materials with collective problem-solving intelligence at multiple scales

    Benedikt Hartl, Sebastian Risi, and Michael Levin. Evolutionary implications of self-assembling cybernetic materials with collective problem-solving intelligence at multiple scales. Entropy, 26 0 (7): 0 532, 2024 b

    2024

  32. [40]

    Exploring the behavior of bioelectric circuits using evolution heuristic search

    Hananel Hazan and Michael Levin. Exploring the behavior of bioelectric circuits using evolution heuristic search. Bioelectricity, 4 0 (4): 0 207--227, 2022. doi:10.1089/bioe.2022.0033. URL https://doi.org/10.1089/bioe.2022.0033

    2022

  33. [41]

    D.O. Hebb. The Organization of Behavior. Wiley & Sons, New York, 1949

    1949

  34. [42]

    Higham, Desmond J

    Catherine F. Higham, Desmond J. Higham, and Peter Grindrod. Diffusion models for generative artificial intelligence: An introduction for applied mathematicians, 2023. URL https://arxiv.org/abs/2312.14977

    2023 arXiv

  35. [43]

    How learning can guide evolution

    Geoffrey E Hinton, Steven J Nowlan, et al. How learning can guide evolution. Complex systems, 1 0 (3): 0 495--502, 1987

    1987

  36. [44]

    Classifier-free diffusion guidance

    Jonathan Ho and Tim Salimans. Classifier-free diffusion guidance. arXiv preprint arXiv:2207.12598, 2022

    2022 arXiv

  37. [45]

    Denoising diffusion probabilistic models

    Jonathan Ho, Ajay Jain, and Pieter Abbeel. Denoising diffusion probabilistic models. Advances in neural information processing systems, 33: 0 6840--6851, 2020

    2020

  38. [46]

    Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence

    John H Holland. Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. MIT press, 1992

    1992

  39. [47]

    Emergence: From chaos to order

    John H Holland. Emergence: From chaos to order. OUP Oxford, 2000

    2000

  40. [48]

    Hopfield

    John J. Hopfield. Neural networks and physical systems with emergent collective computational abilities. Proceedings of the National Academy of Sciences, 79 0 (8): 0 2554--2558, 1982. doi:10.1073/pnas.79.8.2554. URL https://www.pnas.org/doi/abs/10.1073/pnas.79.8.2554

    1982 doi

  41. [49]

    Multilayer feedforward networks are universal approximators

    Kurt Hornik, Maxwell Stinchcombe, and Halbert White. Multilayer feedforward networks are universal approximators. Neural networks, 2 0 (5): 0 359--366, 1989

    1989

  42. [50]

    The evolutionary implications of epigenetic inheritance

    Eva Jablonka. The evolutionary implications of epigenetic inheritance. Interface Focus, 7: 0 20160135, 08 2017. doi:10.1098/rsfs.2016.0135

    2017

  43. [51]

    Transgenerational epigenetic inheritance: Prevalence, mechanisms, and implications for the study of heredity and evolution

    Eva Jablonka and Gal Raz. Transgenerational epigenetic inheritance: Prevalence, mechanisms, and implications for the study of heredity and evolution. The Quarterly Review of Biology, 84: 0 131--176, 06 2009. doi:10.1086/598822. URL http://www.blc.arizona.edu/courses/schaffer/4...

    2009 doi

  44. [52]

    Bioattractors: dynamical systems theory and the evolution of regulatory processes

    Johannes Jaeger and Nick Monk. Bioattractors: dynamical systems theory and the evolution of regulatory processes. 592 0 (11): 0 2267--2281. ISSN 1469-7793. doi:10.1113/jphysiol.2014.272385

    2014

  45. [53]

    John Jumper, Richard Evans, Alexander Pritzel, Tim Green, Michael Figurnov, Olaf Ronneberger, Kathryn Tunyasuvunakool, Russ Bates, Augustin Žídek, Anna Potapenko, Alex Bridgland, Clemens Meyer, Simon A. A. Kohl, Andrew J. Ballard, Andrew Cowie, Bernardino Romera-Paredes, Stani...

    2021

  46. [54]

    Eric R. Kandel. Principles of Neural Science, Fifth Edition. McGraw Hill Professional, 2013. ISBN 978-0-07-139011-8

    2013

  47. [55]

    A review on genetic algorithm: past, present, and future

    Sourabh Katoch, Sumit Singh Chauhan, and Vijay Kumar. A review on genetic algorithm: past, present, and future. Multimedia Tools and Applications, 80 0 (5): 0 8091–8126, October 2020. ISSN 1573-7721. doi:10.1007/s11042-020-10139-6. URL http://dx.doi.org/10.1007/s11042-020-10139-6

    2020 doi

  48. [56]

    S. A. Kauffman. Metabolic stability and epigenesis in randomly constructed genetic nets. 22 0 (3): 0 437--467. ISSN 0022-5193. doi:10.1016/0022-5193(69)90015-0. URL https://www.sciencedirect.com/science/article/pii/0022519369900150

  49. [57]

    Auto-encoding variational bayes

    Diederik P Kingma. Auto-encoding variational bayes. arXiv preprint arXiv:1312.6114, 2013

    2013 arXiv

  50. [58]

    How evolution learns to generalise: Using the principles of learning theory to understand the evolution of developmental organisation

    Kostas Kouvaris, Jeff Clune, Loizos Kounios, Markus Brede, and Richard A Watson. How evolution learns to generalise: Using the principles of learning theory to understand the evolution of developmental organisation. PLoS computational biology, 13 0 (4): 0 e1005358, 2017

    2017

  51. [59]

    Diffusion models for black-box optimization

    Siddarth Krishnamoorthy, Satvik Mehul Mashkaria, and Aditya Grover. Diffusion models for black-box optimization. In Andreas Krause, Emma Brunskill, Kyunghyun Cho, Barbara Engelhardt, Sivan Sabato, and Jonathan Scarlett, editors, Proceedings of the 40th International Conference...

    2023

  52. [60]

    Artificial life: An overview

    Christopher G Langton. Artificial life: An overview. Mit Press, 1997

    1997

  53. [61]

    Abandoning objectives: Evolution through the search for novelty alone

    Joel Lehman and Kenneth O Stanley. Abandoning objectives: Evolution through the search for novelty alone. Evolutionary computation, 19 0 (2): 0 189--223, 2011

    2011

  54. [62]

    Technological approach to mind everywhere: An experimentally-grounded framework for understanding diverse bodies and minds

    Michael Levin. Technological approach to mind everywhere: An experimentally-grounded framework for understanding diverse bodies and minds. 16. ISSN 1662-5137. doi:10.3389/fnsys.2022.768201. URL https://www.frontiersin.org/journals/systems-neuroscience/articles/10.3389/fnsys.20...

    2022

  55. [63]

    Technological approach to mind everywhere: an experimentally-grounded framework for understanding diverse bodies and minds

    Michael Levin. Technological approach to mind everywhere: an experimentally-grounded framework for understanding diverse bodies and minds. Frontiers in systems neuroscience, 16: 0 768201, 2022

    2022

  56. [64]

    Collective Intelligence of Morphogenesis as a Teleonomic Process

    Michael Levin. Collective Intelligence of Morphogenesis as a Teleonomic Process . In Evolution 'On Purpose': Teleonomy in Living Systems . The MIT Press, 08 2023 a . ISBN 9780262376013. doi:10.7551/mitpress/14642.003.0013. URL https://doi.org/10.7551/mitpress/14642.003.0013

    2023 doi

  57. [65]

    Darwin’s agential materials: evolutionary implications of multiscale competency in developmental biology

    Michael Levin. Darwin’s agential materials: evolutionary implications of multiscale competency in developmental biology. Cellular and Molecular Life Sciences, 80 0 (6): 0 142, 2023 b

    2023

  58. [66]

    Self-improvising memory: A perspective on memories as agential, dynamically reinterpreting cognitive glue

    Michael Levin. Self-improvising memory: A perspective on memories as agential, dynamically reinterpreting cognitive glue. Entropy, 26 0 (6), 2024. ISSN 1099-4300. doi:10.3390/e26060481. URL https://www.mdpi.com/1099-4300/26/6/481

    2024 doi

  59. [67]

    Davidson

    Michael Levine and Eric H. Davidson. Gene regulatory networks for development. 102 0 (14): 0 4936--4942. ISSN 0027-8424, 1091-6490. doi:10.1073/pnas.0408031102. URL https://pnas.org/doi/full/10.1073/pnas.0408031102

    doi

  60. [68]

    Neural-network-based cellular automata for simulating multiple land use changes using gis

    Xia Li and Anthony Gar-On Yeh. Neural-network-based cellular automata for simulating multiple land use changes using gis. Int. J. Geogr. Inf. Sci., 16 0 (4): 0 323--343, 2002. doi:10.1080/13658810210137004. URL https://doi.org/10.1080/13658810210137004

    2002 doi

  61. [69]

    Nonparametric k -nearest-neighbor entropy estimator

    Damiano Lombardi and Sanjay Pant. Nonparametric k -nearest-neighbor entropy estimator. Phys. Rev. E, 93: 0 013310, Jan 2016. doi:10.1103/PhysRevE.93.013310. URL https://link.aps.org/doi/10.1103/PhysRevE.93.013310

    2016 doi

  62. [70]

    Repaint: Inpainting using denoising diffusion probabilistic models

    Andreas Lugmayr, Martin Danelljan, Andres Romero, Fisher Yu, Radu Timofte, and Luc Van Gool. Repaint: Inpainting using denoising diffusion probabilistic models. In 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 11451--11461, 2022. doi:10.1109...

    2022

  63. [71]

    The body electric 2.0: recent advances in developmental bioelectricity for regenerative and synthetic bioengineering

    Juanita Mathews and Michael Levin. The body electric 2.0: recent advances in developmental bioelectricity for regenerative and synthetic bioengineering. Current Opinion in Biotechnology, 52: 0 134–144, August 2018. ISSN 0958-1669. doi:10.1016/j.copbio.2018.03.008. URL http://d...

    2018 doi

  64. [72]

    Collective intelligence: A unifying concept for integrating biology across scales and substrates

    Patrick McMillen and Michael Levin. Collective intelligence: A unifying concept for integrating biology across scales and substrates. Communications Biology, 7 0 (1), March 2024. ISSN 2399-3642. doi:10.1038/s42003-024-06037-4. URL http://dx.doi.org/10.1038/s42003-024-06037-4

    2024 doi

  65. [73]

    The genomic code: The genome instantiates a generative model of the organism

    Kevin J Mitchell and Nick Cheney. The genomic code: The genome instantiates a generative model of the organism. arXiv preprint arXiv:2407.15908, 2024

    2024 arXiv

  66. [74]

    Growing neural cellular automata

    Alexander Mordvintsev, Ettore Randazzo, Eyvind Niklasson, and Michael Levin. Growing neural cellular automata. Distill, 5 0 (2), February 2020. doi:10.23915/distill.00023. URL https://doi.org/10.23915/distill.00023

    2020 doi

  67. [75]

    Growing isotropic neural cellular automata

    Alexander Mordvintsev, Ettore Randazzo, and Craig Fouts. Growing isotropic neural cellular automata. In The 2022 Conference on Artificial Life, ALIFE 2022. MIT Press, 2022. doi:10.1162/isal_a_00552. URL http://dx.doi.org/10.1162/isal_a_00552

    2022 doi

  68. [76]

    Hyper NCA : Growing developmental networks with neural cellular automata

    Elias Najarro, Shyam Sudhakaran, Claire Glanois, and Sebastian Risi. Hyper NCA : Growing developmental networks with neural cellular automata. In From Cells to Societies: Collective Learning across Scales, 2022. URL https://openreview.net/forum?id=H5eErMka-9

    2022

  69. [77]

    Towards self-assembling artificial neural networks through neural developmental programs

    Elias Najarro, Shyam Sudhakaran, and Sebastian Risi. Towards self-assembling artificial neural networks through neural developmental programs. In Artificial Life Conference Proceedings 35, volume 1, page 80. MIT Press One Rogers Street, Cambridge, MA 02142-1209, USA journals-i...

    2023

  70. [78]

    Ng, Daishi Harada, and Stuart J

    Andrew Y. Ng, Daishi Harada, and Stuart J. Russell. Policy invariance under reward transformations: Theory and application to reward shaping. In Proceedings of the Sixteenth International Conference on Machine Learning, ICML '99, page 278–287, San Francisco, CA, USA, 1999. Mor...

    1999

  71. [79]

    Efros, and Jitendra Malik

    William Peebles, Ilija Radosavovic, Tim Brooks, Alexei A. Efros, and Jitendra Malik. Learning to learn with generative models of neural network checkpoints, 2022. URL https://arxiv.org/abs/2209.12892

    2022 arXiv

  72. [80]

    Pezzulo and M

    G. Pezzulo and M. Levin. Re-membering the body: applications of computational neuroscience to the top-down control of regeneration of limbs and other complex organs. Integrative Biology, 7: 0 1487--1517, 2015. doi:10.1039/c5ib00221d

    2015 doi

  73. [81]

    Top-down models in biology: explanation and control of complex living systems above the molecular level

    Giovanni Pezzulo and Michael Levin. Top-down models in biology: explanation and control of complex living systems above the molecular level. Journal of The Royal Society Interface, 13: 0 20160555, 11 2016. doi:10.1098/rsif.2016.0555

    2016

  74. [82]

    What can ecosystems learn? expanding evolutionary ecology with learning theory

    Daniel A Power, Richard A Watson, E \"o rs Szathm \'a ry, Rob Mills, Simon T Powers, C Patrick Doncaster, and B a \.Z ej Czapp. What can ecosystems learn? expanding evolutionary ecology with learning theory. Biology direct, 10: 0 1--24, 2015

    2015

  75. [83]

    Premakumar, Michael Vaiana, Florin Pop, Judd Rosenblatt, Diogo Schwerz de Lucena, Kirsten Ziman, and Michael S

    Vickram N. Premakumar, Michael Vaiana, Florin Pop, Judd Rosenblatt, Diogo Schwerz de Lucena, Kirsten Ziman, and Michael S. A. Graziano. Unexpected benefits of self-modeling in neural systems, 2024. URL https://arxiv.org/abs/2407.10188

    2024 arXiv

  76. [84]

    Pugh, Lisa B

    Justin K. Pugh, Lisa B. Soros, and Kenneth O. Stanley. Quality diversity: A new frontier for evolutionary computation. Frontiers in Robotics and AI, 3, 2016. ISSN 2296-9144. doi:10.3389/frobt.2016.00040. URL https://www.frontiersin.org/journals/robotics-and-ai/articles/10.3389...

    2016

  77. [85]

    Ramstead, Axel Constant, Paul B

    Maxwell J.D. Ramstead, Axel Constant, Paul B. Badcock, and Karl J. Friston. Variational ecology and the physics of sentient systems. Physics of Life Reviews, 31: 0 188--205, 2019. ISSN 1571-0645. doi:https://doi.org/10.1016/j.plrev.2018.12.002. URL https://www.sciencedirect.co...

    2019 doi

  78. [86]

    High-resolution image synthesis with latent diffusion models

    Robin Rombach, Andreas Blattmann, Dominik Lorenz, Patrick Esser, and Bj \"o rn Ommer. High-resolution image synthesis with latent diffusion models. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 10684--10695, 2022

    2022

  79. [87]

    D. E. Rumelhart, G. E. Hinton, and R. J. Williams. Learning internal representations by error propagation, page 318–362. MIT Press, Cambridge, MA, USA, 1986. ISBN 026268053X

    1986

  80. [88]

    Modularity in Development and Evolution

    Gerhard Schlosser and Günter P Wagner, editors. Modularity in Development and Evolution. University of Chicago Press, Chicago, IL, July 2004

    2004

  81. [89]

    Reinforcement learning upside down: Don't predict rewards -- just map them to actions, 2020

    Juergen Schmidhuber. Reinforcement learning upside down: Don't predict rewards -- just map them to actions, 2020. URL https://arxiv.org/abs/1912.02875

    2020 arXiv

  82. [90]

    Proximal policy optimization algorithms, 2017

    John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy optimization algorithms, 2017. URL https://arxiv.org/abs/1707.06347

    2017 arXiv

  83. [91]

    u ckstie , Alex Graves, Jan Peters, and J \

    Frank Sehnke, Christian Osendorfer, Thomas R \"u ckstie , Alex Graves, Jan Peters, and J \"u rgen Schmidhuber. Parameter-exploring policy gradients. Neural Networks, 23 0 (4): 0 551--559, 2010

    2010

  84. [92]

    Cellular competency during development alters evolutionary dynamics in an artificial embryogeny model

    Lakshwin Shreesha and Michael Levin. Cellular competency during development alters evolutionary dynamics in an artificial embryogeny model. Entropy, 25 0 (1), 2023. ISSN 1099-4300. doi:10.3390/e25010131. URL https://www.mdpi.com/1099-4300/25/1/131

    2023 doi

  85. [93]

    David Silver, Satinder Singh, Doina Precup, and Richard S. Sutton. Reward is enough. Artificial Intelligence, 299: 0 103535, October 2021. ISSN 0004-3702. doi:10.1016/j.artint.2021.103535. URL http://dx.doi.org/10.1016/j.artint.2021.103535

    2021

  86. [94]

    Deep unsupervised learning using nonequilibrium thermodynamics

    Jascha Sohl-Dickstein, Eric Weiss, Niru Maheswaranathan, and Surya Ganguli. Deep unsupervised learning using nonequilibrium thermodynamics. In International conference on machine learning, pages 2256--2265. PMLR, 2015

    2015

  87. [95]

    Denoising diffusion implicit models

    Jiaming Song, Chenlin Meng, and Stefano Ermon. Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502, 2020

    2010 arXiv

  88. [96]

    Training agents using upside-down reinforcement learning, 2021

    Rupesh Kumar Srivastava, Pranav Shyam, Filipe Mutz, Wojciech Jaśkowski, and Jürgen Schmidhuber. Training agents using upside-down reinforcement learning, 2021. URL https://arxiv.org/abs/1912.02877

    2021 arXiv

  89. [97]

    Why greatness cannot be planned: The myth of the objective

    Kenneth O Stanley and Joel Lehman. Why greatness cannot be planned: The myth of the objective. Springer, 2015

    2015

  90. [98]

    Evolving Neural Networks through Augmenting Topologies

    Kenneth O Stanley and Risto Miikkulainen. Evolving Neural Networks through Augmenting Topologies . Evol. Comput., 10 0 (2): 0 99--127, 2002. ISSN 1063-6560. doi:10.1162/106365602320169811. URL https://doi.org/10.1162/106365602320169811

    2002 doi

  91. [99]

    On the importance of initialization and momentum in deep learning

    Ilya Sutskever, James Martens, George Dahl, and Geoffrey Hinton. On the importance of initialization and momentum in deep learning. In Sanjoy Dasgupta and David McAllester, editors, Proceedings of the 30th International Conference on Machine Learning, volume 28 of Proceedings ...

    2013

  92. [100]

    Reinforcement learning: an introduction mit press

    Richard S Sutton and Andrew G Barto. Reinforcement learning: an introduction mit press. Cambridge, MA, 22447: 0 10, 1998

    1998

  93. [101]

    Toward major evolutionary transitions theory 2.0

    E \"o rs Szathm \'a ry. Toward major evolutionary transitions theory 2.0. Proceedings of the National Academy of Sciences, 112 0 (33): 0 10104--10111, 2015

    2015

  94. [102]

    The sensory neuron as a transformer: Permutation-invariant neural networks for reinforcement learning

    Yujin Tang and David Ha. The sensory neuron as a transformer: Permutation-invariant neural networks for reinforcement learning. In A. Beygelzimer, Y. Dauphin, P. Liang, and J. Wortman Vaughan, editors, Advances in Neural Information Processing Systems, 2021. URL https://openre...

    2021

  95. [103]

    Neuroevolution of self-interpretable agents

    Yujin Tang, Duong Nguyen, and David Ha. Neuroevolution of self-interpretable agents. In Proceedings of the 2020 Genetic and Evolutionary Computation Conference, GECCO '20, page 414–424, New York, NY, USA, 2020. Association for Computing Machinery. ISBN 9781450371285. doi:10.11...

    2020

  96. [104]

    Ten Tusscher and Paulien Hogeweg

    Kirsten H. Ten Tusscher and Paulien Hogeweg. Evolution of networks for body plan patterning; interplay of modularity, robustness and evolvability. PLoS Computational Biology, 7 0 (10): 0 e1002208, 2011. ISSN 1553-7358. doi:10.1371/journal.pcbi.1002208. URL http://dx.doi.org/10...

    2011 doi

  97. [105]

    Toward a theory of evolution as multilevel learning

    Vitaly Vanchurin, Yuri I Wolf, Mikhail I Katsnelson, and Eugene V Koonin. Toward a theory of evolution as multilevel learning. Proceedings of the National Academy of Sciences, 119 0 (6): 0 e2120037119, 2022

    2022

  98. [106]

    Embodied cognition and circular causality: on the role of constitutive autonomy in the reciprocal coupling of perception and action

    David Vernon, Robert Lowe, Serge Thill, and Tom Ziemke. Embodied cognition and circular causality: on the role of constitutive autonomy in the reciprocal coupling of perception and action. Frontiers in Psychology, 6, 2015. ISSN 1664-1078. doi:10.3389/fpsyg.2015.01660. URL http...

    2015

  99. [107]

    Evolutionary algorithms: A critical review and its future prospects

    Pradnya A Vikhar. Evolutionary algorithms: A critical review and its future prospects. In 2016 International conference on global trends in signal processing, information computing and communication (ICGTSPICC), pages 261--265. IEEE, 2016

    2016

  100. [108]

    The molecular origins of evolutionary innovations

    Andreas Wagner. The molecular origins of evolutionary innovations. Trends in Genetics, 27 0 (10): 0 397–410, 2011. ISSN 0168-9525. doi:10.1016/j.tig.2011.06.002. URL http://dx.doi.org/10.1016/j.tig.2011.06.002

    2011 doi

  101. [109]

    Spaces of the possible: universal darwinism and the wall between technological and biological innovation

    Andreas Wagner and William Rosen. Spaces of the possible: universal darwinism and the wall between technological and biological innovation. Journal of The Royal Society Interface, 11 0 (97): 0 20131190, 2014. doi:10.1098/rsif.2013.1190. URL https://royalsocietypublishing.org/d...

    2014

  102. [110]

    Wagner and Lee Altenberg

    G\" u nter P. Wagner and Lee Altenberg. Perspective: Complex adaptations and the evolution of evolvability. Evolution, 50 0 (3): 0 967--976, 1996. ISSN 00143820, 15585646. URL http://www.jstor.org/stable/2410639

    1996

  103. [111]

    Wagner, Mihaela Pavlicev, and James M

    G\" u nter P. Wagner, Mihaela Pavlicev, and James M. Cheverud. The road to modularity. Nature Reviews Genetics, 8 0 (12): 0 921–931, 2007. ISSN 1471-0064. doi:10.1038/nrg2267. URL http://dx.doi.org/10.1038/nrg2267

    2007 doi

  104. [112]

    The collective intelligence of evolution and development

    Richard Watson and Michael Levin. The collective intelligence of evolution and development. Collective Intelligence, 2 0 (2): 0 26339137231168355, 2023

    2023

  105. [113]

    How can evolution learn? Trends in ecology & evolution, 31 0 (2): 0 147--157, 2016

    Richard A Watson and E \"o rs Szathm \'a ry. How can evolution learn? Trends in ecology & evolution, 31 0 (2): 0 147--157, 2016

    2016

  106. [114]

    Watson, G\" u nter P

    Richard A. Watson, G\" u nter P. Wagner, Mihaela Pavlicev, Daniel M. Weinreich, and Rob Mills. THE EVOLUTION OF PHENOTYPIC CORRELATIONS AND DEVELOPMENTAL MEMORY . Evolution, 68 0 (4): 0 1124--1138, February 2014. doi:10.1111/evo.12337. URL https://doi.org/10.1111/evo.12337

    2014 doi

  107. [115]

    Evolutionary connectionism: algorithmic principles underlying the evolution of biological organisation in evo-devo, evo-eco and evolutionary transitions

    Richard A Watson, Rob Mills, CL Buckley, Kostas Kouvaris, Adam Jackson, Simon T Powers, Chris Cox, Simon Tudge, Adam Davies, Loizos Kounios, et al. Evolutionary connectionism: algorithmic principles underlying the evolution of biological organisation in evo-devo, evo-eco and e...

    2016

  108. [116]

    Design for an individual: connectionist approaches to the evolutionary transitions in individuality

    Richard A Watson, Michael Levin, and Christopher L Buckley. Design for an individual: connectionist approaches to the evolutionary transitions in individuality. Frontiers in Ecology and Evolution, 10: 0 823588, 2022

    2022

  109. [117]

    A New Kind of Science

    Stephen Wolfram. A New Kind of Science. Wolfram Media, 2002. ISBN 1579550088. URL https://www.wolframscience.com

    2002

  110. [118]

    Emodm: A diffusion model for evolutionary multi-objective optimization, 2024

    Xueming Yan and Yaochu Jin. Emodm: A diffusion model for evolutionary multi-objective optimization, 2024. URL https://arxiv.org/abs/2401.15931

    2024 arXiv

  111. [119]

    Towards self-reflecting machines: Two-minds in one robot

    Juan Cristobal Zagal and Hod Lipson. Towards self-reflecting machines: Two-minds in one robot. In Advances in Artificial Life. Darwin Meets von Neumann: 10th European Conference, ECAL 2009, Budapest, Hungary, September 13-16, 2009, Revised Selected Papers, Part I 10, pages 156...

    2009

  112. [120]

    Diffusion models are evolutionary algorithms, 2024

    Yanbo Zhang, Benedikt Hartl, Hananel Hazan, and Michael Levin. Diffusion models are evolutionary algorithms, 2024. URL https://arxiv.org/abs/2410.02543

    2024 arXiv

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.