Machine learning in the string landscape

From MaRDI portal
Revision as of 06:04, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1706031

DOI10.1007/JHEP09(2017)157zbMATH Open1382.81155arXiv1707.00655OpenAlexW3105570377MaRDI QIDQ1706031

Author name not available (Why is that?)

Publication date: 19 March 2018

Published in: (Search for Journal in Brave)

Abstract: We utilize machine learning to study the string landscape. Deep data dives and conjecture generation are proposed as useful frameworks for utilizing machine learning in the landscape, and examples of each are presented. A decision tree accurately predicts the number of weak Fano toric threefolds arising from reflexive polytopes, each of which determines a smooth F-theory compactification, and linear regression generates a previously proven conjecture for the gauge group rank in an ensemble of frac43imes2.96imes10755 F-theory compactifications. Logistic regression generates a new conjecture for when E6 arises in the large ensemble of F-theory compactifications, which is then rigorously proven. This result may be relevant for the appearance of visible sectors in the ensemble. Through conjecture generation, machine learning is useful not only for numerics, but also for rigorous results.


Full work available at URL: https://arxiv.org/abs/1707.00655



No records found.


No records found.








This page was built for publication: Machine learning in the string landscape

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1706031)