BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//MIT Statistics and Data Science Center - ECPv6.0.13.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:MIT Statistics and Data Science Center
X-ORIGINAL-URL:https://stat.mit.edu
X-WR-CALDESC:Events for MIT Statistics and Data Science Center
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20170312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20171105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20171020T110000
DTEND;TZID=America/New_York:20171020T120000
DTSTAMP:20230610T181941
CREATED:20170801T015204Z
LAST-MODIFIED:20171129T205320Z
UID:1682-1508497200-1508500800@stat.mit.edu
SUMMARY:Inference in dynamical systems and the geometry of learning group actions
DESCRIPTION:Abstract: We examine consistency of the Gibbs posterior for dynamical systems using a classical idea in dynamical systems called the thermodynamic formalism in tracking dynamical systems. We state a variation formulation under which there is a unique posterior distribution of parameters as well as hidden states using using classic ideas from dynamical systems such as pressure and joinings. We use an example of consistency of hidden Markov with infinite lags as an application of our theory. \nWe develop a geometric framework that characterizes the synchronization problem — the problem of consistently registering or aligning a collection of objects. The theory we formulate characterizes the cohomological nature of synchronization based on the classical theory of fibre bundles and that synchronization can be characterized by trivial holonomy. We then develop a twisted cohomology theory to quantify obstructions to synchronization\, this is a discrete version of the twisted cohomology in differential geometry. \nMotivated by our geometric framework\, we study the problem of learning group actions — partitioning a collection of objects based on the local synchronizability of pairwise correspondence relations. A dual interpretation is to learn finitely generated subgroups of an ambient transformation group from noisy observed group elements. A synchronization-based algorithm is also provided\, and we demonstrate its efficacy in a problem in geometric morphometrics\, clustering the molars of primates according to their eating habits. \n Biography: Sayan Mukherjee is Professor of Statistical Science\, Mathematics\, Computer Science\, and Biostatistics \& Bioinformatics at Duke University. He received a PhD in 2001 from the Center for Biological and Computational Learning at MI. He was a Sloan-DOE Postdoctoral Fellow in Computational Biology 2001-2004 at the Broad Institute of MIT and Harvard. My research areas cover Bayesian methodology; computational and statistical methods in statistical genetics\, quantitative genetics\, cancer biology\, and morphology; discrete Hodge theory\, geometry and topology in statistical inference; inference in dynamical systems; machine learning; and stochastic topology. biology being cited over 11\,000 times since 2004.
URL:https://stat.mit.edu/calendar/stochastics-and-statistic-seminar-sayan-mukherjee/
LOCATION:E18-304\, United States
CATEGORIES:Stochastics and Statistics Seminar
GEO:42.3620185;-71.0878444
END:VEVENT
END:VCALENDAR