Statistical Predictions in String Theory and Deep Generative Models
James Halverson, Cody Long

TL;DR
This paper demonstrates that deep generative models, specifically Wasserstein GANs, can effectively approximate Kahler metrics in string theory, enabling efficient statistical predictions in the string landscape.
Contribution
It introduces a novel application of deep generative models to approximate string theory data, specifically Kahler metrics, with improved efficiency and extrapolation capabilities.
Findings
GANs accurately approximate Kahler metric eigenspectra
Fewer than h^{11} Gaussian samples suffice for accurate modeling
Conditional GANs enable extrapolation beyond training data
Abstract
Generative models in deep learning allow for sampling probability distributions that approximate data distributions. We propose using generative models for making approximate statistical predictions in the string theory landscape. For vacua admitting a Lagrangian description this can be thought of as learning random tensor approximations of couplings. As a concrete proof-of-principle, we demonstrate in a large ensemble of Calabi-Yau manifolds that Kahler metrics evaluated at points in Kahler moduli space are well-approximated by ensembles of matrices produced by a deep convolutional Wasserstein GAN. Accurate approximations of the Kahler metric eigenspectra are achieved with far fewer than Gaussian draws. Accurate extrapolation to values of outside the training set are achieved via a conditional GAN. Together, these results implicitly suggest the existence of strong…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
