paper-with-me

Papers

Explore and Exploit with Heterotic Line Bundle Models

2020-03-10 · Magdalena Larfors, Robin Schneider

We use deep reinforcement learning to explore a class of heterotic $SU(5)$ GUT models constructed from line bundle sums over Complete Intersection Calabi Yau (CICY) manifolds. We perform several experiments where A3C agents are trained to search for such models. These agents significantly outperform random exploration, in the most favourable settings by a factor of 1700 when it comes to finding unique models. Furthermore, we find evidence that the trained agents also outperform random walkers on new manifolds. We conclude that the agents detect hidden structures in the compactification data, which is partly of general nature. The experiments scale well with $h^{(1,1)}$, and may thus provide the key to model building on CICYs with large $h^{(1,1)}$.

📄 PDF Abstract BibTeX arXiv:2003.04817

Code (1)

robin-schneider/gymCICY 공식 구현

Tasks

Deep Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Methods 이 논문이 사용한 방법론

Entropy Regularization 설명 없음
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
A3C A3C, Asynchronous Advantage Actor Critic, is a policy gradient algorithm in reinforcement learning that maintains a policy $\pi\left(a\_{t}\mid{s}\_{t}; \theta\right)$ and…

Similar Papers 제목 키워드 기반

Heterotic String Model Building with Monad Bundles and Reinforcement Learning

2021-08-16 · Andrei Constantin, Thomas R. Harvey, Andre Lukas

We use reinforcement learning as a means of constructing string compactifications with prescribed properties. Specifically, we study heterotic SO(10) GUT models on Calabi-Yau three-folds with monad bundles, in search of …

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Hermitian Yang--Mills connections on general vector bundles: geometry and physical Yukawa couplings

2025-12-11 · Challenger Mishra, Justin Tan arxiv

We compute solutions to the Hermitian Yang-Mills equations on holomorphic vector bundles $V$ via an alternating optimisation procedure founded on geometric machine learning. The proposed method is fully general with resp…

Decoding Nature with Nature's Tools: Heterotic Line Bundle Models of Particle Physics with Genetic Algorithms and Quantum Annealing

2023-06-05 · Steve Abel, Andrei Constantin, Thomas R. Harvey, Andre Lukas 외

The string theory landscape may include a multitude of ultraviolet embeddings of the Standard Model, but identifying these has proven difficult due to the enormous number of available string compactifications. Genetic Al…

Machine Learning String Standard Models

2020-03-30 · Rehan Deen, Yang-Hui He, Seung-Joo Lee, Andre Lukas

We study machine learning of phenomenologically relevant properties of string compactifications, which arise in the context of heterotic line bundle models. Both supervised and unsupervised learning are considered. We fi…

BIG-bench Machine Learning

Heterotic Risk Models

2016-01-23

We give a complete algorithm and source code for constructing what we refer to as heterotic risk models (for equities), which combine: i) granularity of an industry classification; ii) diagonality of the principal compon…

Position