2026-09-19T00:37:20Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1636892025-11-18T06:28:00Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Mansinghka, Vikash
Ghavami, Matin
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2025-11-17T19:07:26Z
2025-11-17T19:07:26Z
2025-05
2025-08-14T19:31:49.209Z
https://hdl.handle.net/1721.1/163689
0000-0003-3052-7412
This thesis presents a comprehensive approach to GPU-accelerated inference for discrete probabilistic programs. We make two key contributions : (1) a factor graph IR implemented in JAX that supports variable elimination and Gibbs sampling, and (2) a modeling DSL with a compiler that lowers programs to the factor graph IR. Our system enables significant performance optimizations through static analysis of the factor graph structure. Variable elimination is optimized by reduction to tensor contraction with optimized contraction paths, while Gibbs sampling is automatically parallelized through graph coloring techniques. Empirical evaluations on standard benchmarks demonstrate orders of magnitude performance improvements over existing systems, with the parallelized Gibbs sampler showing speed-ups of up to 144x on Bayesian networks and even greater improvements for models with regular graph topologies such as Ising models and hidden Markov models.
S.M.
Massachusetts Institute of Technology
Attribution 4.0 International (CC BY 4.0)
Copyright retained by author(s)
https://creativecommons.org/licenses/by/4.0/
GPU-accelerated Inference for Discrete Probabilistic Programs
Thesis
application/pdf
Master
Master of Science in Electrical Engineering and Computer Science
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="7d62a913-2083-48b5-8c93-a9c0202f14ed">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Title>GPU-accelerated Inference for Discrete Probabilistic Programs</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2025-05</PublicationDate>
<Authors>
<Author>
<DisplayName>Ghavami, Matin</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>https://creativecommons.org/licenses/by/4.0/</License>
<Abstract>This thesis presents a comprehensive approach to GPU-accelerated inference for discrete probabilistic programs. We make two key contributions : (1) a factor graph IR implemented in JAX that supports variable elimination and Gibbs sampling, and (2) a modeling DSL with a compiler that lowers programs to the factor graph IR. Our system enables significant performance optimizations through static analysis of the factor graph structure. Variable elimination is optimized by reduction to tensor contraction with optimized contraction paths, while Gibbs sampling is automatically parallelized through graph coloring techniques. Empirical evaluations on standard benchmarks demonstrate orders of magnitude performance improvements over existing systems, with the parallelized Gibbs sampler showing speed-ups of up to 144x on Bayesian networks and even greater improvements for models with regular graph topologies such as Ising models and hidden Markov models.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>