BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv5.3.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://aarms.math.ca
X-WR-CALDESC:Events for 
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20220101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20220405T113000
DTEND;TZID=UTC:20220405T123000
DTSTAMP:20260609T131438
CREATED:20220330T113152Z
LAST-MODIFIED:20220330T113152Z
UID:6634-1649158200-1649161800@aarms.math.ca
SUMMARY:AARMS Scientific Machine Learning Seminar: Geoffrey McGregor (University of Northern British Columbia)
DESCRIPTION:Conservative Hamiltonian Monte Carlo\n\nMarkov Chain Monte Carlo (MCMC) methods enable us to extract meaningful statistics from complex distributions which frequently appear in parameter estimation\, Bayesian statistics\, statistical mechanics and machine learning. Similar to how flipping a coin\, or rolling a dice\, allows us to sample from the corresponding distributions underlying these processes\, MCMC methods enable us to sample from more complex distributions. The sample statistics of the sequence generated by MCMC will converge to those of the target distribution\, or “stationary distribution” provided certain acceptance and rejection criteria are satisfied. However\, as the dimensionality of the stationary distribution increases\, the acceptance rate of traditional MCMC methods inevitably diminishes and their convergence slows down substantially. This has led to recent developments in computational techniques\, such as Hamiltonian Monte Carlo (HMC) to improve the performance in convergence and acceptance rate. Specifically\, HMC proposes samples for acceptance or rejection by solving a Hamiltonian system of differential equations using volume preserving numerical methods.\n\nIn this talk\, we introduce the Conservative Hamiltonian Monte Carlo (CHMC) method\, which instead utilizes an energy preserving numerical method\, known as the Discrete Multiplier Method. We show that CHMC converges to the correct stationary distribution under appropriate conditions and provide numerical examples showcasing improvements on acceptance rates.\n\nThis is joint work with Andy Wan from the University of Northern British Columbia.\n\nWebex link:\nhttps://mun.webex.com/mun/j.php?MTID=mdff68bb6ee4a7d34ae94a2b77b2c4888
URL:https://aarms.math.ca/event/aarms-scientific-machine-learning-seminar-geoffrey-mcgregor-university-of-northern-british-columbia/
LOCATION:WebEx seminar
CATEGORIES:AARMS Scientific Machine Learning Seminar
ORGANIZER;CN="Alexander%20Bihlo":MAILTO:abihlo@mun.ca
END:VEVENT
END:VCALENDAR