String Model Building, Reinforcement Learning and Genetic AlgorithmsCan reinforcement learning and genetic algorithms efficiently locate rare phenomenologically attractive heterotic monad models in spaces too large for systematic scans, and how complete are their searches on the chosen Calabi–Yau examples?
Source ID: unit:47f7a67ce6a2cf81a3163b2142ecc40357ae05bf695e27957a34f27ba3c507bc
Archived source locator: {"paperId":"2111.07333","sourceSha256":"5b18bf28a9bc8b27631a4b6f57dcf8bd4dc26a2eee88ee6b9046ba7d2834dee4","pages":[1,2,7],"evidenceRefs":["source-graph:ev:14f9c299357d110eae592d95e2ce4011","source-graph:ev:62776776ab1ad99ddfd6574e78a0f465","source-graph:ev:cb1aecf82b415b3652558bd36736f5b7"]}
Optional complete source context (gzip JSON). Exact source-object relations retain their own scope; they do not imply relations between entire topics.