BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UM//UM*Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/Detroit
TZURL:http://tzurl.org/zoneinfo/America/Detroit
X-LIC-LOCATION:America/Detroit
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20070311T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20071104T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260119T092447
DTSTART;TZID=America/Detroit:20260121T160000
DTEND;TZID=America/Detroit:20260121T170000
SUMMARY:Workshop / Seminar:Student AIM Seminar: Sampling with Langevin Dynamics: Theory\, Algorithms\, and Limitations
DESCRIPTION:This talk introduces the overdamped Langevin stochastic differential equation as a method for sampling from complex probability distributions\, with brief historical context from statistical physics. We begin by deriving the infinitesimal generator of the Langevin diffusion and the associated Fokker–Planck equation\, which governs the evolution of probability densities. This correspondence allows us to characterize invariant (stationary) distributions and to analyze qualitative dynamical behavior\, including probability flow and transition times between modes of the distributions.\n\nExploiting the special Gibbs form of the stationary distribution\, we show how overdamped Langevin dynamics can be used as a practical sampling mechanism for high-dimensional target distributions. We then compare classical Metropolis–Hastings algorithms with Langevin-based methods\, highlighting their respective strengths\, such as improved scalability with data through gradient information\, as well as their limitations\, including discretization bias and sensitivity to step size. We conclude with remarks on challenges that arise when applying Langevin-based samplers to latent-variable models\, such as latent Dirichlet allocation and tree-structured latent variable models\, where other methods such as Variational Inference perform much quicker with great results.
UID:143954-21894310@events.umich.edu
URL:https://events.umich.edu/event/143954
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:Applied Mathematics
LOCATION:East Hall - 3088
CONTACT:
END:VEVENT
BEGIN:VEVENT
DTSTAMP:20251126T124446
DTSTART;TZID=America/Detroit:20260121T160000
DTEND;TZID=America/Detroit:20260121T170000
SUMMARY:Workshop / Seminar:Thompson Sampling Algorithm for Stochastic Differential Games
DESCRIPTION:We study a stochastic differential game with $N$ competitive players in a linear-quadratic framework with ergodic cost\, where $d$-dimensional diffusion processes govern the state dynamics with an unknown common drift (matrix). Assuming a Gaussian prior on the drift\, we use filtering techniques to update its posterior estimates. Based on these estimates\, we propose a Thompson-sampling-based algorithm with dynamic episode lengths to approximate strategies. We show that the Bayesian regret for each player has an error bound of order $O(\sqrt{T\log(T)})$\, where $T$ is the time-horizon\, independent of the number of players. This implies that average regret per unit time goes to zero. Finally\, we prove that the algorithm results in a Nash equilibrium.
UID:142237-21890255@events.umich.edu
URL:https://events.umich.edu/event/142237
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:Mathematics
LOCATION:East Hall - 1360
CONTACT:
END:VEVENT
END:VCALENDAR