Path-Guiding Algorithms to Improve Efficiency

Wednesday, April 1, 2026 - 12:30 to 13:30

Thackeray 325

Speaker Information
Omar Chehab
Carnegie Mellon University

Abstract or Additional Information

Modern algorithms for sampling, estimating normalizing constants, and estimating likelihoods often rely on a probability path that connects a complex target distribution to a simple base distribution such as a Gaussian. In this talk, I will discuss the limitations of classical methods, show how using probability paths can improve their efficiency, sometimes dramatically, and present principled strategies for designing the probability path.