2026-09-20T02:50:39Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1539092024-03-22T04:14:38Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Shanahan, Phiala E.
Zhang, Michael S.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2024-03-21T19:15:20Z
2024-03-21T19:15:20Z
2024-02
2024-03-04T16:38:17.756Z
https://hdl.handle.net/1721.1/153909
Due to its consistency with numerous experimental observations, the Standard Model of particle physics is widely accepted as the best known formulation of elementary particles and their interactions. However, making experimental predictions using the Standard Model involves mathematical and computational challenges due to its complexity. Quantum chromodynamics (QCD), which can be described as an SU(3) gauge theory due to the 3 quark colors and 8 gluon types, is one sector of the Standard Model for which computing solutions is especially challenging. A natural theoretical generalization of QCD is the class of all SU(𝑁) gauge theories; these theories also provide a method for some QCD computations in the 𝑁 → ∞ limit. To study these theories numerically, approximations are calculated from configuration samples due to the mathematical complexity and lack of analytical solutions.
In this thesis, we explore asymptotically efficient flow-based sampling algorithms for the twisted Eguchi-Kawai (TEK) model, a method for analyzing large-𝑁 QCD numerically. We introduce an original architecture based on SU(2) matrix multiplication that allows for efficient Jacobian computation. In addition, we explore the possibility of transfer learning with respect to the number of colors 𝑁 and demonstrate that a model trained quickly on the SU(𝑁) setting also provides useful information in SU(𝑁′), 𝑁′ > 𝑁 cases.
M.Eng.
Massachusetts Institute of Technology
In Copyright - Educational Use Permitted
Copyright retained by author(s)
https://rightsstatements.org/page/InC-EDU/1.0/
Accelerating Flow-Based Sampling for Large-𝑁 Gauge Theories
Thesis
application/pdf
Master
Master of Engineering in Electrical Engineering and Computer Science
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="0025566b-dea5-4e17-bc72-b520c27d582b">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Title>Accelerating Flow-Based Sampling for Large-𝑁 Gauge Theories</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2024-02</PublicationDate>
<Authors>
<Author>
<DisplayName>Zhang, Michael S.</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>https://rightsstatements.org/page/InC-EDU/1.0/</License>
<Abstract>Due to its consistency with numerous experimental observations, the Standard Model of particle physics is widely accepted as the best known formulation of elementary particles and their interactions. However, making experimental predictions using the Standard Model involves mathematical and computational challenges due to its complexity. Quantum chromodynamics (QCD), which can be described as an SU(3) gauge theory due to the 3 quark colors and 8 gluon types, is one sector of the Standard Model for which computing solutions is especially challenging. A natural theoretical generalization of QCD is the class of all SU(𝑁) gauge theories; these theories also provide a method for some QCD computations in the 𝑁 → ∞ limit. To study these theories numerically, approximations are calculated from configuration samples due to the mathematical complexity and lack of analytical solutions.
In this thesis, we explore asymptotically efficient flow-based sampling algorithms for the twisted Eguchi-Kawai (TEK) model, a method for analyzing large-𝑁 QCD numerically. We introduce an original architecture based on SU(2) matrix multiplication that allows for efficient Jacobian computation. In addition, we explore the possibility of transfer learning with respect to the number of colors 𝑁 and demonstrate that a model trained quickly on the SU(𝑁) setting also provides useful information in SU(𝑁′), 𝑁′ > 𝑁 cases.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>