• Corpus ID: 237572199

Polytopes and Machine Learning

  title={Polytopes and Machine Learning},
  author={Jiakang Bao and Yang-Hui He and Edward Hirst and Johannes Hofscheier and A. Kasprzyk and Suvajit Majumder},
We introduce machine learning methodology to the study of lattice polytopes. With supervised learning techniques, we predict standard properties such as volume, dual volume, reflexivity, etc, with accuracies up to 100%. We focus on 2d polygons and 3d polytopes with Plücker coordinates as input, which out-perform the usual vertex representation. ar X iv :2 10 9. 09 60 2v 1 [ m at h. C O ] 1 5 Se p 20 21 
Machine learning Calabi-Yau hypersurfaces
This work revisits the classic database of weighted-Ps which admit Calabi-Yau 3-fold hypersurfaces equipped with a diverse set of tools from the machine-learning toolbox and identifies a previously unnoticed clustering in the Calabi/Yau data.
Applying machine learning to the Calabi-Yau orientifolds with string vacua
We use machine learning technique to search the polytope which can result in an orientifold Calabi-Yau hypersurface and the “naive Type IIB string vacua”. We show that neural networks can be trained
Machine Learning for Hilbert Series
A summary of work applying machine learning to databases of Hilbert series, a standard tool in algebraic geometry, finds many uses in theoretical physics.
Machine Learning Algebraic Geometry for Physics
A chapter contribution to the book Machine learning and Algebraic Geometry, edited by A. Kasprzyk et al.
Cluster Algebras: Network Science and Machine Learning
Network analysis methods are applied to the exchange graphs for cluster algebras of varying mutation types and indicates that when the graphs are represented without identifying by permutation equivalence between clusters an elegant symmetry emerges in the quiver exchange graph embedding.
Brain Webs for Brane Webs
We propose a new technique for classifying 5d Superconformal Field Theories arising from brane webs in Type IIB String Theory, using technology from Machine Learning to identify different webs giving


Learning convex polytopes with margin
An improved algorithm for properly learning convex polytopes in the realizable PAC setting from data with a margin is presented and distinct generalizations of the notion of margin from hyperplanes to poly topes are identified.
Estimating Calabi-Yau hypersurface and triangulation counts with equation learners
A bstractWe provide the first estimate of the number of fine, regular, star triangulations of the four-dimensional reflexive polytopes, as classified by Kreuzer and Skarke (KS). This provides an
Machine learning of Calabi-Yau volumes
We employ machine learning techniques to investigate the volume minimum of Sasaki-Einstein base manifolds of noncompact toric Calabi-Yau three-folds. We find that the minimum volume can be approxim
On the Classification of Reflexive Polyhedra
Abstract: Reflexive polyhedra encode the combinatorial data for mirror pairs of Calabi–Yau hypersurfaces in toric varieties. We investigate the geometrical structures of circumscribed polytopes with
The Calabi-Yau Landscape: from Geometry, to Physics, to Machine-Learning
We present a pedagogical introduction to the recent advances in the computational geometry, physical implications, and data science of Calabi-Yau manifolds. Aimed at the beginning research student
Convex lattice polytopes and cones with few lattice points inside
It is pretty well-known that toric Fano varieties of dimension k with terminal singularities correspond to convex lattice polytopes P in R^k of positive finite volume, such that intersection of P and
On the maximum dual volume of a canonical Fano polytope
We give an upper bound on the volume vol(P*) of a polytope P* dual to a d-dimensional lattice polytope P with exactly one interior lattice point, in each dimension d. This bound, expressed in terms
Classification of Reflexive Polyhedra in Three Dimensions
We present the last missing details of our algorithm for the classification of reflexive polyhedra in arbitrary dimensions. We also present the results of an application of this algorithm to the case
Machine-Learning Mathematical Structures
Focusing on supervised machine-learning on labeled data from different fields ranging from geometry to representation theory, from combinatorics to number theory, a comparative study of the accuracies on different problems is presented.