Fetching the paper…
Reading the bibliography…
We investigate reinforcement learning and genetic algorithms in the context of heterotic Calabi-Yau models with monad bundles.
1903
Earlier work this paper cites.
Princeton University Press, 1957
R. E. Bellman, Dynamic Programming · 1957
Earlier work this paper cites.
R. Bellman, “A Markovian decision process,” Journal of Mathematics and Mechanics
1957
Earlier work this paper cites.
MIT Press, Cambridge MA, 1960
R. Howard, Dynamic Programming and Markov Processes · 1960
Earlier work this paper cites.
R. J. Williams, “A class of gradient-estimating algorithms for reinforcement learning in neural network,” Proceedings of the IEEE First International Conference on Neural Networks
1987
Earlier work this paper cites.
J. Distler and B. R. Greene, “Aspects of (2,0) String Compactifications,” Nucl. Phys. B
1988
Earlier work this paper cites.
Ph.D. thesis, Cambridge University, 1989
C. J. C. H. Watkins, Learning from Delayed Rewards · 1989
Earlier work this paper cites.
Addison-Wesley, 1989
E. Goldberg, David, Genetic Algorithms in Search, Optimization and Machine Learning · 1989
Earlier work this paper cites.
The MIT Press reprinted, 1992
J. Holland, Adaptation in Natural and Artificial Systems · 1992
Earlier work this paper cites.
MIT Press, 1992
J. Holland, “The Royal Road for Genetic Algorithms: Fitness Landscapes and GA Performance,” in Toward a Practice of Autonomous Systems: proceedings of the first European conference on Artificial Life · 1992
Earlier work this paper cites.
The University of New Mexico, 1995
T. Jones, Evolutionary Algorithms, Fitness Landscapes and Search (PhD) · 1995
Earlier work this paper cites.
S. Kachru, “Some three generation (0,2) Calabi-Yau models,” Phys. Lett. B
1995
Cited alongside, same era.
Springer, 2002
C. Reeves and J. Rowe, Genetic Algorithms: Principles and Perspectives · 2002
Cited alongside, same era.
P. Charbonneau, “An introduction to genetic algorithms for numerical optimization,” Tech. Rep. TN-450+IA, National Center for Atmospheric Research, Mar., 2002
2002
Cited alongside, same era.
M. Larfors and R. Schneider, “Explore and Exploit with Heterotic Line Bundle Models,” Fortsch. Phys
2003
Cited alongside, same era.
Wiley, 2nd ed., 2004
R. Haupt and S. Haupt, Practical genetic algorithms · 2004
Cited alongside, same era.
Springer. Z Fogel 2nd ed., 2004
D. Michalewicz, How to Solve It: Modern Heuristics · 2004
2010
Later among the works it cites.
2010
Later among the works it cites.
S. Abel and J. Rizos, “Genetic Algorithms and the Search for Viable String Vacua,” JHEP
2014
Later among the works it cites.
Y.-H. He, “Machine-learning the string landscape,” Physics Letters B
2017
Later among the works it cites.
F. Ruehle, “Evolving neural networks with genetic algorithms to study the String Landscape,” JHEP
2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
J. McCall, “Genetic algorithms for modelling and optimisation,” Journal of Computational and Applied Mathematics
2005
Cited alongside, same era.
L. B. Anderson, Heterotic and M-theory Compactifications for String Phenomenology · 2008
Cited alongside, same era.
L. B. Anderson, Y.-H. He, and A. Lukas, “Monad Bundles in Heterotic String Compactifications,” JHEP
2008
Cited alongside, same era.
2009
Cited alongside, same era.
2010
Cited alongside, same era.
Cited in the paper.
Later among the works it cites.
D. Silver, J. Schrittwieser, and K. Simonyan et al, “Mastering the game of Go without human knowledge.,” Nature
2017
Later among the works it cites.
MIT Press, 2 ed., 2018
S. R. Sutton and A. G. Barto, Reinforcement Learning: An Introduction · 2018
Later among the works it cites.
D. White, “An Overview of Schema Theory,” Graduate J. Math
2018
Later among the works it cites.
2019
Later among the works it cites.
F. Ruehle, “Data science applications to string theory,” Phys. Rept
2020
Later among the works it cites.