Machine learning Calabi-Yau metrics

We introduce neural networks to compute numerical Ricci-flat CY metrics for complete intersection and Kreuzer-Skarke Calabi-Yau manifolds at any point in K\"ahler and complex structure moduli space, and introduce the package cymetric which provides computation realizations of these techniques. In particular, we develop and computationally realize methods for point-sampling on these manifolds. The training for the neural networks is carried out subject to a custom loss functio...

In order to be in control of the $\alpha'$ derivative expansion, geometric string compactifications are understood in the context of a large volume approximation. In this letter, we consider the reduction of these higher derivative terms, and propose an improved estimate on the large volume approximation using numerical Calabi-Yau metrics obtained via machine learning methods. Further to this, we consider the $\alpha'^3$ corrections to numerical Calabi-Yau metrics in the cont...

We revisit the classic database of weighted-P4s which admit Calabi-Yau 3-fold hypersurfaces equipped with a diverse set of tools from the machine-learning toolbox. Unsupervised techniques identify an unanticipated almost linear dependence of the topological data on the weights. This then allows us to identify a previously unnoticed clustering in the Calabi-Yau data. Supervised techniques are successful in predicting the topological parameters of the hypersurface from its weig...

We present a new machine learning library for computing metrics of string compactification spaces. We benchmark the performance on Monte-Carlo sampled integrals against previous numerical approximations and find that our neural networks are more sample- and computation-efficient. We are the first to provide the possibility to compute these metrics for arbitrary, user-specified shape and size parameters of the compact space and observe a linear relation between optimization of...

We revisit the question of predicting both Hodge numbers $h^{1,1}$ and $h^{2,1}$ of complete intersection Calabi-Yau (CICY) 3-folds using machine learning (ML), considering both the old and new datasets built respectively by Candelas-Dale-Lutken-Schimmrigk / Green-H\"ubsch-Lutken and by Anderson-Gao-Gray-Lee. In real world applications, implementing a ML system rarely reduces to feed the brute data to the algorithm. Instead, the typical workflow starts with an exploratory dat...

We discuss the extent to which numerical techniques for computing approximations to Ricci-flat metrics can be used to investigate hierarchies of curvature scales on Calabi-Yau manifolds. Control of such hierarchies is integral to the validity of curvature expansions in string effective theories. Nevertheless, for seemingly generic points in moduli space it can be difficult to analytically determine if there might be a highly curved region localized somewhere on the Calabi-Yau...

In this manuscript, we demonstrate, by using several regression techniques, that one can machine learn the other independent Hodge numbers of complete intersection Calabi-Yau four-folds and five-folds in terms of $h^{1,1}$ and $h^{2,1}$. Consequently, we combine the Hodge numbers $h^{1,1}$ and $h^{2,1}$ from the complete intersection of Calabi-Yau three-folds, four-folds, and five-folds into a single dataset. We then implemented various classification algorithms on this datas...

We review advancements in deep learning techniques for complete intersection Calabi-Yau (CICY) 3- and 4-folds, with the aim of understanding better how to handle algebraic topological data with machine learning. We first discuss methodological aspects and data analysis, before describing neural networks architectures. Then, we describe the state-of-the art accuracy in predicting Hodge numbers. We include new results on extrapolating predictions from low to high Hodge numbers,...

Gaussian Process Regression, Kernel Support Vector Regression, the random forest, extreme gradient boosting and the generalized linear model algorithms are applied to data of Complete Intersection Calabi-Yau 3-folds. It is shown that Gaussian process regression is the most suitable for learning the Hodge number h^(2,1)in terms of h^(1,1). The performance of this regression algorithm is such that the Pearson correlation coefficient for the validation set is R^2 = 0.9999999995 ...

Hodge numbers of Calabi-Yau manifolds depend non-trivially on the underlying manifold data and they present an interesting challenge for machine learning. In this letter we consider the data set of complete intersection Calabi-Yau four-folds, a set of about 900,000 topological types, and study supervised learning of the Hodge numbers h^1,1 and h^3,1 for these manifolds. We find that h^1,1 can be successfully learned (to 96% precision) by fully connected classifier and regress...