Related papers: Heterotic String Model Building with Monad Bundles…

In modern ML Ops environments, model deployment is a critical process that traditionally relies on static heuristics such as validation error comparisons and A/B testing. However, these methods require human intervention to adapt to…

The potential benefits of model-free reinforcement learning to real robotics systems are limited by its uninformed exploration that leads to slow convergence, lack of data-efficiency, and unnecessary interactions with the environment. To…

Reinforcement learning (RL) methods have been shown to be capable of learning intelligent behavior in rich domains. However, this has largely been done in simulated domains without adequate focus on the process of building the simulator. In…

We address the problem of tuning word embeddings for specific use cases and domains. We propose a new method that automatically combines multiple domain-specific embeddings, selected from a wide range of pre-trained domain-specific…

We construct a bi-linear form on the periods of Calabi-Yau spaces. These are used to obtain the prepotentials around conifold singularities in type-II strings compactified on Calabi-Yau space. The explicit construction of the bi-linear…

Although providing exceptional results for many computer vision tasks, state-of-the-art deep learning algorithms catastrophically struggle in low data scenarios. However, if data in additional modalities exist (e.g. text) this can…

In this article we summarize and extend the ideas and investigations on so called target space dualities of heterotic models with (0,2) worldsheet supersymmetry as they were partly presented on the String-Math 2011 conference. After the…

We investigate orbifold compactifications of the heterotic string, addressing in detail their construction, classification and phenomenological potential. We present a strategy to search for models resembling the minimal supersymmetric…

Neural networks can be trained to rank the choices made by logical reasoners, resulting in more efficient searches for answers. A key step in this process is creating useful embeddings, i.e., numeric representations of logical statements.…

A numerical algorithm is presented for explicitly computing the gauge connection on slope-stable holomorphic vector bundles on Calabi-Yau manifolds. To illustrate this algorithm, we calculate the connections on stable monad bundles defined…

Deep reinforcement learning has shown remarkable success in the past few years. Highly complex sequential decision making problems from game playing and robotics have been solved with deep model-free methods. Unfortunately, the sample…

Class-conditional generative models hold promise to overcome the shortcomings of their discriminative counterparts. They are a natural choice to solve discriminative tasks in a robust manner as they jointly optimize for predictive…

The compositional structure of language enables humans to decompose complex phrases and map them to novel visual concepts, showcasing flexible intelligence. While several algorithms exhibit compositionality, they fail to elucidate how…

The condition of having an $N=1$ spacetime supersymmetry for heterotic string leads to 4 distinct possibilities for compactifications namely compactifications down to 6,4,3 and 2 dimensions. Compactifications to 6 and 4 dimensions have been…

We study the possibility of obtaining metastable de Sitter vacua of heterotic string theory compactified on a Calabi-Yau threefold which are classical and simple in the K\"ahler moduli sector of the theory. For this, we exploit a known…

Motivated by the study of heterotic string compactifications on elliptically fibered Calabi-Yau manifolds, we present a procedure for testing semistability and identifying the decomposition type of degree zero holomorphic vector bundles…

From the string partition function, we discuss the mass-shell and GSO projection conditions valid for Kaluza-Klein (KK) as well as massless states in the heterotic string theory compactified on a nonprime orbifold. Based on the obtained…

Although reinforcement learning has seen tremendous success recently, this kind of trial-and-error learning can be impractical or inefficient in complex environments. The use of demonstrations, on the other hand, enables agents to benefit…

We compute the six-dimensional effective action of the heterotic string compactified on K3 for the standard embedding and for a class of backgrounds with line bundles and appropriate Yang-Mills fluxes. We compute the couplings of the…

We construct spacetime supersymmetric, modular invariant partition functions of strings on the conifold-type singularities which include contributions from the discrete-series representations of SL(2, R). The discrete spectrum is…