BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//MIT Statistics and Data Science Center - ECPv5.14.2.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:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200214T110000
DTEND;TZID=America/New_York:20200214T120000
DTSTAMP:20220528T121905
CREATED:20200107T205725Z
LAST-MODIFIED:20200127T150809Z
UID:3879-1581678000-1581681600@stat.mit.edu
SUMMARY:Diffusion K-means Clustering on Manifolds: provable exact recovery via semidefinite relaxations
DESCRIPTION:Abstract: We introduce the diffusion K-means clustering method on Riemannian submanifolds\, which maximizes the within-cluster connectedness based on the diffusion distance. The diffusion K-means constructs a random walk on the similarity graph with vertices as data points randomly sampled on the manifolds and edges as similarities given by a kernel that captures the local geometry of manifolds. Thus the diffusion K-means is a multi-scale clustering tool that is suitable for data with non-linear and non-Euclidean geometric features in mixed dimensions. Given the number of clusters\, we propose a polynomial-time convex relaxation algorithm via the semidefinite programming (SDP) to solve the diffusion K-means. In addition\, we also propose a nuclear norm (i.e.\, trace norm) regularized SDP that is adaptive to the number of clusters. In both cases\, we show that exact recovery of the SDPs for diffusion K-means can be achieved under suitable between-cluster separability and within-cluster connectedness of the submanifolds\, which together quantify the hardness of the manifold clustering problem. We further propose the localized diffusion K-means by using the local adaptive bandwidth estimated from the nearest neighbors. We show that exact recovery of the localized diffusion K-means is fully adaptive to the local probability density and geometric structures of the underlying submanifolds. \nBio: Xiaohui Chen received a Ph. D. in Electrical and Computer Engineering in 2013 from the University of British Columba (UBC)\, Vancouver\, Canada. He was a post-doctoral fellow at the Toyota Technological Institute at Chicago (TTIC)\, a philanthropically endowed academic computer science institute located on the University of Chicago campus. In 2013 he joined the University of Illinois at Urbana-Champaign (UIUC) as an Assistant Professor of Statistics\, and since 2019 he is an Associate Professor of Statistics at UIUC. In 2019-2020 he is visiting the Institute for Data\, Systems\, and Society (IDSS) at Massachusetts Institute of Technology (MIT). He received numerous notable awards\, including an NSF CAREER Award in 2018\, an Arnold O. Beckman Award at UIUC in 2018\, an ICSA Outstanding Young Researcher Award in 2019\, an Associate appointment in the Center for Advanced Study at UIUC in 2020-2021\, and a Simons Fellowship in Mathematics from the Simons Foundation in 2020-2021.
URL:https://stat.mit.edu/calendar/chen2020/
LOCATION:E18-304\, United States
CATEGORIES:Stochastics and Statistics Seminar
GEO:42.3620185;-71.0878444
END:VEVENT
END:VCALENDAR