Cargando…

Complexity and Random Matrix Approximations

<!--HTML-->Efforts to better understand the landscape and swampland can be stifled by computational complexity. I will discuss ways in which complexity could be overcome by learning random matrix approximations to string data, including both opportunities and caveats. As a concrete example, ge...

Descripción completa

Detalles Bibliográficos
Autor principal: Halverson, James
Lenguaje:eng
Publicado: 2019
Materias:
Acceso en línea:http://cds.cern.ch/record/2682615
_version_ 1780963173607669760
author Halverson, James
author_facet Halverson, James
author_sort Halverson, James
collection CERN
description <!--HTML-->Efforts to better understand the landscape and swampland can be stifled by computational complexity. I will discuss ways in which complexity could be overcome by learning random matrix approximations to string data, including both opportunities and caveats. As a concrete example, generative adversarial networks will be used to learn random matrix approximations to certain Calabi-Yau data, and physical implications will be discussed.
id cern-2682615
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 2019
record_format invenio
spelling cern-26826152022-11-02T22:21:37Zhttp://cds.cern.ch/record/2682615engHalverson, JamesComplexity and Random Matrix ApproximationsString Phenomenology 2019Conferences & Workshops<!--HTML-->Efforts to better understand the landscape and swampland can be stifled by computational complexity. I will discuss ways in which complexity could be overcome by learning random matrix approximations to string data, including both opportunities and caveats. As a concrete example, generative adversarial networks will be used to learn random matrix approximations to certain Calabi-Yau data, and physical implications will be discussed.oai:cds.cern.ch:26826152019
spellingShingle Conferences & Workshops
Halverson, James
Complexity and Random Matrix Approximations
title Complexity and Random Matrix Approximations
title_full Complexity and Random Matrix Approximations
title_fullStr Complexity and Random Matrix Approximations
title_full_unstemmed Complexity and Random Matrix Approximations
title_short Complexity and Random Matrix Approximations
title_sort complexity and random matrix approximations
topic Conferences & Workshops
url http://cds.cern.ch/record/2682615
work_keys_str_mv AT halversonjames complexityandrandommatrixapproximations
AT halversonjames stringphenomenology2019