Fetching the paper…
Reading the bibliography…
Evolutionary algorithms (EAs) simulate natural selection but have two main limitations: (1) they rarely update individuals based on global correlations, limiting comprehensive learning; (2) they struggle with balancing exploration and exploitation, where excessive exploitation causes premature convergence, and excessive exploration slows down the search.
S. Wright
1932
Earlier work this paper cites.
M. Friedman, “The use of ranks to avoid the assumption of normality implicit in the analysis of variance,”
1937
Earlier work this paper cites.
T. Dobzhansky,
1982
Earlier work this paper cites.
R. Brady, “Optimization strategies gleaned from biological evolution,”
1985
Earlier work this paper cites.
M. Gorges-Schleuter, “Genetic algorithms and population structures,” Ph.D. dissertation, 1991
1991
Earlier work this paper cites.
J. H. Holland, “Genetic algorithms,”
1992
Earlier work this paper cites.
R. Storn and K. Price, “Differential evolution–a simple and efficient heuristic for global optimization over continuous spaces,”
1997
Earlier work this paper cites.
A. E. Eiben and C. A. Schippers, “On evolutionary exploration and exploitation,”
1998
Earlier work this paper cites.
H.-G. Beyer and D. V. Arnold, “Theory of evolution strategies—a tutorial,”
2001
Earlier work this paper cites.
H.-G. Beyer and H.-P. Schwefel, “Evolution strategies–a comprehensive introduction,”
2002
Earlier work this paper cites.
N. Hansen, S. D. Müller, and P. Koumoutsakos, “Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (cma-es),”
2003
Earlier work this paper cites.
J. Zhang and A. C. Sanderson, “Jade: adaptive differential evolution with optional external archive,”
2009
Earlier work this paper cites.
F. Sehnke, C. Osendorfer, T. Rückstieß, A. Graves, J. Peters, and J. Schmidhuber, “Parameter-exploring policy gradients,”
2010
Earlier work this paper cites.
M. Črepinšek, S.-H. Liu, and M. Mernik, “Exploration and exploitation in evolutionary algorithms: A survey,”
2013
Earlier work this paper cites.
R. Tanabe and A. Fukunaga, “Success-history based parameter adaptation for differential evolution,” in
2013
Earlier work this paper cites.
G. Karafotias, M. Hoogendoorn, and Á. E. Eiben, “Parameter control in evolutionary algorithms: Trends and challenges,”
2014
Cited alongside, same era.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,”
2016
Cited alongside, same era.
M. Defferrard, X. Bresson, and P. Vandergheynst, “Convolutional neural networks on graphs with fast localized spectral filtering,”
2016
Cited alongside, same era.
2017
Cited alongside, same era.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,”
2017
Cited alongside, same era.
M. Pant, H. Zaheer, L. Garcia-Hernandez, A. Abraham
2020
Later among the works it cites.
X. He, Z. Zheng, and Y. Zhou, “Mmes: Mixture model-based evolution strategy for large-scale optimization,”
2020
Later among the works it cites.
B. Muhammet, R. Guillaume, H. Pierre, G. Benoit, A. Sébastien, and P. Honeine, “When spectral domain meets spatial domain in graph neural networks,” in
2020
Later among the works it cites.
X. Zhou, A. K. Qin, M. Gong, and K. C. Tan, “A survey on evolutionary construction of deep neural networks,”
2021
Later among the works it cites.
M. He, Z. Wei, H. Xu
2021
Later among the works it cites.
V. Ojha, J. Timmis, and G. Nicosia, “Assessing ranking and effectiveness of evolutionary algorithm hyperparameters using global sensitivity analysis methodologies,”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2017
Cited alongside, same era.
K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How powerful are graph neural networks?”
2018
Cited alongside, same era.
C. Qian, Y. Yu, K. Tang, Y. Jin, X. Yao, and Z.-H. Zhou, “On the effectiveness of sampling for evolutionary optimization in noisy environments,”
2018
Cited alongside, same era.
C. Qian, Y. Yu, and Z.-H. Zhou, “Analyzing evolutionary optimization in noisy environments,”
2018
Cited alongside, same era.
2018
Cited alongside, same era.
X. Wang, X. He, M. Wang, F. Feng, and T.-S. Chua, “Neural graph collaborative filtering,” in
2019
Cited alongside, same era.
K. R. Opara and J. Arabas, “Differential evolution: A survey of theoretical analyses,”
2019
Cited alongside, same era.
2022
Later among the works it cites.
H. Zhang, J. Sun, K. C. Tan, and Z. Xu, “Learning adaptive differential evolution by natural evolution strategies,”
2022
Later among the works it cites.
X. Wang and M. Zhang, “How powerful are spectral graph neural networks,” in
2022
Later among the works it cites.
J. Kudela, “A critical problem in benchmarking and analysis of evolutionary computation methods,”
2022
Later among the works it cites.
C. Darwin, “Origin of the species,” in
2023
Later among the works it cites.
N. Li, L. Ma, G. Yu, B. Xue, M. Zhang, and Y. Jin, “Survey on evolutionary deep learning: Principles, algorithms, applications, and open issues,”
2023
Later among the works it cites.
Z. Chen, F. Chen, L. Zhang, T. Ji, K. Fu, L. Zhao, F. Chen, L. Wu, C. Aggarwal, and C.-T. Lu, “Bridging the gap between spatial and spectral domains: A unified framework for graph neural networks,”
2023
Later among the works it cites.
J. Yu, Y. Zhang, and C. Sun, “Balance of exploration and exploitation: Non-cooperative game-driven evolutionary reinforcement learning,”
2024
Closest in time.
W. Chao, J. Zhao, L. Jiao, L. Li, F. Liu, and S. Yang, “A match made in consistency heaven: when large language models meet evolutionary algorithms,”
2024
Closest in time.
R. Lange, Y. Tian, and Y. Tang, “Large language models as evolution strategies,” in
2024
Closest in time.