Evolving neural networks with genetic algorithms to study the String Landscape
arXiv:1706.07024 · doi:10.1007/JHEP08(2017)038
Abstract
We study possible applications of artificial neural networks to examine the string landscape. Since the field of application is rather versatile, we propose to dynamically evolve these networks via genetic algorithms. This means that we start from basic building blocks and combine them such that the neural network performs best for the application we are interested in. We study three areas in which neural networks can be applied: to classify models according to a fixed set of (physically) appealing features, to find a concrete realization for a computation for which the precise algorithm is known in principle but very tedious to actually implement, and to predict or approximate the outcome of some involved mathematical computation which performs too inefficient to apply it, e.g. in model scans within the string landscape. We present simple examples that arise in string phenomenology for all three types of problems and discuss how they can be addressed by evolving neural networks from genetic algorithms.
17 pages, 7 figures, references added, typos corrected, extended introductory section
References in corpus (4)
Cited by in corpus (12)
- Machine Learning in the String Landscape
- Branes with Brains: Exploring String Vacua with Deep Reinforcement Learning
- AdS/CFT as a deep Boltzmann machine
- Deep Learning and AdS/QCD
- Getting CICY High
- Moduli Stabilization in Asymptotic Flux Compactifications
- Machine Learning Calabi-Yau Hypersurfaces
- On Axion Reheating in the String Landscape
- Breeding realistic D-brane models
- Kahler Moduli Stabilization and the Propagation of Decidability
- Unsupervised Machine Learning Techniques for Exploring Tropical Coamoeba, Brane Tilings and Seiberg Duality
- Ising Machines for Diophantine Problems in Physics