Found 5 relevant results in 2.04s where lecturer="Yuansi Chen"

Search options
Showing results ordered by
Results view
401-4634-24L 2024S , 2026S 4 Credits DR , MSC D-MATH

This is a master/PhD level course to prepare students for academic research in Markov chain Monte Carlo sampling algorithms, diffusion generative models and the associated theory. We cover basic sampling algorithms, provide geometric intuitions and demonstrate theoretical frameworks to analyze their computational and statistical performance.

2024S
401-4634-DRL 2024S 1 Credits DR D-MATH

This is a master/PhD level course to prepare students for academic research in Markov chain Monte Carlo sampling algorithms, diffusion generative models and the associated theory. We cover basic sampling algorithms, provide geometric intuitions and show frameworks for proving results in log-concave sampling.

401-4627-00L 2005W , 2006W , 2007W , 2008W , 2020S , 2021S , 2022S , 2025W , 2026W 4 Credits BSC , MSC D-MATH

Empirical process theory provides a rich toolbox for studying the properties of empirical risk minimizers, such as least squares and maximum likelihood estimators, support vector machines, etc.

2005W
2006W
2007W
2008W
2020S
2021S
2022S
2025W
401-3382-25L 2025S 4 Credits DR , MSC D-MATH

Markov semigroups provide very general models and tools in the analysis of time evolution phenomena and dynamical systems.This course is a modern overview on probabilistic and geometric aspects of Markov semigroups and associated functional inequalities such as log-Sobolev inequalities.

401-3620-74L 2024W 4 Credits BSC , MSC D-ITET , D-INFK , D-MATH

Through reading a series of research articles on Bayesian computation, we first review several basic types of posterior sampling problems that arise in Bayesian statistical inference. Then we discuss how tailored MCMC sampling algorithms were designed to provide efficient sampling for each type of problem, the intuition behind them and theoretical justifications of their computational complexity.