Learn · CERN

Talk30 min

Complexity and Random Matrix Approximations

James Halverson · CERN

Watch At CERN

About

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..

0:00:00 Slide 1

0:02:39 Slide 2

0:03:40 Slide 3

0:05:27 Slide 4

0:05:56 Slide 5

0:06:19 Slide 6

0:07:41 Slide 7

0:10:40 Slide 8

0:11:18 Slide 9

0:12:36 Slide 10

0:14:14 Slide 11

The talk

  1. Complexity and Random Matrix Approximations 2019-06-27 · 30 min · CERN's player

Credits and licence

Institution
CERN
Department
Conferences & Workshops
Speaker
James Halverson
Year
2019
Language
English
Source
CERN
Licence
CERN, as CERN states it. CERN's terms
Attribution
© CERN. CERN provides its audiovisual media free of charge for educational and informational use, credited to CERN; this lecture is shown in CERN's own player.
Who can watch
CERN gives no rating. Invisible Network shows it to Teens profiles and older, judged from what the source says about it. How courses are placed