Simple genetic operators are universal approximators of probability distributions (and other advantages of expressive encodings)-Reference-Cited by-同舟云学术

Simple genetic operators are universal approximators of probability distributions (and other advantages of expressive encodings)

Published:2022-07-08 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Genetic and Evolutionary Computation Conference
language:
Short-container-title:

Author:

Meyerson Elliot¹,Qiu Xin¹,Miikkulainen Risto²

Affiliation:

1. Cognizant AI Labs

2. UT Austin

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3512290.3528746

Reference96 articles.

1. Lee Altenberg et al. 1994. The evolution of evolvability in genetic programming. Advances in genetic programming 3 (1994) 47--74. Lee Altenberg et al. 1994. The evolution of evolvability in genetic programming. Advances in genetic programming 3 (1994) 47--74.

2. Anne Auger and Benjamin Doerr . 2011. Theory of randomized search heuristics: Foundations and recent developments . Vol. 1 . World Scientific . Anne Auger and Benjamin Doerr. 2011. Theory of randomized search heuristics: Foundations and recent developments. Vol. 1. World Scientific.

3. Generalized jump functions

4. Genetic Programming and Emergence

5. Markus Brameier , Wolfgang Banzhaf , and Wolfgang Banzhaf . 2007. Linear genetic programming . Vol. 1 . Springer . Markus Brameier, Wolfgang Banzhaf, and Wolfgang Banzhaf. 2007. Linear genetic programming. Vol. 1. Springer.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Evolution of Neural Networks;Proceedings of the Companion Conference on Genetic and Evolutionary Computation;2023-07-15

2. Evolution of neural networks;Proceedings of the Genetic and Evolutionary Computation Conference Companion;2022-07-09